
#SDESheetChallenge @striver_79 @takeUforward_
day 3
1. merging sorted lists
a very brute approach would have been to use two pointer make a third array start iterating copying smaller or larger elements then copying it to the nums1 while we can also do the other way of specifying larger elements to end of nums1 using two pointers..
2.merge intervals
sort them and check if the extremes overlap if they do take the max
3.rotate array by 90
transpose and reverse every row



English





















