Write a function to search for a string within another string. Analyze it's complexity, and propose optimizations.
Software Engineers Interview Questions
419,174 software engineers interview questions shared by candidates
given an arrya of numbers see if you can get to index with 0 in it from an index by jumping through the array using the values in the array. So if you have [1,2,1,0,3] you can get to 0, from 0 by jumping 0, you can get to 0 from 3, by jumping 3 index down to 2 and then jumping 2 index up to 0...
Find the median of unsorted array in O(nlog n ) time. You need to know that particular mathematical algorithm, anything slower your answer is rejected.
(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)
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
Implement a method called printNonComments() which prints out a extract of text with comments removed. For example, the input: hello /* this is a multi line comment */ all Should produce: hello all You have access to a method called getNextLine() which returns the next line in the input string.
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.
Viewing 701 - 710 interview questions