Given a word that consists of two words such as "aman" give all the combination of valid two words. You are given a dictionary to test against. Example: aman--> a man, am an. watermelon--> water melon
Grad Interview Questions
7,385 grad interview questions shared by candidates
I need to find the maximum length of consecutive integer sequence in Binary Search Tree.
Pretty standard programming questions for someone coming out of college.
All about data structures and algorithms
they gave us a very quick interview in the info section
A follow up on the main question was how can we "scale" that algorithm ?
When would you want to use a hash table over a binary search tree? What are the Big O's?
Implement a skiplist on the whiteboard
1. a median-level sliding window question. 2. median level array 3. hard level array 4. hard level HashMap 5 Hard-level distributed system 6. median-level tree
Can't disclose actual questions due to NDA, but they consist of the following: 1. Medium - Hard Leetcode style questions 2. Linux debugging 3. Storage System 4. Test plan style questions
Viewing 941 - 950 interview questions