Two question one based on Graph and one based on Graph. The Graph question was related to Disjoint set Union
Was able to pass all the test cases successfully
One question based on BFS and the follow up was related to Dijkstra
Was able to code and interviewer was happy.
My Expected Verdict: Strong Hire
One question related to Priority Queue. Similar to the scheduling meeting in a room problem. Was not able to code not even brute force. Wasted time optimising and did not write brue force.
I think its better to atleast write a brute force. they focus a lot on working code.
My Expected Verdict: No Hire
One question related LLD of a system where producer can publish a message and subscriber subscribe to it. This was mainly arounf multithreading and a working solution was needed.
My Expected Verdict: Strong Hire
I am still confused if they will continue with me. If they do i will edit this post else this was all about my journey with uber