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
Reverse an integer. Looking for optimized solution and definitely no tostring type of solution
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?
1. Reverse string except spaces. A string has mix of alphabets and spaces. Your task is to reverse the string, but preserve the positions of spaces. For example, reverse of " a if" is " f ia" 2. An array of size n has all but one numbers between 1 and n+1. Find the missing one.
Print a binary tree level by level in zigzag order
Given an array of items of three different colors red, green, blue. How would you sort the items in the array so that all the items with a certain color would be grouped together.
In a BST write a program to find 2 nodes x and y such that X+y=k
Viewing 141 - 150 interview questions