If you were a gerbil, which gerbil would you be?
Software Developer Engineer Interview Questions
466,349 software developer engineer interview questions shared by candidates
Create a stack of numbers where the maximum number is always known.
Same as above but another one is taken out again. Find the two missing nubmers
Traverse nodes in a binary tree
In a stream of integers from 1 to n, only one number will be repeated. How can you tell what that number is?
An abstract question about ways to simulate behavior of workers who move stools around a workspace in some controlled way, and what the expected results would be.
Scan an integer and print the alphabet so that: 1-A; 2-B...26-Z; 27-AA,28-AB,29-AC...52-AZ; 53-AAA,54-AAB,55-AAC...78-AAZ...etc.. If you provide an integer, say 28-it should print AB. If you scan another integer say 55, it should show AAC
Given two (dictionary) words as Strings, determine if they are isomorphic. Two words are called isomorphic if the letters in one word can be remapped to get the second word. Remapping a letter means replacing all occurrences of it with another letter while the ordering of the letters remains unchanged. No two letters may map to the same letter, but a letter may map to itself. Example: Given "foo", "app"; returns true we can map 'f' -> 'a' and 'o' -> 'p' Given "bar", "foo"; returns false we can't map both 'a' and 'r' to 'o' Given "turtle", "tletur"; returns true we can map 't' -> 't', 'u' -> 'l', 'r' -> 'e', 'l' -> 'u', 'e' -'r' Given "ab", "ca"; returns true we can map 'a' -> 'c', 'b'
* Describe the design of a most-recently-used list, such as the "Recent Files" menu in Microsoft Word. It has two public methods, getlist() and access(str), which retrieve the list and mark an item as accessed, respectively. The list has a maximum number of items it can hold, say 5, and it should not have duplicates. Describe the data structure used and the running time of both public methods.
1. Count the number of positive integers less than N that does not contains digit 4. 2. Design a data structure that can do the followings in O(1) time: (1) insert (2) remove (3) getRandom
Viewing 91 - 100 interview questions