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?
''' 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
Questionnaires and assignment and basic interview wrt CV
How to would you find out whether a substring occurs in a given string?
how would you find a bottle of poison in four rum bottles with two rats by feeding them the rum only once
your given 2 ordered list A and list B. B has enough space to hold its existing numbers plus all the numbers in A. Add the numbers from A in B. Make sure B is ordered. Whats the fastest way to do this?
It's their "follow the white rabbit" question for back-end developers
What is static methods
In the coding round they asked....take a string in the combination of capital letters, small letters and spaces.after execution it should produce o/p such as capitals at 1st, then spaces, then small letters.eg:- if input is abAB ab.then output should be AB abab.
Viewing 731 - 740 interview questions