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
You didn't give the phone screen, the interviewer did.
Thought everyone uses leetcode these days? Shieeeeet
Was the question multiply strings?
Nope
Sorry, sounds like a reject.
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
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.
Good luck even getting a response!
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?
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
I am just curious, what is a task that require O(n) on small dataset, and require O(n log(n)) on bigger ?
Is the problem tagged under "Math" category in leetcode?
Are the interviews on leetcode ? Or Hacker rank? I have the latter
Personal Finance
Yesterday
3499
IRS took 73K 😭
Tech Industry
20h
2617
Go woke, go broke: Google fires 28 employees involved in pro-Hamas protest
2024 Tax
14h
2308
Biden’s new tax proposal is wild
2024 Presidential Election
5h
1277
Biden ruined America and tech! Tax plans are insane
India
15h
1402
Lost respect for Modiji
Pretty sure you won’t, it one LC medium and one LC easy., looks like you skipped a question