it is basic algorithms. The first is a sort algorithm. There is an array with a million integer. The integer's length is 10 bit. Find an algorithm with run complexity of N. The second is about detect if there is any circle in a linkelist
Developer Intern Interview Questions
12,191 developer intern interview questions shared by candidates
Given a keyword (ex: "abc") and a list of words (ex: "aabc", "cab", "ab"), write a function that will return all words in the list that are the same/anagrams of the keyword. In this case, "cab" would be the only word returned. Later changes to the function were added: numbers and symbols might be included in the words but were to be ignored ("ca2b" still matched "abc"), make the function not case sensitive ("A" == "a"), etc...
Reverse every k nodes in given Linked List.
Write a binary tree implementation in any language you want.
As for the multiple choice they were basic interview/coding questions while the in person interview asked me about priority queues.
General questions about JavaScript + 2 DS&A whiteboard questions in C++
Second Interview. Write code to compute result of expression binary tree? What's the time complexity?
reverse a string
Find all of the non-concentric palindromes in a string. Do so in linear time.
Play a game that always starts from you. Each time you can only pick up 1 or 3 or 4 coins from the table. Who leaves the enemy with no coins to pick up wins the game. Assume that your enemy is super intelligent that if there is a way he/ she can win, he/ she wins. Question: Write a function to return if you will win or lose the game say given n coins on the table.
Viewing 1331 - 1340 interview questions