Phone interview 1: 1. Describe what a hash map/table is. Later evolved into how to deal with collisions. 2. Write the code to take an int array and return a new int array whose value at i is the product of all values in the input array except the value at i.
You have two sorted arrays - how can you effectively merge them into one giant sorted array?
"You are given an array of integers where every integer occurs an even number of times, except one integer that appears an odd number of times. Return the odd occurring integer. Write functioning code and read it to me when you're done."
First phone screen: Print all the nodes of a tree in reverse level order (ie print all the nodes at the leaves first, then print the nodes on the level above the leaves, and then eventually work your way to the top).
- Find k-th element from the end of the singlylinked list in single pass?
Given 2 files, each line in the files is considered an entry. Print the entries that are duplicated in both files such that the number of repeated entries are minumal. Example: File 1: aaa aaa bbb bbb bbb ccc File 2: aaa aaa aaa bbb bbb result: aaa aaa bbb bbb
How can we store the name of street in a map service? Because street names have characters in common.
How to find a string in a large file storage
I expected higher level questions for a senior position. I was not expecting all of the questions to be about foundational data structures and algorithms (which I was a bit rusty on).
2nd largest number in an array
Viewing 1941 - 1950 interview questions