Merge pull request #158

small commits 27.02

Author: Ashwagandha-coder

.idea/other.xml

@@ -1,7 +1,7 @@
 package com.github.contest
 
 
-import com.github.contest.binaryTree.recoverPreorderTraversal
+import com.github.contest.heap.largestInteger
 import java.util.TreeMap
 
 
@@ -11,7 +11,8 @@ import java.util.TreeMap
 
 fun main() {
 
-    recoverPreorderTraversal("1-2--3--4-5--6--7")
+    largestInteger(1234)
+
 }
 
 fun generateTesting() {

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

@@ -323,41 +323,31 @@ fun countVowels(word: String): Long {
     return totalVowels
 }
 
+
 /**
- *
+ * 1749. Maximum Absolute Sum of Any Subarray
  */
 
-fun maxTwoEvents(events: Array<IntArray>): Int {
-    val n = events.size
-    events.sortBy { it[0] } // Sort by start time
-    val dp = IntArray(n)
-    var maxVal = 0
-    for (i in n - 1 downTo 0) {
-        maxVal = maxOf(maxVal, events[i][2])
-        dp[i] = maxVal
-    }
-    var res = 0
-    for (i in 0 until n) {
-        val start = events[i][0]
-        val end = events[i][1]
-        val value = events[i][2]
-        val nextIndex = findNextNonOverlapping(events, end)
-        val nextValue = if (nextIndex == n) 0 else dp[nextIndex]
-        res = maxOf(res, value + nextValue)
-    }
-    return res
-}
+fun maxAbsoluteSum(nums: IntArray): Int {
+    var maxSoFar = 0
+    var minSoFar = 0
+    var currentMax = 0
+    var currentMin = 0
+
+    for (num in nums) {
+        currentMax += num
+        currentMin += num
+
+        maxSoFar = maxOf(maxSoFar, currentMax)
+        minSoFar = minOf(minSoFar, currentMin)
 
-private fun findNextNonOverlapping(events: Array<IntArray>, end: Int): Int {
-    var left = 0
-    var right = events.size
-    while (left < right) {
-        val mid = left + (right - left) / 2
-        if (events[mid][0] <= end) {
-            left = mid + 1
-        } else {
-            right = mid
+        if (currentMax < 0) {
+            currentMax = 0
+        }
+        if (currentMin > 0) {
+            currentMin = 0
         }
     }
-    return left
+
+    return maxOf(maxSoFar, abs(minSoFar))
 }

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

@@ -310,3 +310,46 @@ fun maxSubsequence(nums: IntArray, k: Int): IntArray {
 
     return indices.map { it.first }.toIntArray()
 }
+
+/**
+ * 2231. Largest Number After Digit Swaps by Parity
+ */
+
+
+fun largestInteger(num: Int): Int {
+    val s = num.toString()
+    val n = s.length
+    val odd = mutableListOf<Int>()
+    val even = mutableListOf<Int>()
+    val oddIndices = mutableListOf<Int>()
+    val evenIndices = mutableListOf<Int>()
+
+    for (i in 0 until n) {
+        val digit = s[i] - '0'
+        if (digit % 2 == 0) {
+            even.add(digit)
+            evenIndices.add(i)
+        } else {
+            odd.add(digit)
+            oddIndices.add(i)
+        }
+    }
+
+    odd.sortDescending()
+    even.sortDescending()
+
+    val result = CharArray(n)
+    var oddIndex = 0
+    var evenIndex = 0
+
+    for (i in 0 until n) {
+        if (s[i].toInt() % 2 == 0) {
+            result[i] = (even[evenIndex++]).toChar() + '0'.toInt()
+        } else {
+            result[i] = (odd[oddIndex++]).toChar() + '0'.toInt()
+        }
+    }
+
+    return String(result).toInt()
+}
+