Senior android Developer
- Coding Round:
- First Round:
- find “longest line” of 1’s in array. Hoizontal and Vertical. Array is made only of 0’s and 1’s, and looks for example like this:
4 4
0 1 1 1
0 1 0 1
0 1 1 0
1 0 1 0 - 2D Array is made only of 0’s and 1’s, you have to find number of island.
- find “longest line” of 1’s in array. Hoizontal and Vertical. Array is made only of 0’s and 1’s, and looks for example like this:
- Second Round:
- Some Android question / Some java questions basic
- Sort an array of 0s, 1s and 2s
- Check if string are palindrome.
- Third Round:
- Design the architecture of Paytm market place.
- Some random questions on Java like threading, collections, hashmap etc.
- Why HashTable not allow NULL but Hashmap allow.
- Array question of finding mission number. etc
- Fourth Round:
- Singleton patterns
- Design your own Arraylist.
- Sorting of linkedlist.
- Program for array rotation
- LRU cache
- Recycler view vs list view.
- Services, Fragment, app optimization, retainInstance() in fragment, Asynctaskrotation problem etc
- Graph traversal for circular loop example.
- Find max of Stack optimize way.
If you like neveropen and would like to contribute, you can also write an article and mail your article to review-team@geeksforgeeks.org. See your article appearing on the neveropen main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
Related Practice Problems
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!