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?
Merge 'k' sorted arrays, each array may have max 'n' elements
Given an integer array, find if the target sum exists as the sum of contiguous elements.
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
Reverse a string
Viewing 1041 - 1050 interview questions