In an array you have all the numbers from 1 through n (not in order) with one number missing. Find that number. Now, you have two numbers missing. Find both the numbers. Notes: O(n) time solution, O(1) extra space. n may be very large, so beware of overflows!
How to delete a node in a singly linked list without access to the list header.
how to swap big endian and little endian?
If 4 ants start on four sides of a square at the same time in either direction... whats the probability that they wont collide?
The interviewer had asked me a time when it was best not to use OOP after spending several minutes praising OOP.
Design a system that can efficiently scale and store the count of all unique words from a *very large* document-based corpus of text.
Create a simple console drawing application (preferably in Scala)
Dynamic programming questions
Implement integer division
How will you check to see if two integer arrays have any common elements?
Viewing 921 - 930 interview questions