Given two arrays, write a method to find their intersection?
Software Development Engineer I Interview Questions
1,214 software development engineer i interview questions shared by candidates
What is a hash map? How could you use hash maps to find the intersection between two arrays faster?
Given sample code and asked to determine what it was supposed to do. Then asked to point out everything wrong with it.
Calculate distance between two nodes recursively.
One of the questions was merging of k-sorted arrays. The solution expected was the one using heap.
R2_B: Stack implementation with getMin(), getMax(), Push(), Pop() in O(1).
Linked list questions
Binary tree style question
What did you do to solve a relationship problem inside your former team?
Maps, Recursion, and good OOP are your friends.
Viewing 1061 - 1070 interview questions