Given an array of integers, all but one of which appears an even number of times, find the one integer which appears an odd number of times. Upon completion, asked to improve the algorithm in terms of both time and space, eventually asked to do it in O(n) time and constant space.
2. You have an array (size is not known) and whose elements are having the values from 0-> 99. Find out the three largest elements in that array and return those.
Find the numbers in an array that appear an odd number of times.
Given the word "HEAD" and the word "TAIL," write code and/or describe using computer science algorithms how you would transform from the word HEAD to the word TAIL. Each change must be by only one letter, you cannot change the letter in a given position twice, and each new word must be a valid word.
Given an integer array which consists of numbers from 1 to N with 1 number missing find the missing number. What will you do if 2 numbers are missing?
Two sorted arrays. you can start from any one them, and then at common element you may or may not jump to other array. Continue in this manner till you reach the end of an array. Find the path that results the maximum sum.
Implement a Queue using 2 Stacks
Given a string determine if it consist of valid concatenated words. "dogcatfish" --> true because it can be split int "dog","cat", and fish "dogecatfish" --> false
Print a binary tree level by level in zigzag order
You have a box of red balls, a box of blue balls, and a box of red and blue balls. What is the minimum number of boxes you can open and know what is the contents of each box?
Viewing 141 - 150 interview questions