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.
Didnt ask anything about me or my resume. They sent ma link to write the code. Asked me to write the code for finding the number of words in a string without using split and scanner. Then asked me to improve the code to accommodate corner case i.e if multiple spaces or null string etc. Asked me to write the test cases for the program.
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.
Sort an array of integers with only 1s and 0s. Then sort an array of integers with numbers between 0 and 99.
Create a simple console drawing application (preferably in Scala)
Dynamic programming questions
Viewing 1091 - 1100 interview questions