If you were a gerbil, which gerbil would you be?
Software Engineer Interviews
Software Engineer Interview Questions
Software engineers write programs to design and develop computer software. Interviews are highly technical, so come ready to work through coding problems and math brainteasers. The specific questions you are asked will depend on what type of programming position you are looking for. Try researching a specific software discipline such as web development, application development, or system development.
Top Software Engineer Interview Questions & How to Answer
Question #1: How would you describe your programming task process?
Question #2: Which programming languages do you know and prefer?
Question 3: What is an example of a successful project that you completed?
418,653 software engineer interview questions shared by candidates
The Game of Nim worded diffently.
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
out of 25 horses select the fastest three in minimum number of races where in each race there would be exactly five horses.
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.
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'
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 121 - 130 interview questions