feat: Solved 10 Leetcode problems

* Solved 6 Leetcode problems from the Top 50 SQL study plan
* Solved 4 additional Leetcode problems

Author: ralvarezdev

daily/2024-july/easy/intersection-of-two-arrays-ii.js

@@ -0,0 +1,31 @@
+/**
+ * @param {number[]} nums1
+ * @param {number[]} nums2
+ * @return {number[]}
+ */
+var intersect = function(nums1, nums2) {
+    const map =new Map()
+    let value
+
+    for(const num of nums1){
+        value = map.get(num)
+        map.set(num, (value===undefined)?1:value+1)
+    }
+
+    const intersection=[]
+    for(const num of nums2)
+        {
+            value = map.get(num)
+
+            if(value!==undefined){
+                if(value>1)
+                    map.set(num, value-1)
+                else if(value===1)
+                    map.delete(num)
+
+                intersection.push(num)
+            }
+        }
+
+        return intersection
+};

daily/2024-july/easy/three-consecutive-odds.js

@@ -0,0 +1,16 @@
+/**
+ * @param {number[]} arr
+ * @return {boolean}
+ */
+var threeConsecutiveOdds = function(arr) {
+    consecutiveOdds=0
+
+    for(let i=0;i<arr.length;i++)
+        if(arr[i]%2!==1)
+            consecutiveOdds=0
+
+        else if(++consecutiveOdds===3)
+            return true
+
+    return false
+};

daily/2024-july/medium/merge-nodes-in-between-zeros.js

@@ -0,0 +1,28 @@
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val, next) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.next = (next===undefined ? null : next)
+ * }
+ */
+/**
+ * @param {ListNode} head
+ * @return {ListNode}
+ */
+var mergeNodes = function(head) {
+    let pivotNode=head.next, accum=pivotNode.val,currNode=pivotNode
+
+    while((currNode=currNode.next)!==null){
+        if(currNode.val!==0)
+            accum+=currNode.val
+        else
+        {
+            pivotNode.val=accum
+            pivotNode.next=currNode.next
+            pivotNode=pivotNode.next
+            accum=0
+        }
+    }
+
+    return head.next
+};

daily/2024-july/medium/minimum-difference-between-largest-and-smallest-value-in-three-moves.js

@@ -0,0 +1,22 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var minDifference = function(nums) {
+    const movs=3
+
+    if(nums.length<=movs)
+        return 0
+
+    nums.sort((a,b)=>b-a)
+
+    const movsList=new Array(movs*2)
+    for(let i=movs;i>0;i--)
+        {
+            movsList.push(nums[movs-i]-nums[nums.length-1-i])
+            movsList.push(nums[i]-nums[nums.length-1-movs+i])
+        }
+    movsList.sort((a,b)=>a-b)
+
+    return movsList[0]
+};

top-sql-50/basic-joins/easy/replace-employee-id-with-the-unique-identifier.sql

@@ -0,0 +1,2 @@
+# Write your MySQL query statement below
+SELECT unique_id, name FROM Employees AS e LEFT JOIN EmployeeUNI AS u ON e.id=u.id;

top-sql-50/select/easy/article-views-i.sql

@@ -0,0 +1,2 @@
+# Write your MySQL query statement below
+SELECT DISTINCT viewer_id AS id FROM Views WHERE author_id=viewer_id ORDER BY viewer_id;

top-sql-50/select/easy/big-countries.sql

@@ -0,0 +1,2 @@
+# Write your MySQL query statement below
+SELECT name, population, area FROM World WHERE area>=3000000 OR population>=25000000;

top-sql-50/select/easy/find-customer-referee.sql

@@ -0,0 +1,2 @@
+# Write your MySQL query statement below
+SELECT name From Customer WHERE id NOT IN (SELECT id FROM Customer WHERE referee_id=2);

top-sql-50/select/easy/invalid-tweets.sql

@@ -0,0 +1,2 @@
+# Write your MySQL query statement below
+SELECT tweet_id FROM Tweets WHERE CHAR_LENGTH(content)>15;

top-sql-50/select/easy/recyclable-and-low-fat-products.sql

@@ -0,0 +1,2 @@
+# Write your MySQL query statement below
+SELECT product_id FROM Products WHERE low_fats='Y' AND recyclable='Y';