(Phone screen questions) 1. For a given binary tree, print paths from root to all leaf nodes, one path per line. 2. Given a sequence of positive integers "seq" and an integer "total", return whether a contiguous sequence of "seq" sums up to "total". (Onsite interview questions are covered by NDA therefore can't post, but it can be said that the knowledge of data structures and handling edge cases are important for the coding interviews)
Give the count and the number following in the series. for e.g 1122344 first line output : 21221324 next line : 12112211121214 and so on...
Given an unsorted string, determine if it can be presented as a palindrome. 'MMO'-True, 'DOOR'-False
Given a collection of words, return a collection of anagrams found in the given collection
You are given a set of numbers 0 - n. Given a k, print all subsets of size k. Give the time complexity of the algorithm.
calculate x^1/2
Given array find 3 elements that sum up to 0.
I said suffix tree is the best way to go, so he asked me how will a node of that tree will look like?
Given a binary tree, print the average of each level.
Find the two largest numbers in an array
Viewing 661 - 670 interview questions