Skip to content
Related Articles

Related Articles

Uber Interview Experience (SDE 3.5 Years)

View Discussion
Improve Article
Save Article
  • Difficulty Level : Easy
  • Last Updated : 31 Mar, 2019

Round 1(Online Testing Round)
1) What is the minimum time it will take to complete N trips with K cabs
No of cabs(K) No trips(K)
Time taken by 1 cab
Time taken by 2 cab
Time taken by k cab

Round 2
1) Maximum number of consecutive 1 in binary circular array.

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!