一亩三分地论坛

 找回密码
 获取更多干货,去instant注册!

扫码关注一亩三分地公众号
查看: 241|回复: 1
收起左侧

LinkedIn & Twitter & Hulu & Cousera & LiveRamp OA

[复制链接] |试试Instant~ |关注本帖
zjuzqj 发表于 2016-11-18 06:48:37 | 显示全部楼层 |阅读模式

2016(10-12月) 码农类 硕士 实习@LinkedIn & Twitter & Hulu & Cousera & LiveRamp - 内推 - 在线笔试 |Passfresh grad应届毕业生

注册一亩三分地论坛,查看更多干货!

您需要 登录 才可以下载或查看,没有帐号?获取更多干货,去instant注册!

x
本帖最后由 zj45499 于 2016-11-18 06:54 编辑

帖子在我博客: http://zhouqj.com/blog/2016/11/17/Share-my-experience-with-LiveRamp-Twitter-LinkedIn-Hulu-Coursera-OA/
. 涓浜-涓夊垎-鍦帮紝鐙鍙戝竷
方便,这里我也粘贴出来
  • Recently I am seeking for 2017 summer software engineering intern therefore I accumulated some OA experience and dicide to post them once all.
LiveRamp
  • Given 4 numbers(0-9) and asked you find the largest combination that represents a time, e.g.  5, 9, 3, 2 after combination should return "23:59", input type is four int and output is string. It mentioned that you needn’t consider the time complexity but just the correctness.
  • Given an unordered array represents series of students’ heights. You should resort them to gain the ascending(allow equal) sequence. return the minimum number of students you have to adjust in original array to reach your final goal. It requires maximum time complexity is O(nlogn)
Solution
  • loop in loop for 4 times, in the last loop check they can formed a time or not and update the return result if necessary
  • Sort the array and find the first and last different height compared with original sequence. return their difference. Waral 鍗氬鏈夋洿澶氭枃绔,
Twitter
  • A SQL question but I don’t remember that right now. It’s said that Twitter OA questions are related with your resumes.
  • Given a m*n matrix and you have to start from left-up unit and your goal is to reach at the right-bottom unit. Rule is that you can go from (1)left unit to right unit(horizon) or (2)upper unit to lower unit(vertical) or (3)left-up unit to right-down unit(diagonal) for one step once a time. Asked how many different routes to finish your goal
  • Given a sentence like "Twitter is a good company", but once a time you can just handle k characters. Asked the maximum number of words you can handle with such a constraints, e.g. in "Twitter is a good company" and given k=4 your program should return 2 with respect to "is a"
Solution
  • To be remembered
  • Dynamic programming
  • Sliding window to keep a deque
LinkedIn
  • Give a string, find the number of its distinct substring which is a palindrome, e.g. absb should return 4 which are "a", "b", "s", "bsb"
Solution
  • loop from the start character to the end character, at each iteration choose current character as the center and expand char by char to side to find all the palindromes with center as current character. 鐗涗汉浜戦泦,涓浜╀笁鍒嗗湴
Coursera
  • [Multiple Choice]Choose the operation has the time complexity of O(1)
  • [Multiple Choice]Given an array, if pick the midian is O(log n), how about the worst time complexity of quick sort
  • An infinite dimension matrix, each time given a coordinate (m,n) and all the units within 0<= x <= m and 0<= y <= n will increments by 1. return the number of the unit have the maximum value after applying all the coordinates
  • Given an unordered array, and an integer k, find the minimums of all the subarrays with length k, and finally return the maximum of all these minimums
Solution
  • To be remembered
  • To be remembered
  • Just find the minimum x and minimum y among all the given coordinates and return (x+1)*(y+1)
  • Loop from the start to the end-k. Track a sliding window with a deque(size may not necessarily be k, may be less than k) whose first element is current window’s minimum value.. visit 1point3acres.com for more.
Hulu
  • Hangman), give an API that you can call and you have 3 times for wrong guess(the char you guessed doesn’t appear in given setence) for each Hangman round. If 3 wrong tolerant times run out, you will fail current round and go for next round. Try your best to improve your accuracy in 6-hour OA
Solution
  • No correct answer for this problem I think, just break through the limit of yourself




评分

1

查看全部评分

say543 发表于 6 天前 | 显示全部楼层
楼主linkedlin的题目是暴力法还是有更好的做法?谢谢
回复 支持 反对

使用道具 举报

本版积分规则

请点这里访问我们的新网站:一亩三分地Instant.

Instant搜索更强大,不扣积分,内容组织的更好更整洁!目前仍在beta版本,努力完善中!反馈请点这里

关闭

一亩三分地推荐上一条 /5 下一条

手机版|小黑屋|一亩三分地论坛声明 ( 沪ICP备11015994号 )

custom counter

GMT+8, 2016-12-10 19:12

Powered by Discuz! X3

© 2001-2013 Comsenz Inc. Design By HUXTeam

快速回复 返回顶部 返回列表