For the screening check Paytm performed a 1-hour coding spherical on Hackerank. There have been 2 questions :
Downside 1. There are N duties and two interns, if intern 1 completes the i_th activity he will get the reward reward1[I], and if the 2nd intern completes the duty he will get reaward2[i]. They will decide duties in any order however intern 1 can solely do Ok duties remainder of the N-Ok duties needs to be carried out by intern 2. Discover the utmost collective reward they will get by finishing these duties.
Enter:
N: integer reward1: array of size N reward2: array of size N Ok: variety of duties intern1 can do
Instance:
N=5 reward1=[1,2,3,1,2] reward2=[1,1,1,5,6] Ok=3
Resolution: Max reward that may be collected is 17. Intern 1 does duties 1,2 and three and intern 2 do 4 and 5 with the intention to accumulate max reward.
Downside 2: Given an array arr discover out all of the distinctive pairs (arr[I], arr[j]) from an array satisfying the next relation:
| arr[i]+arr[j] | + | arr[i]-arr[j] |=Ok Enter: arr: an array containing N integers Ok: integer
