Uber phone interview

Microsoft / Eng
xthof65

Go to company page Microsoft Eng

xthof65
Oct 15, 2018 28 Comments

Gave tech phone screen, was asked LC medium level question.
Discuss few approach and solved using O(n) approach , wrote code and executed and got expected output using Haccker rank.

Told edge case that it will not work with large integer due to overflow problem.

Told solution is to use BigInt or use different approach that will take O( n log n)

What is my chances for on-site?

Edit: was told will be asked 1 question and if time permits will ask one More

comments

Want to comment? LOG IN or SIGN UP
TOP 28 Comments
  • Comcast
    kSoT38

    Go to company page Comcast

    kSoT38
    You didn't give the phone screen, the interviewer did.
    Oct 15, 2018 0
  • Google / Eng
    dheY80

    Go to company page Google Eng

    PRE
    EPAM Systems
    dheY80
    I am just curious, what is a task that require O(n) on small dataset, and require O(n log(n)) on bigger ?
    Oct 15, 2018 3
    • Google / Eng
      dheY80

      Go to company page Google Eng

      PRE
      EPAM Systems
      dheY80
      Thats I’ve got, what the problem is ?
      Oct 15, 2018
    • Vertivco / Eng
      Fast Papua

      Vertivco Eng

      PRE
      YouTube, American Bureau of Shipping, Facebook
      Fast Papua
      Sounds like sort method vs math method. Still can't know without knowing what the problem is.
      Oct 16, 2018
  • Microsoft / Eng
    xthof65

    Go to company page Microsoft Eng

    xthof65
    OP
    Questions was given a sorted array , output square of each value in array ,output should be sorted
    Oct 17, 2018 9
  • Microsoft / Eng
    whozat?

    Go to company page Microsoft Eng

    whozat?
    Sorry, sounds like a reject.
    Oct 15, 2018 2
    • Microsoft / Eng
      xthof65

      Go to company page Microsoft Eng

      xthof65
      OP
      I had solved the question. I had told him the approach of O(n log n) will work for all cases but O(n) will not work, more over solution online doesn't solve for edge case I had describe
      Oct 15, 2018
    • Microsoft / Eng
      whozat?

      Go to company page Microsoft Eng

      whozat?
      I hope I'm wrong, but the last time I interviewed with Uber, I got a LC Hard (it was tagged hard in LC although it's really closer to a medium). I had a working solution at the end of the interview. Still got a reject. This was a year ago. Ymmv.
      Oct 15, 2018
  • Amazon
    OjlG38

    Go to company page Amazon

    OjlG38
    Sorry to hear, but hope for the best.I think it’s totally depends on interviewers.
    What question they had asked ? What edge cases you missed?
    Oct 15, 2018 1
    • Microsoft / Eng
      xthof65

      Go to company page Microsoft Eng

      xthof65
      OP
      I didn't miss any edge cases, I had pointed out edge case that can t be solved using O(n) approach, basically some operation you do leads to integer overflow
      Oct 15, 2018