1. Internals of HashMap, equals() and hashCode(). 2. How HashMap handles key collisions. 3. Maximum capacity of HashMap can have. 4. ConcurrantHashMap internals. 5. Top view of binary tree. 6. What all features of Mongodb I have worked with. 7. what is Full Text Search and why do you need this 8. What are compound indexes on mongodb and how do they work. 9. Internals of ArrayList, HashSet and fail fast iterators. 10. CopyOnWriteArrayList internals and fail safe iterator in this case. 11. Caching strategy in the projects I have worked on. 12. Given a NxM matrix of integer find a path for which sum of all the cell values on the path is maximum. (DP) 13. Write code for 2 player game in which starts with a initial list of integers. Each player can pick one of the two integers on beginning or end. Each selection should lead to a total sum which is maximum for player 1.
Sigiloso
First off, we're very sorry to hear about this incident.. At Roposo, we strive to deliver a fantastic experience at all levels- from candidate to end user. Since your post is Anonymous, we aren't privy to the exact details of your interview process, but regardless we really appreciate you taking the time out to give us your honest feedback. We'll be sure to take it on board to ensure that similar experiences do not occur in the future.