A lot of tree traversal questions. Also implement mergesort.
Ingeniero I Interview Questions
6,859 ingeniero i interview questions shared by candidates
One of the questions was merging of k-sorted arrays. The solution expected was the one using heap.
What did you do to solve a relationship problem inside your former team?
Given two arrays, write a method to find their intersection?
What is a hash map? How could you use hash maps to find the intersection between two arrays faster?
Find the largest branch in a tree that is itself a binary search tree
Given sample code and asked to determine what it was supposed to do. Then asked to point out everything wrong with it.
LRU cache Two sum
Implement Bloggle(Find all possible words in a board of characters).
Consider a rectangular mesh (intersecting horizontal and vertical lines ). These lines represent intersecting roads. You are standing at top left intersection and you need to reach to a resort located at bottom right intersection. On your way, you can see interesting sights which are given points (weightage). You are lazy to walk (i.e. you wont walk left / up. You will only walk to right or down). While reaching resort , you want to cover maximum points (see things that have more weightage). Write a program to calculate maximum number of points that you can cover. He later asked me to improve solution by avoiding paths already visited.
Viewing 6671 - 6680 interview questions