Given an infinite number of bricks of given weights w (say w = [1, 2]) and a truck of capacity c (say, c = 3), how would you find all possible combinations of bricks that match the capacity exactly? Duplicates such as [1,2] and [2,1] are NOT allowed.
string parsing question
design an algorithm to located a retail location in an optimal position relative to our users.
The programming problem was difficult because you must show programming prowess without overengineering the problem because it is simple, oh yeah it has to work too.
Swap two integers, say a =4 and b=6, without using a third variable.
1st phone: Anagram problem, merge two sorted linked list, and the last ten minutes talked about LRU. 2nd phone: The problem was easy to understand, but I believe the solution would be really long. I didn't get it right, so failed on here. Given a string, parse it and return a string array. It's like a tokenizer, but the rules are too... For exmple, string="abc(edf)hij{klmn}opq[rst]uvw" The delimitors are (), {}, []. They are in pair. So output array: ["abc", "edf", "hij", "klmn", "opq", "rst", "uvw"] That's the rule 1. The rule 2 is, if any two consecutive "(" means escaping, that is "((" is actually output char "(". It's not part of the delimitor. Similar to ")", "{", "}", "[", "]". abc(e))df) => ["abc", "e)df"], since the "))" outpus ")". Rule 3: if "{" is inside a delimitor pair (), then "{" isn't part of the delimitor. Output it as is. abc(e{df}}g) => ["abc", "e{df}}g"] So, parse the given string and assume the given string is always valid and parsable. I think state machine is a good direction. But I didn't finish it.
How did you solve the problem of the camera mount shaking while in flight?
. You have three kinds of magazines, all but two are Times, all but two are Science, all but two are Nature. How many magazines in total do you have?
who is your idol
implement a function that determines a string is whether a palindrome or not
Viewing 2061 - 2070 interview questions