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?
Does CSS works ltr or rtl?
Write a polyfill (fallback function) for filter method for arrays
Some logistic and Math problem, need fast reading and quick reaciton. Each question only have 2.5 minuetes to finish.
Why did you pick Scorpion to apply?
What can you do to make a site more efficient?
Delete duplicate records from a table
To reverse a string without using reverse keyword.
An integer X and a non-empty zero-indexed array A consisting of N integers are given. We are interested in which elements of A are qual to X and which are different from X. The goal is to split array A into two parts, such that the number of elements equal to X in the first part is the same as the number of elements different from X in the other part. More formally, we are looking for an index K such that: 0 ≤ K < N and the number of elements equal to X in A[0..K−1] is the same as the number of elements different from X in A[K..N−1]. For K = 0, A[0..K−1] does not contain any elements.
Data structures and java coding problemd
Viewing 1241 - 1250 interview questions