The Max Bubble sort is O(n) at best, O(n^2) at worst, and its memory usage is O(1) . Merge sort is always O(n log n), but its memory usage is O(n). Explain which algorithm you would use to implement a function that takes an array of integers and returns the max integer in the collection, assuming that the length of the array is less than 1000. What if the array length is greater than 1000?
Given a string with open and closed parentheses, check if the string is balanced i.e. if every open bracket has a corresponding closed bracket.
How does ping work?
Given a binary tree, print the nodes level by level
Find the center of graph(vertex, that is connected with every other vertex, but edges are directed to the center of graph).
Data structure for numbers that supports 2 operations: insert and get_median.
Given a dictionary based simple password, create all possible (special character) passwords based on a provided mapping. Input: face Map: {a -> @, 4, A} Output: f@ce, f4ce, fAce
Add two binary numbers represents in strings, those could be large values.
During the second interview, I was asked to implement LCA in a binary tree (not BST) on collabedit.com. I was close, but not close enough...
A professor wants to see if two students have cheated when writing a paper. Design a function : hasCheated(String s1,String s2, int N) that evaluates to true if two strings have a common substring of length N. Additional question after implementation. Assume you don't have the possibility of using String.contains() and String.substring(). How would you implement this. Questions about complexity of my solution. Overall a very friendly interviewer, was saying "Good" the entire time, but no idea if he wanted to keep me focused or if it was really good.
Viewing 2451 - 2460 interview questions