Given two hashmaps, perform a left join
We declared a result array to store the values. We traversed the first object. On each iteration, we check if the current key is present in the second object. If it is, we add the corresponding value to the inner array. If not we add None. After each iteration, we add the inner array to the result array.
Big O:
- Time: O(n)
- Space: O(n)
Daniel Dills, Prabin Singh, Wondwosen Tsige, Michael Ryan,