Given inputs from Google Search, you have K chunks. Each chunk is individually alphabetically ordered (apple, banana, cat) ... (*apple, *banan, *cat). You want to merge all chunks into a single list. How would you do it? What limitations are there to your approach? It's on an x86 processor, what does that mean and how does that affect your approach?
Write a regular expression to match a machine's MAC address
Given a set of cities, each with a given population, select randomly a city with a probability that is proportional to the population.
Sie haben eine Datenbank mit Angestellten und ihren Hierarchien. Konstruieren Sie eine SQL-Anweisung, um jeden Angestellten mit seinem Supervisor zu verbinden.
Design a data structure for LRU cache
Given a set of intervals(time in seconds) find the set of intervals that overlap
Implement a function boolean matches(String text, String pattern) to find match pattern in the string, pattern can be seperated but the order of letters in pattern cannot be changed.
1. merge two sorted lists. 2.merge k sorted lists He asked followed up questions about memory allocation, difference between heap and priority queue, , time complexity and a few issues with my STL usage.
Write code to determine if a given input string contains balanced parentheses.
This was one of the more standard questions. You have stairs with N number of steps. You can take either one step steps or two step steps; how many ways can you climb the stairs?
Viewing 2091 - 2100 interview questions