Published onJanuary 16, 2022[LeetCode 56] Merge IntervalsSortingGiven an array of `intervals` where `intervals[i] = [starti, endi]`, merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.
Published onNovember 29, 2021[LeetCode 15] 3SumSortingGiven an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i !