LinkedIn & Twitter & Hulu & Cousera & LiveRamp 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 f
  您好！
  本帖隐藏的内容需要积分高于 188 才可浏览
  您当前积分为 0。
  使用VIP即刻解锁阅读权限或查看其他获取积分的方式

  游客，您好！
  本帖隐藏的内容需要积分高于 188 才可浏览
  您当前积分为 0。
  VIP即刻解锁阅读权限 或 查看其他获取积分的方式
  Unlock interview details and practice with AI
  Curated Interview Questions from Top Companies
  
  s current window’s minimum value.
  

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
  

楼主linkedlin的题目是暴力法还是有更好的做法？谢谢