Given a string, remove subsequent duplicate characters until we get a unique set of characters. Ex: input ==> apple ; expected output ==> ale Ex: input ==>appapple; expected output ==>le The input will be in char array. char[] removeDupes(Char[] inputString){ }
Write a function that allows to convert a string to the corresponding number (i.e. implement the atoi() C function)
Probably the most difficult question they asked me was, he put a binary tree on the whiteboard and I had to write a function that would find if the tree was symmetrical or not. Anyone who's familiar with data structures and recursion should be fine with this, just don't freak out when they propose the question.
What would u do if deadline is approaching and ur product is not finished?
implement a stack with a method which can return the minimal value in the stack without remove this value.
Given the daily stock prices of a share during last 30 days, write a program to find out best buying and selling dates for maximum gain. The program should run with O(n) complexity.
given an array of integers(positive or negative), and two integers x, y. write a function that can find a subarray whose sum equals to x and product equals to y
Write a method to decide if the given binary tree is a binary search tree or not.
Given two lists, A and B, of sizes n and k, respectively, describe an algorithm to determine the intersection, C, of the two lists. What is the complexity of your algorithm? (The obvious solution is O(n*k)). Can you describe a solution that is faster? (An optimized solution can do it in O(n+k)).
Given a random array with integers, find every pair that sum up to a certain number.
Viewing 1691 - 1700 interview questions