Added tasks 197, 201, 202, 203.

Author: ThanhNIT

README.md

@@ -379,6 +379,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.5'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0202 |[Happy Number](src/main/kotlin/g0201_0300/s0202_happy_number/Solution.kt)| Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers | 261 | 45.08
 
 #### Day 5 Function
 
@@ -651,6 +652,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.5'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0197 |[Rising Temperature](src/main/kotlin/g0101_0200/s0197_rising_temperature/script.sql)| |||
 
 #### Day 7 Function
 
@@ -768,6 +770,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.5'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0202 |[Happy Number](src/main/kotlin/g0201_0300/s0202_happy_number/Solution.kt)| Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers | 261 | 45.08
 | 0054 |[Spiral Matrix](src/main/kotlin/g0001_0100/s0054_spiral_matrix/Solution.kt)| Medium | Top_Interview_Questions, Array, Matrix, Simulation | 224 | 62.50
 
 #### Day 2 String
@@ -1115,6 +1118,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.5'
 |-|-|-|-|-|-
 | 0141 |[Linked List Cycle](src/main/kotlin/g0101_0200/s0141_linked_list_cycle/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List | 223 | 91.85
 | 0021 |[Merge Two Sorted Lists](src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion | 176 | 96.25
+| 0203 |[Remove Linked List Elements](src/main/kotlin/g0201_0300/s0203_remove_linked_list_elements/Solution.kt)| Easy | Linked_List, Recursion | 233 | 91.22
 
 #### Day 8 Linked List
 
@@ -1520,6 +1524,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.5'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0201 |[Bitwise AND of Numbers Range](src/main/kotlin/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.kt)| Medium | Bit_Manipulation | 368 | 80.00
 
 #### Day 20 Others
 
@@ -1530,6 +1535,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.5'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0202 |[Happy Number](src/main/kotlin/g0201_0300/s0202_happy_number/Solution.kt)| Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers | 261 | 45.08
 | 0149 |[Max Points on a Line](src/main/kotlin/g0101_0200/s0149_max_points_on_a_line/Solution.kt)| Hard | Top_Interview_Questions, Array, Hash_Table, Math, Geometry | 307 | 83.33
 
 ## Algorithms
@@ -1569,9 +1575,13 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.5'
 | 0208 |[Implement Trie (Prefix Tree)](src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, Level_2_Day_16_Design, Udemy_Trie_and_Heap | 689 | 61.00
 | 0207 |[Course Schedule](src/main/kotlin/g0201_0300/s0207_course_schedule/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 416 | 40.10
 | 0206 |[Reverse Linked List](src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Data_Structure_I_Day_8_Linked_List, Algorithm_I_Day_10_Recursion_Backtracking, Level_1_Day_3_Linked_List, Udemy_Linked_List | 279 | 45.78
+| 0203 |[Remove Linked List Elements](src/main/kotlin/g0201_0300/s0203_remove_linked_list_elements/Solution.kt)| Easy | Linked_List, Recursion, Data_Structure_I_Day_7_Linked_List | 233 | 91.22
+| 0202 |[Happy Number](src/main/kotlin/g0201_0300/s0202_happy_number/Solution.kt)| Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers, Algorithm_II_Day_21_Others, Programming_Skills_I_Day_4_Loop, Level_2_Day_1_Implementation/Simulation | 261 | 45.08
+| 0201 |[Bitwise AND of Numbers Range](src/main/kotlin/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.kt)| Medium | Bit_Manipulation, Algorithm_II_Day_19_Bit_Manipulation | 368 | 80.00
 | 0200 |[Number of Islands](src/main/kotlin/g0101_0200/s0200_number_of_islands/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_1_Matrix_Related_Problems, Level_1_Day_9_Graph/BFS/DFS, Udemy_Graph | 252 | 95.41
 | 0199 |[Binary Tree Right Side View](src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt)| Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_II_Day_16_Tree, Level_2_Day_15_Tree | 194 | 92.89
 | 0198 |[House Robber](src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_3, Level_2_Day_12_Dynamic_Programming, Udemy_Dynamic_Programming | 156 | 92.24
+| 0197 |[Rising Temperature](src/main/kotlin/g0101_0200/s0197_rising_temperature/script.sql)| |||
 | 0196 |[Delete Duplicate Emails](src/main/kotlin/g0101_0200/s0196_delete_duplicate_emails/script.sql)| Easy | Database, SQL_I_Day_2_Select_and_Order | 593 | 94.17
 | 0195 |[Tenth Line](src/main/kotlin/g0101_0200/s0195_tenth_line/script.sh)| Easy | Shell | 36 | 87.50
 | 0194 |[Transpose File](src/main/kotlin/g0101_0200/s0194_transpose_file/script.sh)| Medium | Shell | 477 | 28.60

src/main/kotlin/g0101_0200/s0197_rising_temperature/readme.md

@@ -0,0 +1,51 @@
+197\. Rising Temperature
+
+Easy
+
+SQL Schema
+
+Table: `Weather`
+
+    +---------------+---------+
+    | Column Name   | Type    |
+    +---------------+---------+
+    | id            | int     |
+    | recordDate    | date    |
+    | temperature   | int     |
+    +---------------+---------+
+    id is the primary key for this table.
+    This table contains information about the temperature on a certain day. 
+
+Write an SQL query to find all dates' `Id` with higher temperatures compared to its previous dates (yesterday).
+
+Return the result table in **any order**.
+
+The query result format is in the following example.
+
+**Example 1:**
+
+**Input:**
+
+    Weather table:
+    +----+------------+-------------+
+    | id | recordDate | temperature |
+    +----+------------+-------------+
+    | 1  | 2015-01-01 | 10          |
+    | 2  | 2015-01-02 | 25          |
+    | 3  | 2015-01-03 | 20          |
+    | 4  | 2015-01-04 | 30          |
+    +----+------------+-------------+
+
+**Output:**
+
+    +----+
+    | id |
+    +----+
+    | 2  |
+    | 4  |
+    +----+
+
+**Explanation:**
+
+    In 2015-01-02, the temperature was higher than the previous day (10 -> 25).
+    In 2015-01-04, the temperature was higher than the previous day (20 -> 30). 

src/main/kotlin/g0101_0200/s0197_rising_temperature/script.sql

@@ -0,0 +1,6 @@
+# Write your MySQL query statement below
+#Easy #Database #SQL_I_Day_6_Union #2022_10_19_Time_394_ms_(94.15%)_Space_0B_(100.00%)
+SELECT SecondDate.id as Id
+FROM Weather SecondDate JOIN Weather FirstDate
+ON ADDDATE(FirstDate.recordDate,1) = SecondDate.recordDate
+AND SecondDate.temperature > FirstDate.temperature;

src/main/kotlin/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.kt

@@ -0,0 +1,47 @@
+package g0201_0300.s0201_bitwise_and_of_numbers_range
+
+// #Medium #Bit_Manipulation #Algorithm_II_Day_19_Bit_Manipulation
+// #2022_10_19_Time_368_ms_(80.00%)_Space_37.1_MB_(76.67%)
+
+class Solution {
+    fun rangeBitwiseAnd(left: Int, right: Int): Int {
+        return if (left == right) left else right and MASKS[Integer.numberOfLeadingZeros(left xor right)]
+    }
+
+    companion object {
+        private val MASKS = intArrayOf(
+            0,
+            -0x80000000,
+            -0x40000000,
+            -0x20000000,
+            -0x10000000,
+            -0x8000000,
+            -0x4000000,
+            -0x2000000,
+            -0x1000000,
+            -0x800000,
+            -0x400000,
+            -0x200000,
+            -0x100000,
+            -0x80000,
+            -0x40000,
+            -0x20000,
+            -0x10000,
+            -0x8000,
+            -0x4000,
+            -0x2000,
+            -0x1000,
+            -0x800,
+            -0x400,
+            -0x200,
+            -0x100,
+            -0x80,
+            -0x40,
+            -0x20,
+            -0x10,
+            -0x8,
+            -0x4,
+            -0x2
+        )
+    }
+}

src/main/kotlin/g0201_0300/s0201_bitwise_and_of_numbers_range/readme.md

@@ -0,0 +1,27 @@
+201\. Bitwise AND of Numbers Range
+
+Medium
+
+Given two integers `left` and `right` that represent the range `[left, right]`, return _the bitwise AND of all numbers in this range, inclusive_.
+
+**Example 1:**
+
+**Input:** left = 5, right = 7
+
+**Output:** 4
+
+**Example 2:**
+
+**Input:** left = 0, right = 0
+
+**Output:** 0
+
+**Example 3:**
+
+**Input:** left = 1, right = 2147483647
+
+**Output:** 0
+
+**Constraints:**
+
+*   <code>0 <= left <= right <= 2<sup>31</sup> - 1</code>

src/main/kotlin/g0201_0300/s0202_happy_number/Solution.kt

@@ -0,0 +1,27 @@
+package g0201_0300.s0202_happy_number
+
+// #Easy #Top_Interview_Questions #Hash_Table #Math #Two_Pointers #Algorithm_II_Day_21_Others
+// #Programming_Skills_I_Day_4_Loop #Level_2_Day_1_Implementation/Simulation
+// #2022_10_19_Time_261_ms_(45.08%)_Space_33.7_MB_(78.51%)
+
+class Solution {
+    private val set = mutableSetOf<Int>()
+
+    tailrec fun isHappy(n: Int): Boolean {
+        var num = n
+        var squareSum = 0
+        while (num > 0) {
+            val digit = num % 10
+            squareSum += digit * digit
+            num /= 10
+        }
+        if (squareSum == 1) {
+            return true
+        }
+        if (set.contains(squareSum)) {
+            return false
+        }
+        set.add(squareSum)
+        return isHappy(squareSum)
+    }
+}

src/main/kotlin/g0201_0300/s0202_happy_number/readme.md

@@ -0,0 +1,31 @@
+202\. Happy Number
+
+Easy
+
+Write an algorithm to determine if a number `n` is happy.
+
+A **happy number** is a number defined by the following process:
+
+*   Starting with any positive integer, replace the number by the sum of the squares of its digits.
+*   Repeat the process until the number equals 1 (where it will stay), or it **loops endlessly in a cycle** which does not include 1.
+*   Those numbers for which this process **ends in 1** are happy.
+
+Return `true` _if_ `n` _is a happy number, and_ `false` _if not_.
+
+**Example 1:**
+
+**Input:** n = 19
+
+**Output:** true
+
+**Explanation:** 1<sup>2</sup> + 9<sup>2</sup> = 82 8<sup>2</sup> + 2<sup>2</sup> = 68 6<sup>2</sup> + 8<sup>2</sup> = 100 1<sup>2</sup> + 0<sup>2</sup> + 0<sup>2</sup> = 1
+
+**Example 2:**
+
+**Input:** n = 2
+
+**Output:** false
+
+**Constraints:**
+
+*   <code>1 <= n <= 2<sup>31</sup> - 1</code>

src/main/kotlin/g0201_0300/s0203_remove_linked_list_elements/Solution.kt

@@ -0,0 +1,33 @@
+package g0201_0300.s0203_remove_linked_list_elements
+
+// #Easy #Linked_List #Recursion #Data_Structure_I_Day_7_Linked_List
+// #2022_10_19_Time_233_ms_(91.22%)_Space_37_MB_(100.00%)
+
+import com_github_leetcode.ListNode
+
+/*
+ * Example:
+ * var li = ListNode(5)
+ * var v = li.`val`
+ * Definition for singly-linked list.
+ * class ListNode(var `val`: Int) {
+ *     var next: ListNode? = null
+ * }
+ */
+class Solution {
+    fun removeElements(head: ListNode?, `val`: Int): ListNode? {
+        val sentinel = ListNode(-1)
+        sentinel.next = head
+        var next = head
+        var prev = sentinel
+        while (next != null) {
+            if (next.`val` == `val`) {
+                prev.next = next.next
+            } else {
+                prev = next
+            }
+            next = next.next
+        }
+        return sentinel.next
+    }
+}

src/main/kotlin/g0201_0300/s0203_remove_linked_list_elements/readme.md

@@ -0,0 +1,31 @@
+203\. Remove Linked List Elements
+
+Easy
+
+Given the `head` of a linked list and an integer `val`, remove all the nodes of the linked list that has `Node.val == val`, and return _the new head_.
+
+**Example 1:**
+
+![](https://assets.leetcode.com/uploads/2021/03/06/removelinked-list.jpg)
+
+**Input:** head = [1,2,6,3,4,5,6], val = 6
+
+**Output:** [1,2,3,4,5]
+
+**Example 2:**
+
+**Input:** head = [], val = 1
+
+**Output:** []
+
+**Example 3:**
+
+**Input:** head = [7,7,7,7], val = 7
+
+**Output:** []
+
+**Constraints:**
+
+*   The number of nodes in the list is in the range <code>[0, 10<sup>4</sup>]</code>.
+*   `1 <= Node.val <= 50`
+*   `0 <= val <= 50`

src/test/kotlin/g0101_0200/s0197_rising_temperature/MysqlTest.kt

@@ -0,0 +1,55 @@
+package g0101_0200.s0197_rising_temperature
+
+import org.hamcrest.CoreMatchers.equalTo
+import org.hamcrest.MatcherAssert.assertThat
+import org.junit.jupiter.api.Test
+import org.zapodot.junit.db.annotations.EmbeddedDatabase
+import org.zapodot.junit.db.annotations.EmbeddedDatabaseTest
+import org.zapodot.junit.db.common.CompatibilityMode
+import java.io.BufferedReader
+import java.io.FileNotFoundException
+import java.io.FileReader
+import java.sql.SQLException
+import java.util.stream.Collectors.joining
+import javax.sql.DataSource
+
+@EmbeddedDatabaseTest(
+    compatibilityMode = CompatibilityMode.MySQL,
+    initialSqls = [
+        "CREATE TABLE Weather(id INTEGER PRIMARY KEY, recordDate DATE, temperature INTEGER); " +
+            "INSERT INTO Weather(id, recordDate, temperature) VALUES (1, '2015-01-01', 10); " +
+            "INSERT INTO Weather(id, recordDate, temperature) VALUES (2, '2015-01-02', 25); " +
+            "INSERT INTO Weather(id, recordDate, temperature) VALUES (3, '2015-01-03', 20); " +
+            "INSERT INTO Weather(id, recordDate, temperature) VALUES (4, '2015-01-04', 30); "
+    ]
+)
+internal class MysqlTest {
+    @Test
+    @Throws(SQLException::class, FileNotFoundException::class)
+    fun testScript(@EmbeddedDatabase dataSource: DataSource) {
+        dataSource.connection.use { connection ->
+            connection.createStatement().use { statement ->
+                statement.executeQuery(
+                    BufferedReader(
+                        FileReader(
+                            "src/main/kotlin/g0101_0200/s0197_rising_temperature/script.sql"
+                        )
+                    )
+                        .lines()
+                        .collect(joining("\n"))
+                        .replace("#.*?\\r?\\n".toRegex(), "")
+                        .replace(
+                            "ADDDATE(FirstDate.recordDate,1)",
+                            "TIMESTAMPADD(DAY, 1, FirstDate.recordDate)"
+                        )
+                ).use { resultSet ->
+                    assertThat(resultSet.next(), equalTo(true))
+                    assertThat(resultSet.getInt(1), equalTo(2))
+                    assertThat(resultSet.next(), equalTo(true))
+                    assertThat(resultSet.getInt(1), equalTo(4))
+                    assertThat(resultSet.next(), equalTo(false))
+                }
+            }
+        }
+    }
+}