Technical Given an unsorted array of numbers (that may contain repeated numbers), print or produce a data structure that contains all the pairs that have a sum equal to a number k. Do not include pairs that are the same numbers in a different order. Ex. [3,2,6,2,0,5,3,8,7,10] [(0,10),(2,8),(3,7)]
Write a minPeak function for a stack (function that returns the minimum element in the stack).
From a tree, get a List of a List of Integers where each List of Integers corresponds to all ints at depth i from the root.
Implement java's pow function
Write a function that takes in an integer N and returns the sum for all numbers between 1 to N excluding multiples of 3 and 5.
Logic Puzzle : How would you measure exactly 9mins using a 4 minutes and a 7 minutes hourglass
Common interview problems like string processing. Remove repeated chars in a string.
Implement a fast exponentiation function
Given an array of 1..n numbers with 2 numbers missing in it find the missing ones.
what is the best way to find the duplicates within two intersecting linked list?
Viewing 171 - 180 interview questions