5 horses on a 5-lane track. You have 5 horses and you want to rank the top three. All you have available to you is a track and the ability to tell perfectly in which order the horses crossed the finish line. How many races are necessary in order to rank the top three horses?
how would you find a bottle of poison in four rum bottles with two rats by feeding them the rum only once
It's their "follow the white rabbit" question for back-end developers
Questionnaires and assignment and basic interview wrt CV
''' We want to implement a feature to suggest to users the cheapest hotel that is more popular than the one they are looking at. Write a function that given an array of hotels, sorted by their popularity returns a map from the hotel ids that associates each hotel with the cheapest hotel that is more popular than the one in question. if there is no hotel that is cheaper and more popular than the one with that id, then it shouldn't be put in the map. You can assume that hotel ids and prices are integers and that hotels have the following format: struct hotel{ int id; int price; } Example 1: input = [ { id => 123, price => 200 }, # Most popular { id => 55, price => 150 }, # Second most popular { id => 17, price => 70 }, # Third most popular { id => 18, price => 500 }, # ... { id => 27, price => 270 }, { id => 101, price => 230 } # Least popular ] output = { 18 : 17, 27 : 17, 101 : 17 }
java oops , logic questions
Reversal of all words in a sentence(e.g: "This is a good question" becomes "question good a is This")
Problem solving # 1 : (9 marks) Input is [1,34,3,98,9,76,45,4] and the output should be 998764543431
How to would you find out whether a substring occurs in a given string?
Overview of your previous experience and your team work
Viewing 701 - 710 interview questions