On campus: Given two strings determine if there is a one to one mapping between each letter in the string. On-site : Debug Conway’s game of life, snake key pattern of a matrix (the problem was a disguised diagonal traversal of a matrix), word break (see LeetCode), and find all possible words given a telephone number.
who was Italy an ally to in world war ii
9 bottles of wine and one is poison, how can you conclusively figure out which is poison with only 2 rats to test with and only 2 rounds of testing?
replace the "a" in a sentence to "the"
They didn't really ask any technical questions, it was more of a conversation about what I wanted to do.
Given the root of a tree and a target node, find the cousins of the target node (those that are on the same level as the target node, but do not share the same parent).
Some webpage design problems
The technical question was: You're given an array of strings. Sort it so that the result returns an array of an array of strings sorted into its anagrams. (e.g. input: ["aa", "ad", "da"], output: [ ["aa"], ["ad", "da"] ]
find the sum of two integers represented as strings, return the sum as string, i.e "123" and "456" would return "579".
Design an LRU cache. It's a data struct with a capacity. Beyond this capacity the least recently used item is removed. You should be able to insert an element, access an element given its key, and delete an element, in constant time. Note that when you access an element, even if it's just for a read, it becomes the most recently used.
Viewing 2401 - 2410 interview questions