https://vhaos-leetcode-solutions.now.sh/tags/sort/ Recent content in Sort on Vhaos's Leetcode Solutions Hugo -- gohugo.io en-us Kareem Daggash Sun, 04 Oct 2020 01:00:52 +0100 https://vhaos-leetcode-solutions.now.sh/leetcodedaily/october/4-remove-covered-intervals/ Sun, 04 Oct 2020 01:00:52 +0100 https://vhaos-leetcode-solutions.now.sh/leetcodedaily/october/4-remove-covered-intervals/ LeetCode October - Day 4 Problem Statement Given a list of intervals, remove all intervals that are covered by another interval in the list. Interval [a,b) is covered by interval [c,d) if and only if c <= a and b <= d. After doing so, return the number of remaining intervals. Example 1: Input: intervals = [[1,4],[3,6],[2,8]] Output: 2 Explanation: Interval [3,6] is covered by [2,8], therefore it is removed. https://vhaos-leetcode-solutions.now.sh/leetcodedaily/september/5-all-elements-in-two-binary-search-trees/ Sat, 05 Sep 2020 01:00:52 +0100 https://vhaos-leetcode-solutions.now.sh/leetcodedaily/september/5-all-elements-in-two-binary-search-trees/ LeetCode September - Day 5 Problem Statement Given two binary search trees root1 and root2. Return a list containing all the integers from both trees sorted in ascending order. Example 1: Input: root1 = [2,1,4], root2 = [1,0,3] Output: [0,1,1,2,3,4] Example 2: Input: root1 = [0,-10,10], root2 = [5,1,7,0,2] Output: [-10,0,0,1,2,5,7,10] Example 3: Input: root1 = [], root2 = [5,1,7,0,2] Output: [0,1,2,5,7] Example 4: Input: root1 = [0,-10,10], root2 = [] Output: [-10,0,10] Example 5: Input: root1 = [1,null,8], root2 = [8,1] Output: [1,1,8,8] Constraints: https://vhaos-leetcode-solutions.now.sh/leetcodedaily/august/29-pancake-sorting/ Sat, 29 Aug 2020 01:00:52 +0100 https://vhaos-leetcode-solutions.now.sh/leetcodedaily/august/29-pancake-sorting/ LeetCode August - Day 29 Problem Statement Given an array of integers arr, sort the array by performing a series of pancake flips. In one pancake flip we do the following steps: Choose an integer k where 1 <= k <= arr.length. Reverse the sub-array arr[1...k]. For example, if arr = [3,2,1,4] and we performed a pancake flip choosing k = 3, we reverse the sub-array [3,2,1], so arr = [1,2,3,4] after the pancake flip at k = 3. https://vhaos-leetcode-solutions.now.sh/leetcodedaily/july/8-3sum/ Wed, 08 Jul 2020 01:00:52 +0100 https://vhaos-leetcode-solutions.now.sh/leetcodedaily/july/8-3sum/ LeetCode July - Day 8 Problem Statement Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. Note: The solution set must not contain duplicate triplets. Example: Given array nums = [-1, 0, 1, 2, -1, -4], A solution set is: [ [-1, 0, 1], [-1, -1, 2] ] Inputs, Outputs, Constraints & Exceptions I: number[] O: number[][] C: no duplicates in result, optimise E: empty array, no elements satisfy, all zeros Code /** * @param {number[]} nums * @return {number[][]} */ const threeSum = (nums) => { let result = [] nums = nums.