This is an OA description, not an interview.

The HackerRank coding challenge will assess your coding fundamentals and algorithms.

Once you begin the challenge, you will have 70 minutes to complete it.

2 OA questions. One is by the chair. One is:

Given two arrays where array 'a' is fixed and array 'b' can be rearranged, for example:

a: 1, 2, 3, 4, 5 b: 2, 6, 4, 3, 5

The objective is to rearrange array 'b' in such a way that as many numbers in 'b' as possible are greater than their corresponding numbers in 'a'. Finally, the sum of numbers in 'b' that are greater than the corresponding numbers in 'a' is calculated.

For example, if

a: 1, 2, 3, 4, 5 b: 2, 3, 4, 5, 6

-> return 2 + 3 + 4 + 5 + 6.