Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

OLA Cabs Interview Experience | Set 2 (For Android – 1.5 Years)

  • Difficulty Level : Easy
  • Last Updated : 03 Jun, 2019

First Round

Written Test

Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!

Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsoft, TCS, Wipro, Google and many more!

1) Implement Stack Operations. Also maintain count of Largest Integer present in Stack at any given point of Time.

2) Implement Minesweeper Game.

3) Design an Android application to emulate Countdown .. Take Input from the User and start counting down from entered value till Zero with Updating App UI at every count. Show Countdown end message when reached at Zero

1st Round.
Lots of Java basics
Android Activity lifecycles and detailed discussions about it
Services and Fragments Lifecycle.
Difference methods of Creating Threads
One fragment Related Coding problem where UI of Fragment B has to be updated from fragment A.
How Garbage Collector Works in Android.
Questions on Dalvik Virtual Machine.
Different types of BroadCasts and Broadcast Receivers

2nd Round
DS Questions
Find Total number of leaf Nodes in B-tree
Clone Linklist with random pointers.
Find Missing number in AP.
Print Left View of B-Tree.
Some Java Questions based Exceptions

3rd Round
Current Project Discussion.
Few questions related to that.
Questions on Telephony Class and Geofencing.
Problem related to Reverse geocoding.
Persistent Storage types in Android.
Discussion on Content Providers and Shared Preferences.
Coding on Content providers

Given a rotated array ‘K’ times (K unknown), find a number in most efficient way.
Scheduling algorithms in OS. (Implement LRU using choice of your language)
BFS traversal of B Tree.

Key is to Stay ultra confident, smile and try solving each problem with whatever way you know.
Good Luck.

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

My Personal Notes arrow_drop_up
Recommended Articles
Page :