Merge pull request #162

add new problem 3.03

Author: Ashwagandha-coder

Diff for: contest/src/main/java/com/github/contest/array/ArrayLeetcode.kt

@@ -95,4 +95,25 @@ private fun IntArray.swap(from: Int, to: Int) {
     this[to] = temp
 }
 
+/**
+ * 2161. Partition Array According to Given Pivot
+ */
+fun pivotArray(nums: IntArray, pivot: Int): IntArray {
+    if (nums.hasSingle()) return nums
+    val res = mutableListOf<Int>()
+    for (i in 0 until nums.size) {
+        if (nums[i] < pivot) res.add(nums[i])
+    }
+    for (i in 0 until nums.size) {
+        if (nums[i] == pivot) res.add(nums[i])
+    }
+    for (i in 0 until nums.size) {
+        if (nums[i] > pivot) res.add(nums[i])
+    }
+
+    return res.toIntArray()
+}
+
+
+
 

Diff for: contest/src/main/java/com/github/contest/dp/DpProdVariant.kt

@@ -109,3 +109,24 @@ fun longestCommonSubsequenceProdVariant(text1: String, text2: String): Int {
 }
 
 private fun Array<IntArray>.lastElement(): Int = this.last().last()
+
+
+/**
+ * 1048. Longest String Chain
+ * Prod Variant
+ */
+
+fun longestStrChainProdVariant(words: Array<String>): Int {
+    val sortedWords = words.sortedBy { it.length }
+    val dp = mutableMapOf<String, Int>()
+
+
+    return sortedWords.maxOf { word ->
+        var currentChain = word.indices.maxOf { index ->
+            val predecessor = word.removeRange(index, index + 1)
+            dp.getOrDefault(predecessor, 0) + 1
+        }
+        dp[word] = currentChain
+        currentChain
+    }
+}