Added tasks 3354-3357

Author: javadev

README.md

@@ -1816,6 +1816,10 @@
 
 | #    |      Title     | Difficulty  | Tag         | Time, ms | Time, %
 |------|----------------|-------------|-------------|----------|--------
+| 3357 |[Minimize the Maximum Adjacent Element Difference](src/main/kotlin/g3301_3400/s3357_minimize_the_maximum_adjacent_element_difference)| Hard | Array, Greedy, Binary_Search | 13 | 100.00
+| 3356 |[Zero Array Transformation II](src/main/kotlin/g3301_3400/s3356_zero_array_transformation_ii)| Medium | Array, Binary_Search, Prefix_Sum | 5 | 100.00
+| 3355 |[Zero Array Transformation I](src/main/kotlin/g3301_3400/s3355_zero_array_transformation_i)| Medium | Array, Prefix_Sum | 6 | 36.84
+| 3354 |[Make Array Elements Equal to Zero](src/main/kotlin/g3301_3400/s3354_make_array_elements_equal_to_zero)| Easy | Array, Simulation, Prefix_Sum | 153 | 96.67
 | 3352 |[Count K-Reducible Numbers Less Than N](src/main/kotlin/g3301_3400/s3352_count_k_reducible_numbers_less_than_n)| Hard | String, Dynamic_Programming, Math, Combinatorics | 170 | 100.00
 | 3351 |[Sum of Good Subsequences](src/main/kotlin/g3301_3400/s3351_sum_of_good_subsequences)| Hard | Array, Hash_Table, Dynamic_Programming | 16 | 100.00
 | 3350 |[Adjacent Increasing Subarrays Detection II](src/main/kotlin/g3301_3400/s3350_adjacent_increasing_subarrays_detection_ii)| Medium | Array, Binary_Search | 947 | 48.57

src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/readme.md

@@ -53,10 +53,14 @@ class Solution {
         var lpsCenter = 0
         var lpsRadius = 0
         for (i in newStr.indices) {
-            dp[i] = if (friendCenter + friendRadius > i) Math.min(
-                dp[friendCenter * 2 - i],
-                friendCenter + friendRadius - i
-            ) else 1
+            dp[i] = if (friendCenter + friendRadius > i) {
+                Math.min(
+                    dp[friendCenter * 2 - i],
+                    friendCenter + friendRadius - i,
+                )
+            } else {
+                1
+            }
             while (i + dp[i] < newStr.size && i - dp[i] >= 0 && newStr[i + dp[i]] == newStr[i - dp[i]]) {
                 dp[i]++
             }

src/main/kotlin/g0001_0100/s0010_regular_expression_matching/readme.md

@@ -89,7 +89,7 @@ class Solution {
                     i,
                     j - 2,
                     s,
-                    p
+                    p,
                 )
             }
         } else {

src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/readme.md

@@ -52,7 +52,7 @@ class Solution {
         nums: String,
         letters: Array<String>,
         curr: StringBuilder,
-        ans: MutableList<String>
+        ans: MutableList<String>,
     ) {
         if (curr.length == nums.length) {
             ans.add(curr.toString())

src/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists/readme.md

@@ -56,7 +56,9 @@ class Solution {
     fun mergeKLists(lists: Array<ListNode>): ListNode? {
         return if (lists.isEmpty()) {
             null
-        } else mergeKLists(lists, 0, lists.size)
+        } else {
+            mergeKLists(lists, 0, lists.size)
+        }
     }
 
     private fun mergeKLists(lists: Array<ListNode>, leftIndex: Int, rightIndex: Int): ListNode? {

src/main/kotlin/g0001_0100/s0030_substring_with_concatenation_of_all_words/readme.md

@@ -86,7 +86,6 @@ class Solution {
             // move a word's length each time
             var j = i
             while (j + window <= s.length) {
-
                 // get the subStr
                 val subStr = s.substring(j, j + window)
                 val map: MutableMap<String, Int> = HashMap()

src/main/kotlin/g0001_0100/s0040_combination_sum_ii/readme.md

@@ -48,7 +48,7 @@ class Solution {
         target: Int,
         start: Int,
         sums: MutableList<List<Int>>,
-        sum: LinkedList<Int>
+        sum: LinkedList<Int>,
     ) {
         if (target == 0) {
             // make a deep copy of the current combination
@@ -57,7 +57,6 @@ class Solution {
         }
         var i = start
         while (i < candidates.size && target >= candidates[i]) {
-
             // If candidate[i] equals candidate[i-1], then solutions for i is subset of
             // solution of i-1
             if (i == start || i > start && candidates[i] != candidates[i - 1]) {

src/main/kotlin/g0001_0100/s0046_permutations/readme.md

@@ -48,7 +48,7 @@ class Solution {
         nums: IntArray,
         finalResult: MutableList<List<Int>>,
         currResult: MutableList<Int>,
-        used: BooleanArray
+        used: BooleanArray,
     ) {
         if (currResult.size == nums.size) {
             finalResult.add(ArrayList(currResult))

src/main/kotlin/g0001_0100/s0048_rotate_image/readme.md

@@ -43,7 +43,7 @@ class Solution {
                     intArrayOf(i, j),
                     intArrayOf(j, n - 1 - i),
                     intArrayOf(n - 1 - i, n - 1 - j),
-                    intArrayOf(n - 1 - j, i)
+                    intArrayOf(n - 1 - j, i),
                 )
                 var t = matrix[pos[0][0]][pos[0][1]]
                 for (k in 1 until pos.size) {

src/main/kotlin/g0001_0100/s0049_group_anagrams/readme.md

@@ -44,7 +44,7 @@ class Solution {
             ch.sort()
             val temp = String(ch)
             hm.computeIfAbsent(
-                temp
+                temp,
             ) { _: String? -> ArrayList() }
             hm.getValue(temp).add(s)
         }