Facebook E5 London 10 years exp | Online Assessment | Merge sorted arrays
  1. Given 2 sorted Arrays arr1 & arr2. arr1 has junk values also. And arr1 has just enough space to accomodate arr1 and arr2 valid values
    Merge 2 arrays in arr1. The result array should be sorted
    Sample input :
    arr1 - 5,8,11,14, X, X, X, X
    arr2 - 1,6,9,12
    Expected output : 1,5,6,8,9,11,12,14

  2. https://leetcode.com/problems/diameter-of-binary-tree/

Comments (3)