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.
Given an array of integers, provide an efficient way of finding an integer that appears only once in this array.
Find the largest continuous sum given an array of integers. Given an array of characters and a dictionary sorted in alphabetical order, find the ten longest words in the given dictionary that could be formed using the characters in the array.
Reverse a string.
Would Java Bytecode generated by Java 7 work on a JVM made to function on Java 1.0?
Given a matrix of numbers in which all the numbers along the row are increasing. How to find the maximum value.
Operating system questions, explaining some concept like process, thread, ... Also some acronym that I can't recall.
Print tree level by level, with a new line for each level
Reverse a linked list destructively
Viewing 301 - 310 interview questions