add 1048

Author: Ashwagandha-coder

contest/src/main/java/com/github/contest/Execute.kt

@@ -1,7 +1,7 @@
 package com.github.contest
 
 
-import com.github.contest.array.sortArrayByParityIIAlternativeSolution
+import com.github.contest.dp.longestStrChain
 import java.util.TreeMap
 
 
@@ -11,7 +11,7 @@ import java.util.TreeMap
 
 fun main() {
 
-    sortArrayByParityIIAlternativeSolution(intArrayOf(4, 2, 5, 7)).also { it.printArray() }
+    longestStrChain(arrayOf("a", "b", "ba", "bca", "bda", "bdca")).also { println(it) }
 
 }
 

contest/src/main/java/com/github/contest/dp/DpLeetcode.kt

@@ -373,3 +373,25 @@ fun longestCommonSubsequence(text1: String, text2: String): Int {
 
     return dp[n][m]
 }
+
+/**
+ * 1048. Longest String Chain
+ */
+
+fun longestStrChain(words: Array<String>): Int {
+    val sortedWords = words.sortedBy { it.length }
+    val dp = mutableMapOf<String, Int>()
+    var longestChain = 0
+
+    for (word in sortedWords) {
+        var currentChain = 1
+        for (i in word.indices) {
+            val predecessor = word.removeRange(i, i + 1)
+            currentChain = maxOf(currentChain, dp.getOrDefault(predecessor, 0) + 1)
+        }
+        dp[word] = currentChain
+        longestChain = maxOf(longestChain, currentChain)
+    }
+
+    return longestChain
+}