"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"
Implement a Find-Replace function given a string of text, search string, and replace string. Also a seemingly simple question became very difficult and complex when looked at through the eyes of a tester. A question involved writting a function to classify a triangle given its side lengths.
Given an integer as input, return how many 1's are in the binary representation of that integer.
How to insert a Node in a Linked list.
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
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?
Describe a data structure for which getValue(int index), setValue(int index, int value), and setAllValues(int value) are all O(1).
N people are sitting in a circle labelled 1 through n. They being counting 1,2,3,.... in a clockwise manner and every person that gets a number divisible by 3 is eliminated. Write a program to figure out which numbered person will remain. What's the time and space complexity?
Viewing 641 - 650 interview questions