Let’s say that you have 25 horses, and you want to pick the fastest 3 horses out of those 25. In each race, only 5 horses can run at the same time because there are only 5 tracks. What is the minimum number of races required to find the 3 fastest horses without using a stopwatch?
Favorite project (worked on a team, and was interesting to me) technical questions: 1- have sorted array with empty places at end, want to add element, what to use? 2- have sorted array with empty places at end, want to add another sorted array to it, write the code in C++.
Can we use the final keyword with the constructor?
basics database question java advance question algorithm data structure
I was asked about how to avoid data corruption in relational databases. (very broadly, not specifics)
Write down code to calculate Fibonacci in 2 ways - then asked to explain complexity.
Suppose a basketball match is going on and apart from conventional manner to record that game i.e. video recording, I want to record that game in a structure, so which structure u will use and with which fields, to record that game so that whenever i go through that structure i'll get the whole description of the match event-wise i.e. what happened at which time.
Identify whether there exists a pair of numbers in an array such that their sum is equal to N Input: The first line contains one integer N, which is the sum we are trying to find; The second line contains one integer M, which is length of the array; This is followeb by M lines each containing one element of the array; Output: Output 1 if there exists a pair of numbers in the array such that their sum equals N. If such a pair does not exist, output 0. Note: The array must be sorted.
Implement a lock-free queue/stack/... using atomic test-and-set functions.
1. Find the the string of length 'n' which contains only vowels and the letters are lexically arranged in decending order.
Viewing 561 - 570 interview questions