"You have billions of strings sorted in an array. You don't have any access to it. You just have a method that returns the string pertaining to a index. Use only that method to find the location of a given string" I started out at 0(n^2) and kept on improving to o(logn)
The question that I was asked "Find all the colinear points given a set of coordinates in a plane"
Print all permutations of a string *using no extra memory\data structures* (pointer variables are ok) + after i solved that it became tougher - handle duplicates (E.g aaab permutation should not print duplicates)
how to reverse words in a string preserving the formatting
Describe a data structure for which getValue(int index), setValue(int index, int value), and setAllValues(int value) are all O(1).
Consider n people with random birthdays. How large does n need to be before there is at least a 50% chance that two people have the same birthday?
I choose to respect the NDA. However, the questions were related to data structure and algorithm. It should not be a problem if you are an algorithm master.
Reverse the words in a sentence.
Write a function that determines whether a given number is a prime. Discuss perf improvements.
Design a memory management system
Viewing 631 - 640 interview questions