Create a stack of numbers where the maximum number is always known.
Engineer Interviews
Engineer Interview Questions
Engineers are responsible for designing and building products. In an interview context, expect to be quizzed on your technical skills, and also evaluated for your ability to work as a part of a team to get things built. The specific questions you are asked will depend on what type of engineering position you are looking for such as a specific engineering discipline like software engineer, electrical engineer, or mechanical engineer.
Top Engineer Interview Questions & How to Answer
Question #1: What is the most challenging engineering project you've dealt with, and how did you ensure it was successful?
Question #2: In your current role, what steps do you take to avoid making mistakes?
Question #3: Describe a time you dealt with a difficult client or stakeholder.
840,917 engineer interview questions shared by candidates
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
* 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.
Write a program the generates the power set of a set of numbers
Viewing 211 - 220 interview questions