LinkedIn | SWE | Telephone Screen

2 questions. 45 mins. 1) Given two arrays(of different lengths),int lower,int upper, count how many pairs have the following property lower <= a[i]a[i] +b[j]b[j] <= higher 2) Rearrange string containing only \'W\',\'D\',\'L\' such...