Write this function (on a Google doc): /*How many ways can you make change given the following denominations? ie, if numCentsToMake is 6 and denominations is [25, 10, 5, 1], then it should return 2: either a nickel and a penny or 6 pennies.*/ int numWaysToMakeChange(int numCentsToMake, int[] denominations)
Given a binary search tree, return the most approximate number to the one passed as input.
Go through a sorted list and print the integers 0-99 that are missing from it
Do you like working in a team or independently? Elaborate.
Give an example of where you had to work in a team
What is an overdamped second order system?
Ask questions about the previous experience; some math questions and Matlab questions. Also some C++ related questions, most are simple and basic. Got rejected after the technique interview.
Write a method to determine if a string2 is a substring of string1?
How would you use all the data at our disposal?
"Have you ever cheated in school?"
Viewing 411 - 420 interview questions