add 1980

Author: Ashwagandha-coder

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

@@ -1,7 +1,8 @@
 package com.github.contest
 
 
-import com.github.contest.heap.findDiagonalOrderProdVariant
+import com.github.contest.backtracking.findDifferentBinaryString
+import java.util.TreeMap
 
 
 /**
@@ -10,17 +11,22 @@ import com.github.contest.heap.findDiagonalOrderProdVariant
 
 fun main() {
 
-    findDiagonalOrderProdVariant(
-        listOf(
-            listOf(1, 2, 3, 4, 5),
-            listOf(6, 7),
-            listOf(8)
-        )
-    ).also { println(it.printArray()) }
+    findDifferentBinaryString(arrayOf("00", "01"))
 
 }
 
 
+fun workWithTreeMap() {
+    val treeMapOne = TreeMap<String, Int>()
+    treeMapOne["apple"] = 1
+    treeMapOne["banana"] = 2
+    treeMapOne["cherry"] = 3
+
+    println("TreeMap with natural ordering:")
+    treeMapOne.forEach { (key, value) -> println("$key: $value") }
+}
+
+
 fun IntArray.printArray() {
     var s = when (this.size) {
         0 -> "[]"

contest/src/main/java/com/github/contest/backtracking/BacktrackingLeetcode.kt

@@ -141,4 +141,32 @@ private fun generateHappyString(
             subset.deleteCharAt(subset.length - 1)
         }
     }
+}
+
+/**
+ * 1980. Find Unique Binary String
+ */
+
+
+fun findDifferentBinaryString(nums: Array<String>): String {
+    val set = mutableSetOf<String>()
+    for (num in nums) set.add(num)
+    return generateBinaryString(set, 0, nums[0].length, StringBuilder())
+}
+
+private fun generateBinaryString(set: Set<String>, index: Int, n: Int, str: StringBuilder): String {
+    if (index == n) {
+        return if (!set.contains(str.toString())) str.toString() else ""
+    }
+    repeat(2) {
+        str.append(it.toString())
+        val ans = generateBinaryString(set, index + 1, n, str)
+        if (ans.isNotEmpty()) return ans
+        str.deleteLast()
+    }
+    return ""
+}
+
+private fun StringBuilder.deleteLast() {
+    if (isNotEmpty()) this.deleteCharAt(this.length - 1)
 }