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 list of transactions, How can we calculate the frequency counts of all possible item-sets? For example, Input: ID Purchased Items 1 apple, banana, lemon 2 banana, berry, lemon, orange 3 banana, berry, lemon Output: Itemset Frequency apple, banana 1 apple, lemon 1 banana, berry 2 banana, lemon 3 ... apple, banana, lemon 1 banana, berry, lemon 2 ... banana, berry, lemon, orange 1
Given a Pre-Order and In-Order string of a binary tree, can we and if we can, construct the "Post-Order" String.
1.1. given a list of words, group anagrams. 1.2. find all 3 items that sum to 0 in an array. 2.1. Write a function that calculates input strings with operators +,-,*,/ eg. "5+5*6" should output 35
How objects can send messages to each other in Objective-C
Given a tree, print the values contained at each level on the same line. So if you had the tree with root A, and children B and C, you would print: A B C
How would you store and search 1 million names?
Viewing 1031 - 1040 interview questions