1) Write a function to find the nth Fibonacci number. 2) Optimize your code so that the numbers don't have to be recalculated on consecutive function calls.
Engineering Intern Interview Questions
24,106 engineering intern interview questions shared by candidates
Very unexpected question: are you a US citizen?
1. Find the minimum number of train stations required given a list of departure and arrival times. 2. The online screens had a couple of SAT style questions and some debugging questions.
What is the most appropiate DS to implement a T9 dictionary
Implement a data structure like a stack but with a way to find a max at O(1) time.
Given a linked list, flip every pair of nodes, such that if given a-b-c-d-e, return b-a-d-c-e.
Given two different strings, find the common characters between the two. For example if string A is "hello" and string B is "elbow" the common characters would be ['e', 'l', 'o']. Give a method that returns unique or duplicate entries.
Implement a stack that supports push, pop and mode(the one from statistics) operation. Gave an O(log n ) push and pop and O(1) mode operation.Another good question was implement atoi function. I assumed it as base 10 but was asked to support from binary to any base numbers(even base 50).
Give you an array of integers without duplication. Let you write a piece of code to return the pairs that their sum is 100.
The input to a function is an array of n elements.Output of that function is also an array where each element is product of all elements in the input array except the one with same index. Input ::::: 1 2 3 4 Output ::::: 2*3*4 1*3*4 1*2*4 1*2*3
Viewing 351 - 360 interview questions