Added tasks 854, 855, 856, 857

Author: ThanhNIT

README.md

@@ -1719,6 +1719,10 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.11'
 | 1143 |[Longest Common Subsequence](src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Algorithm_II_Day_17_Dynamic_Programming, Dynamic_Programming_I_Day_19, Udemy_Dynamic_Programming | 307 | 38.36
 | 0994 |[Rotting Oranges](src/main/kotlin/g0901_1000/s0994_rotting_oranges/Solution.kt)| Medium | Array, Breadth_First_Search, Matrix, Algorithm_I_Day_9_Breadth_First_Search_Depth_First_Search, Level_2_Day_10_Graph/BFS/DFS | 308 | 57.93
 | 0864 |[Shortest Path to Get All Keys](src/main/kotlin/g0801_0900/s0864_shortest_path_to_get_all_keys/Solution.kt)| Hard | Breadth_First_Search, Bit_Manipulation | 176 | 100.00
+| 0857 |[Score of Parentheses](src/main/kotlin/g0801_0900/s0857_minimum_cost_to_hire_k_workers/Solution.kt)| Hard | Array, Sorting, Greedy, Heap_Priority_Queue | 302 | 100.00
+| 0856 |[Score of Parentheses](src/main/kotlin/g0801_0900/s0856_score_of_parentheses/Solution.kt)| Medium | String, Stack | 129 | 84.62
+| 0855 |[Exam Room](src/main/kotlin/g0801_0900/s0855_exam_room/ExamRoom.kt)| Medium | Design, Ordered_Set | 644 | 83.33
+| 0854 |[K-Similar Strings](src/main/kotlin/g0801_0900/s0854_k_similar_strings/Solution.kt)| Hard | String, Breadth_First_Search | 136 | 100.00
 | 0853 |[Car Fleet](src/main/kotlin/g0801_0900/s0853_car_fleet/Solution.kt)| Medium | Array, Sorting, Stack, Monotonic_Stack | 757 | 85.29
 | 0852 |[Peak Index in a Mountain Array](src/main/kotlin/g0801_0900/s0852_peak_index_in_a_mountain_array/Solution.kt)| Easy | Array, Binary_Search, Binary_Search_I_Day_2 | 433 | 94.29
 | 0851 |[Loud and Rich](src/main/kotlin/g0801_0900/s0851_loud_and_rich/Solution.kt)| Medium | Array, Depth_First_Search, Graph, Topological_Sort | 347 | 100.00

src/main/kotlin/g0801_0900/s0854_k_similar_strings/Solution.kt

@@ -0,0 +1,54 @@
+package g0801_0900.s0854_k_similar_strings
+
+// #Hard #String #Breadth_First_Search #2023_03_31_Time_136_ms_(100.00%)_Space_33.6_MB_(100.00%)
+
+class Solution {
+    fun kSimilarity(a: String, b: String): Int {
+        var ans = 0
+        val achars = a.toCharArray()
+        val bchars = b.toCharArray()
+        ans += getAllPerfectMatches(achars, bchars)
+        for (i in achars.indices) {
+            if (achars[i] == bchars[i]) {
+                continue
+            }
+            return ans + checkAllOptions(achars, bchars, i, b)
+        }
+        return ans
+    }
+
+    private fun checkAllOptions(achars: CharArray, bchars: CharArray, i: Int, b: String): Int {
+        var ans = Int.MAX_VALUE
+        for (j in i + 1 until achars.size) {
+            if (achars[j] == bchars[i] && achars[j] != bchars[j]) {
+                swap(achars, i, j)
+                ans = Math.min(ans, 1 + kSimilarity(String(achars), b))
+                swap(achars, i, j)
+            }
+        }
+        return ans
+    }
+
+    private fun getAllPerfectMatches(achars: CharArray, bchars: CharArray): Int {
+        var ans = 0
+        for (i in achars.indices) {
+            if (achars[i] == bchars[i]) {
+                continue
+            }
+            for (j in i + 1 until achars.size) {
+                if (achars[j] == bchars[i] && bchars[j] == achars[i]) {
+                    swap(achars, i, j)
+                    ans++
+                    break
+                }
+            }
+        }
+        return ans
+    }
+
+    private fun swap(a: CharArray, i: Int, j: Int) {
+        val temp = a[i]
+        a[i] = a[j]
+        a[j] = temp
+    }
+}

src/main/kotlin/g0801_0900/s0854_k_similar_strings/readme.md

@@ -0,0 +1,30 @@
+854\. K-Similar Strings
+
+Hard
+
+Strings `s1` and `s2` are `k`**\-similar** (for some non-negative integer `k`) if we can swap the positions of two letters in `s1` exactly `k` times so that the resulting string equals `s2`.
+
+Given two anagrams `s1` and `s2`, return the smallest `k` for which `s1` and `s2` are `k`**\-similar**.
+
+**Example 1:**
+
+**Input:** s1 = "ab", s2 = "ba"
+
+**Output:** 1
+
+**Explanation:** The two string are 1-similar because we can use one swap to change s1 to s2: "ab" --> "ba".
+
+**Example 2:**
+
+**Input:** s1 = "abc", s2 = "bca"
+
+**Output:** 2
+
+**Explanation:** The two strings are 2-similar because we can use two swaps to change s1 to s2: "abc" --> "bac" --> "bca".
+
+**Constraints:**
+
+*   `1 <= s1.length <= 20`
+*   `s2.length == s1.length`
+*   `s1` and `s2` contain only lowercase letters from the set `{'a', 'b', 'c', 'd', 'e', 'f'}`.
+*   `s2` is an anagram of `s1`.

src/main/kotlin/g0801_0900/s0855_exam_room/ExamRoom.kt

@@ -0,0 +1,84 @@
+package g0801_0900.s0855_exam_room
+
+// #Medium #Design #Ordered_Set #2023_03_31_Time_644_ms_(83.33%)_Space_40.4_MB_(100.00%)
+
+import java.util.Objects
+
+class ExamRoom() {
+    private class Node(var `val`: Int, map: MutableMap<Int?, Node>) {
+        var pre: Node? = null
+        var next: Node? = null
+
+        init {
+            map[`val`] = this
+        }
+
+        fun insert(left: Node?): Int {
+            val right = left!!.next
+            left.next = this
+            right!!.pre = this
+            next = right
+            pre = left
+            return `val`
+        }
+
+        fun delete() {
+            val left = pre
+            val right = next
+            left!!.next = right
+            right!!.pre = left
+        }
+    }
+
+    private val map: MutableMap<Int?, Node> = HashMap()
+    private val head = Node(-1, map)
+    private val tail = Node(-1, map)
+    private var n = 0
+
+    init {
+        head.next = tail
+        tail.pre = head
+    }
+
+    constructor(n: Int) : this() {
+        this.n = n
+    }
+
+    fun seat(): Int {
+        val right = n - 1 - tail.pre!!.`val`
+        val left = head.next!!.`val`
+        var max = 0
+        var maxAt = -1
+        var maxAtLeft: Node? = null
+        var cur = tail.pre
+        while (cur !== head && cur!!.pre !== head) {
+            val pre = cur!!.pre
+            val at = (cur.`val` + pre!!.`val`) / 2
+            val distance = at - pre.`val`
+            if (distance >= max) {
+                maxAtLeft = pre
+                max = distance
+                maxAt = at
+            }
+            cur = cur.pre
+        }
+        if (head.next === tail || left >= max && left >= right) {
+            return Node(0, map).insert(head)
+        }
+        return if (right > max) {
+            Node(n - 1, map).insert(tail.pre)
+        } else Node(maxAt, map).insert(Objects.requireNonNull(maxAtLeft))
+    }
+
+    fun leave(p: Int) {
+        map[p]!!.delete()
+        map.remove(p)
+    }
+}
+
+/*
+ * Your ExamRoom object will be instantiated and called as such:
+ * var obj = ExamRoom(n)
+ * var param_1 = obj.seat()
+ * obj.leave(p)
+ */

src/main/kotlin/g0801_0900/s0855_exam_room/readme.md

@@ -0,0 +1,37 @@
+855\. Exam Room
+
+Medium
+
+There is an exam room with `n` seats in a single row labeled from `0` to `n - 1`.
+
+When a student enters the room, they must sit in the seat that maximizes the distance to the closest person. If there are multiple such seats, they sit in the seat with the lowest number. If no one is in the room, then the student sits at seat number `0`.
+
+Design a class that simulates the mentioned exam room.
+
+Implement the `ExamRoom` class:
+
+*   `ExamRoom(int n)` Initializes the object of the exam room with the number of the seats `n`.
+*   `int seat()` Returns the label of the seat at which the next student will set.
+*   `void leave(int p)` Indicates that the student sitting at seat `p` will leave the room. It is guaranteed that there will be a student sitting at seat `p`.
+
+**Example 1:**
+
+**Input** ["ExamRoom", "seat", "seat", "seat", "seat", "leave", "seat"] [[10], [], [], [], [], [4], []]
+
+**Output:** [null, 0, 9, 4, 2, null, 5]
+
+**Explanation:**
+
+    ExamRoom examRoom = new ExamRoom(10);
+    examRoom.seat(); // return 0, no one is in the room, then the student sits at seat number 0. 
+    examRoom.seat(); // return 9, the student sits at the last seat number 9. 
+    examRoom.seat(); // return 4, the student sits at the last seat number 4. 
+    examRoom.seat(); // return 2, the student sits at the last seat number 2. 
+    examRoom.leave(4); 
+    examRoom.seat(); // return 5, the student sits at the last seat number 5.
+
+**Constraints:**
+
+*   <code>1 <= n <= 10<sup>9</sup></code>
+*   It is guaranteed that there is a student sitting at seat `p`.
+*   At most <code>10<sup>4</sup></code> calls will be made to `seat` and `leave`.

src/main/kotlin/g0801_0900/s0856_score_of_parentheses/Solution.kt

@@ -0,0 +1,29 @@
+package g0801_0900.s0856_score_of_parentheses
+
+// #Medium #String #Stack #2023_03_31_Time_129_ms_(84.62%)_Space_34_MB_(46.15%)
+
+import java.util.Deque
+import java.util.LinkedList
+
+class Solution {
+    fun scoreOfParentheses(s: String): Int {
+        val stack: Deque<Int> = LinkedList()
+        for (element in s) {
+            if (element == '(') {
+                stack.push(-1)
+            } else {
+                var curr = 0
+                while (stack.peek() != -1) {
+                    curr += stack.pop()
+                }
+                stack.pop()
+                stack.push(if (curr == 0) 1 else curr * 2)
+            }
+        }
+        var score = 0
+        while (!stack.isEmpty()) {
+            score += stack.pop()
+        }
+        return score
+    }
+}

src/main/kotlin/g0801_0900/s0856_score_of_parentheses/readme.md

@@ -0,0 +1,35 @@
+856\. Score of Parentheses
+
+Medium
+
+Given a balanced parentheses string `s`, return _the **score** of the string_.
+
+The **score** of a balanced parentheses string is based on the following rule:
+
+*   `"()"` has score `1`.
+*   `AB` has score `A + B`, where `A` and `B` are balanced parentheses strings.
+*   `(A)` has score `2 * A`, where `A` is a balanced parentheses string.
+
+**Example 1:**
+
+**Input:** s = "()"
+
+**Output:** 1
+
+**Example 2:**
+
+**Input:** s = "(())"
+
+**Output:** 2
+
+**Example 3:**
+
+**Input:** s = "()()"
+
+**Output:** 2
+
+**Constraints:**
+
+*   `2 <= s.length <= 50`
+*   `s` consists of only `'('` and `')'`.
+*   `s` is a balanced parentheses string.

src/main/kotlin/g0801_0900/s0857_minimum_cost_to_hire_k_workers/Solution.kt

@@ -0,0 +1,43 @@
+package g0801_0900.s0857_minimum_cost_to_hire_k_workers
+
+// #Hard #Array #Sorting #Greedy #Heap_Priority_Queue
+// #2023_03_31_Time_302_ms_(100.00%)_Space_39.4_MB_(100.00%)
+
+import java.util.PriorityQueue
+
+class Solution {
+    fun mincostToHireWorkers(quality: IntArray, wage: IntArray, k: Int): Double {
+        val n = quality.size
+        val workers = arrayOfNulls<Worker>(n)
+        for (i in 0 until n) {
+            workers[i] = Worker(wage[i], quality[i])
+        }
+        workers.sortBy { it!!.ratio() }
+        val maxHeap = PriorityQueue { a: Int?, b: Int? ->
+            Integer.compare(
+                b!!, a!!
+            )
+        }
+        var sumQuality = 0
+        var result = Double.MAX_VALUE
+        for (i in 0 until n) {
+            val worker = workers[i]
+            sumQuality += worker!!.quality
+            maxHeap.add(worker.quality)
+            if (maxHeap.size > k) {
+                sumQuality -= maxHeap.remove()!!
+            }
+            val groupRatio = worker.ratio()
+            if (maxHeap.size == k) {
+                result = Math.min(sumQuality * groupRatio, result)
+            }
+        }
+        return result
+    }
+
+    internal class Worker(var wage: Int, var quality: Int) {
+        fun ratio(): Double {
+            return wage.toDouble() / quality
+        }
+    }
+}

src/main/kotlin/g0801_0900/s0857_minimum_cost_to_hire_k_workers/readme.md

@@ -0,0 +1,35 @@
+856\. Score of Parentheses
+
+Medium
+
+Given a balanced parentheses string `s`, return _the **score** of the string_.
+
+The **score** of a balanced parentheses string is based on the following rule:
+
+*   `"()"` has score `1`.
+*   `AB` has score `A + B`, where `A` and `B` are balanced parentheses strings.
+*   `(A)` has score `2 * A`, where `A` is a balanced parentheses string.
+
+**Example 1:**
+
+**Input:** s = "()"
+
+**Output:** 1
+
+**Example 2:**
+
+**Input:** s = "(())"
+
+**Output:** 2
+
+**Example 3:**
+
+**Input:** s = "()()"
+
+**Output:** 2
+
+**Constraints:**
+
+*   `2 <= s.length <= 50`
+*   `s` consists of only `'('` and `')'`.
+*   `s` is a balanced parentheses string.

src/test/kotlin/g0801_0900/s0854_k_similar_strings/SolutionTest.kt

@@ -0,0 +1,17 @@
+package g0801_0900.s0854_k_similar_strings
+
+import org.hamcrest.CoreMatchers.equalTo
+import org.hamcrest.MatcherAssert.assertThat
+import org.junit.jupiter.api.Test
+
+internal class SolutionTest {
+    @Test
+    fun kSimilarity() {
+        assertThat(Solution().kSimilarity("ab", "ba"), equalTo(1))
+    }
+
+    @Test
+    fun kSimilarity2() {
+        assertThat(Solution().kSimilarity("abc", "bca"), equalTo(2))
+    }
+}