Added tasks 385, 386, 387.

Author: ThanhNIT

README.md

@@ -1082,6 +1082,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.6'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0387 |[First Unique Character in a String](src/main/kotlin/g0301_0400/s0387_first_unique_character_in_a_string/Solution.kt)| Easy | Top_Interview_Questions, String, Hash_Table, Counting, Queue | 369 | 82.68
 | 0383 |[Ransom Note](src/main/kotlin/g0301_0400/s0383_ransom_note/Solution.kt)| Easy | String, Hash_Table, Counting | 333 | 79.58
 | 0242 |[Valid Anagram](src.save/main/kotlin/g0201_0300/s0242_valid_anagram/Solution.kt)| Easy | Top_Interview_Questions, String, Hash_Table, Sorting | 251 | 87.65
 
@@ -1613,6 +1614,9 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.6'
 | 0437 |[Path Sum III](src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Level_2_Day_7_Tree | 403 | 54.12
 | 0416 |[Partition Equal Subset Sum](src/main/kotlin/g0401_0500/s0416_partition_equal_subset_sum/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Level_2_Day_13_Dynamic_Programming | 509 | 57.56
 | 0394 |[Decode String](src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Level_1_Day_14_Stack, Udemy_Strings | 224 | 64.86
+| 0387 |[First Unique Character in a String](src/main/kotlin/g0301_0400/s0387_first_unique_character_in_a_string/Solution.kt)| Easy | Top_Interview_Questions, String, Hash_Table, Counting, Queue, Data_Structure_I_Day_6_String | 369 | 82.68
+| 0386 |[Lexicographical Numbers](src/main/kotlin/g0301_0400/s0386_lexicographical_numbers/Solution.kt)| Medium | Depth_First_Search, Trie | 463 | 83.33
+| 0385 |[Mini Parser](src/main/kotlin/g0301_0400/s0385_mini_parser/Solution.kt)| Medium | String, Depth_First_Search, Stack | 210 | 100.00
 | 0384 |[Shuffle an Array](src/main/kotlin/g0301_0400/s0384_shuffle_an_array/Solution.kt)| Medium | Top_Interview_Questions, Array, Math, Randomized, Algorithm_II_Day_20_Others | 940 | 72.09
 | 0383 |[Ransom Note](src/main/kotlin/g0301_0400/s0383_ransom_note/Solution.kt)| Easy | String, Hash_Table, Counting, Data_Structure_I_Day_6_String | 333 | 79.58
 | 0382 |[Linked List Random Node](src/main/kotlin/g0301_0400/s0382_linked_list_random_node/Solution.kt)| Medium | Math, Linked_List, Randomized, Reservoir_Sampling | 283 | 100.00

src/main/kotlin/g0301_0400/s0385_mini_parser/Solution.kt

@@ -0,0 +1,68 @@
+package g0301_0400.s0385_mini_parser
+
+// #Medium #String #Depth_First_Search #Stack
+// #2022_11_24_Time_210_ms_(100.00%)_Space_38.3_MB_(100.00%)
+
+import com_github_leetcode.NestedInteger
+
+/*
+ * // This is the interface that allows for creating nested lists.
+ * // You should not implement it, or speculate about its implementation
+ * class NestedInteger {
+ *     // Constructor initializes an empty nested list.
+ *     constructor()
+ *
+ *     // Constructor initializes a single integer.
+ *     constructor(value: Int)
+ *
+ *     // @return true if this NestedInteger holds a single integer, rather than a nested list.
+ *     fun isInteger(): Boolean
+ *
+ *     // @return the single integer that this NestedInteger holds, if it holds a single integer
+ *     // Return null if this NestedInteger holds a nested list
+ *     fun getInteger(): Int?
+ *
+ *     // Set this NestedInteger to hold a single integer.
+ *     fun setInteger(value: Int): Unit
+ *
+ *     // Set this NestedInteger to hold a nested list and adds a nested integer to it.
+ *     fun add(ni: NestedInteger): Unit
+ *
+ *     // @return the nested list that this NestedInteger holds, if it holds a nested list
+ *     // Return null if this NestedInteger holds a single integer
+ *     fun getList(): List<NestedInteger>?
+ * }
+ */
+class Solution {
+    private var i = 0
+    fun deserialize(s: String): NestedInteger {
+        return getAns(s)
+    }
+
+    private fun getAns(s: String): NestedInteger {
+        return if (s[i] == '[') {
+            val ni = NestedInteger()
+            i++
+            while (i < s.length && s[i] != ']') {
+                ni.add(getAns(s))
+            }
+            i++
+            ni
+        } else if (s[i] == ',') {
+            i++
+            getAns(s)
+        } else {
+            var x = 0
+            var m = 1
+            if (s[i] == '-') {
+                i++
+                m = -1
+            }
+            while (i < s.length && Character.isDigit(s[i])) {
+                x = x * 10 + s[i++].code - '0'.code
+            }
+            x *= m
+            NestedInteger(x)
+        }
+    }
+}

src/main/kotlin/g0301_0400/s0385_mini_parser/readme.md

@@ -0,0 +1,39 @@
+385\. Mini Parser
+
+Medium
+
+Given a string s represents the serialization of a nested list, implement a parser to deserialize it and return _the deserialized_ `NestedInteger`.
+
+Each element is either an integer or a list whose elements may also be integers or other lists.
+
+**Example 1:**
+
+**Input:** s = "324"
+
+**Output:** 324
+
+**Explanation:** You should return a NestedInteger object which contains a single integer 324.
+
+**Example 2:**
+
+**Input:** s = "[123,[456,[789]]]"
+
+**Output:** [123,[456,[789]]]
+
+**Explanation:**
+Return a NestedInteger object containing a nested list with 2 elements:
+1. An integer containing value 123.
+2. A nested list containing two elements:
+
+   i. An integer containing value 456.
+
+   ii. A nested list with one element:
+
+   a. An integer containing value 789
+
+**Constraints:**
+
+*   <code>1 <= s.length <= 5 * 10<sup>4</sup></code>
+*   `s` consists of digits, square brackets `"[]"`, negative sign `'-'`, and commas `','`.
+*   `s` is the serialization of valid `NestedInteger`.
+*   All the values in the input are in the range <code>[-10<sup>6</sup>, 10<sup>6</sup>]</code>.

src/main/kotlin/g0301_0400/s0386_lexicographical_numbers/Solution.kt

@@ -0,0 +1,20 @@
+package g0301_0400.s0386_lexicographical_numbers
+
+// #Medium #Depth_First_Search #Trie #2022_11_24_Time_463_ms_(83.33%)_Space_57_MB_(33.33%)
+
+class Solution {
+    fun lexicalOrder(n: Int): List<Int> {
+        val list = ArrayList<Int>()
+        fun recursion(x: Int) {
+            if (x > n) return
+            list.add(x)
+            for (i in 0..9) {
+                recursion(x * 10 + i)
+            }
+        }
+        for (i in 1..9) {
+            recursion(i)
+        }
+        return list
+    }
+}

src/main/kotlin/g0301_0400/s0386_lexicographical_numbers/readme.md

@@ -0,0 +1,23 @@
+386\. Lexicographical Numbers
+
+Medium
+
+Given an integer `n`, return all the numbers in the range `[1, n]` sorted in lexicographical order.
+
+You must write an algorithm that runs in `O(n)` time and uses `O(1)` extra space.
+
+**Example 1:**
+
+**Input:** n = 13
+
+**Output:** [1,10,11,12,13,2,3,4,5,6,7,8,9]
+
+**Example 2:**
+
+**Input:** n = 2
+
+**Output:** [1,2]
+
+**Constraints:**
+
+*   <code>1 <= n <= 5 * 10<sup>4</sup></code>

src/main/kotlin/g0301_0400/s0387_first_unique_character_in_a_string/Solution.kt

@@ -0,0 +1,21 @@
+package g0301_0400.s0387_first_unique_character_in_a_string
+
+// #Easy #Top_Interview_Questions #String #Hash_Table #Counting #Queue
+// #Data_Structure_I_Day_6_String #2022_11_24_Time_369_ms_(82.68%)_Space_53.6_MB_(66.43%)
+
+class Solution {
+    fun firstUniqChar(s: String): Int {
+        var ans = Int.MAX_VALUE
+        var i = 'a'
+        while (i <= 'z') {
+            val ind = s.indexOf(i)
+            if (ind != -1 && ind == s.lastIndexOf(i)) {
+                ans = Math.min(ans, ind)
+            }
+            i++
+        }
+        return if (ans == Int.MAX_VALUE) {
+            -1
+        } else ans
+    }
+}

src/main/kotlin/g0301_0400/s0387_first_unique_character_in_a_string/readme.md

@@ -0,0 +1,28 @@
+387\. First Unique Character in a String
+
+Easy
+
+Given a string `s`, _find the first non-repeating character in it and return its index_. If it does not exist, return `-1`.
+
+**Example 1:**
+
+**Input:** s = "leetcode"
+
+**Output:** 0
+
+**Example 2:**
+
+**Input:** s = "loveleetcode"
+
+**Output:** 2
+
+**Example 3:**
+
+**Input:** s = "aabb"
+
+**Output:** -1
+
+**Constraints:**
+
+*   <code>1 <= s.length <= 10<sup>5</sup></code>
+*   `s` consists of only lowercase English letters.

src/test/kotlin/g0301_0400/s0385_mini_parser/SolutionTest.kt

@@ -0,0 +1,24 @@
+package g0301_0400.s0385_mini_parser
+
+import org.hamcrest.CoreMatchers.equalTo
+import org.hamcrest.MatcherAssert.assertThat
+import org.junit.jupiter.api.Test
+
+internal class SolutionTest {
+    @Test
+    fun deserialize() {
+        assertThat(Solution().deserialize("324").getInteger(), equalTo(324))
+    }
+
+    @Test
+    fun deserialize2() {
+        val nestedInteger = Solution().deserialize("[123,[456,[789]]]")
+        val result = intArrayOf(
+            nestedInteger.getList()!![0].getInteger()!!,
+            nestedInteger.getList()!![1].getList()!![0].getInteger()!!,
+            nestedInteger.getList()!![1].getList()!![1].getList()!![0].getInteger()!!
+        )
+        val expected = intArrayOf(123, 456, 789)
+        assertThat(result, equalTo(expected))
+    }
+}

src/test/kotlin/g0301_0400/s0386_lexicographical_numbers/SolutionTest.kt

@@ -0,0 +1,21 @@
+package g0301_0400.s0386_lexicographical_numbers
+
+import org.hamcrest.CoreMatchers.equalTo
+import org.hamcrest.MatcherAssert.assertThat
+import org.junit.jupiter.api.Test
+import java.util.Arrays
+
+internal class SolutionTest {
+    @Test
+    fun lexicalOrder() {
+        assertThat(
+            Solution().lexicalOrder(13),
+            equalTo(Arrays.asList(1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9))
+        )
+    }
+
+    @Test
+    fun lexicalOrder2() {
+        assertThat(Solution().lexicalOrder(2), equalTo(Arrays.asList(1, 2)))
+    }
+}

src/test/kotlin/g0301_0400/s0387_first_unique_character_in_a_string/SolutionTest.kt

@@ -0,0 +1,22 @@
+package g0301_0400.s0387_first_unique_character_in_a_string
+
+import org.hamcrest.CoreMatchers.equalTo
+import org.hamcrest.MatcherAssert.assertThat
+import org.junit.jupiter.api.Test
+
+internal class SolutionTest {
+    @Test
+    fun firstUniqChar() {
+        assertThat(Solution().firstUniqChar("leetcode"), equalTo(0))
+    }
+
+    @Test
+    fun firstUniqChar2() {
+        assertThat(Solution().firstUniqChar("loveleetcode"), equalTo(2))
+    }
+
+    @Test
+    fun firstUniqChar3() {
+        assertThat(Solution().firstUniqChar("aabb"), equalTo(-1))
+    }
+}