Round 1: Online Coding
Q1 Return minimum length positive subarray from a given array.
Q2 Return number of possible strings from a given encoded input Encoding scheme :
A -> 1, B -> 2, … Z-> 26. Given input 123, answer is 3 (as 123 can be ABC or AW or LC)
Round 2: Face-to-Face
Q1. Find number in sorted 2D matrix(sorted row wise and column wise).
Q2. https://www.geeksforgeeks.org/rearrange-a-given-linked-list-in-place/
Q3. https://www.geeksforgeeks.org/problems/picks-up-a-random-song-from-the-playlist-and-plays-it
Round 3: Face-to-Face
Q1. Design database schema similar to https://stackoverflow.com/questions/13490609/database-design-for-comments-and-replies . My answer was similar to accepted answer in this ques. and interviewer was satisfied.
Q2. https://www.geeksforgeeks.org/a-program-to-check-if-a-binary-tree-is-bst-or-not/
Q3. Design optimal DS for following operations : 1) insert(int x)Â 2) boolean exists(int x)Â 3) getKthMostFrequentElement() .
Round 4: Face-to-Face with Engineering Manager
Q1. Design Distributed LRU Cache.
Q2. Design(db and api’s) for BookMyShow like system.
Round 5:Non-Technincal
Why Oyo, describe your dream job, how would you make Uber pool profitable, why do we need manual testers etc. Most of these were open-ended discussion based questions.
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape,
GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out -
check it out now!
Last Updated :
16 Apr, 2019
Like Article
Save Article