1] Given a series of data, cluster it into sub components. It was for a specific use case which was fun to solve. Prepare HashMap well. 2] Given 2 rectangles, find out the smaller rectangle which is formed by the intersection of the larger rectangles. 3] Given a 2D matrix filled with 1s and 0s, find out the number of connected components of 1s.
Prepare data structures - array, list, linked list, binary tree, hash maps, etc
The most unexpected question was "How would you test a parachute?"
calculate the complexities of designed algorithms?
Reverse a string.
Hashing theory nested hashing and n stairs problem
Describe MVC (Model-View-Controller)
Open-ended design on a word search generator
Write the functions for a circular queue.
Describe one of the challenges that you face in your past project.
Viewing 1981 - 1990 interview questions