Merge pull request #208

add new problems for merge 19.06

Author: Ashwagandha-coder

README.md

@@ -1,8 +1,20 @@
-# solution algorithm problems
+# Contest Kotlin
+
 ![Kotlin](https://img.shields.io/badge/kotlin-%237F52FF.svg?style=for-the-badge&logo=kotlin&logoColor=white)
 ![Android Studio](https://img.shields.io/badge/Android%20Studio-3DDC84.svg?style=for-the-badge&logo=android-studio&logoColor=white)
 
-## Task
+# Description
+
+This repository contains problems of leetcode. We might use this repo how get solution for define
+problem from leetcode. Also We might clone this repo and run or debug problems in android studio.
+
+# How to use
+
+1. Each problem will be in contest module
+2. Each problem have a few solutions. Main solution with using down level code. Alternative Solution
+   with other approaches. Prod Variant - this code might be in prod in application or service. This
+   code using std lib kotlin
+3. For search each problem have kotlin doc with name and number problem. Also each problem have tag
+   for commit for search in github.
+4. Each Topic have package which contains problem
 
-- [leetcode task](app/src/main/java/com/leetcode_kotlin/AlgorithmLeetcode.kt)
-- [codeWars task](app/src/main/java/com/leetcode_kotlin/AlgorithmCodeWars.kt)

app/src/main/java/com/leetcode_kotlin/AlgorithmLeetcode.kt

@@ -578,36 +578,6 @@ fun findDuplicates(nums: IntArray): List<Int> {
     return ans
 }
 
-/**
- * 73. Set Matrix Zeroes
- */
-
-
-fun setZeroes(matrix: Array<IntArray>) {
-    val m = matrix.size
-    val n = matrix[0].size
-
-    val forRows = BooleanArray(m)
-    val forCols = BooleanArray(n)
-
-    for (i in 0 until m) {
-        for (j in 0 until n) {
-            if (matrix[i][j] == 0) {
-                forRows[i] = true
-                forCols[j] = true
-            }
-        }
-    }
-
-
-    for (i in 0 until m) {
-        for (j in 0 until n) {
-            if (forRows[i] || forCols[j]) {
-                matrix[i][j] = 0
-            }
-        }
-    }
-}
 
 /**
  * 48. Rotate Image

app/src/main/java/com/leetcode_kotlin/AlgorithmProdVariant.kt

@@ -580,43 +580,6 @@ fun heightProdVariant(root: TreeNode?): Int = when {
     else -> 1 + maxOf(heightProdVariant(root?.left), heightProdVariant(root?.right))
 }
 
-/**
- * 73. Set Matrix Zeroes
- * Prod Variant
- */
-
-fun setZeroesProdVariant(matrix: Array<IntArray>) {
-    val m = matrix.size
-    val n = matrix[0].size
-    var firstRowZero = false
-    var firstColZero = false
-
-
-    matrix.forEachIndexed { i, row ->
-        row.forEachIndexed { j, value ->
-            if (value == 0) {
-                if (i == 0) firstRowZero = true
-                if (j == 0) firstColZero = true
-                matrix[i][0] = 0
-                matrix[0][j] = 0
-            }
-        }
-    }
-
-
-    for (i in 1 until m) {
-        for (j in 1 until n) {
-            if (matrix[i][0] == 0 || matrix[0][j] == 0) {
-                matrix[i][j] = 0
-            }
-        }
-    }
-
-
-    if (firstRowZero) matrix[0].fill(0)
-    if (firstColZero) for (i in 0 until m) matrix[i][0] = 0
-}
-
 /**
  * 287. Find the Duplicate Number
  * Prod Variant

app/src/main/java/com/leetcode_kotlin/AlternativeAlgorithmSolution.kt

@@ -926,51 +926,6 @@ fun canBreak(start: Int, s: String, trie: TrieWordBreak): Boolean {
     return false
 }
 
-/**
- * 73. Set Matrix Zeroes
- * Alternative Solution
- */
-
-fun setZeroesAltSolution(matrix: Array<IntArray>) {
-    val m = matrix.size
-    val n = matrix[0].size
-    var firstRowZero = false
-    var firstColZero = false
-
-
-    for (i in 0 until m) {
-        for (j in 0 until n) {
-            if (matrix[i][j] == 0) {
-                if (i == 0) firstRowZero = true
-                if (j == 0) firstColZero = true
-                matrix[i][0] = 0
-                matrix[0][j] = 0
-            }
-        }
-    }
-
-
-    for (i in 1 until m) {
-        for (j in 1 until n) {
-            if (matrix[i][0] == 0 || matrix[0][j] == 0) {
-                matrix[i][j] = 0
-            }
-        }
-    }
-
-
-    if (firstRowZero) {
-        for (j in 0 until n) {
-            matrix[0][j] = 0
-        }
-    }
-    if (firstColZero) {
-        for (i in 0 until m) {
-            matrix[i][0] = 0
-        }
-    }
-}
-
 /**
  * 230. Kth Smallest Element in a BST
  * Alt Solution

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

@@ -1,17 +1,17 @@
 package com.github.contest
 
-fun MutableMap<Int, Int>.removeIfEmptyBucket(key: Int) {
-    this[key] = this.getOrDefault(key, 0) - 1
+
+fun <K, V> MutableMap<K, V>.removeIfEmptyBucket(key: K) {
     if (this[key] == 0) this.remove(key)
 }
 
-
-fun Any.printData(label: String) {
-    println("$label $this")
+fun <K> MutableMap<K, Int>.reduceCount(key: K) {
+    this[key] = this.getOrDefault(key, 0) - 1
+    removeIfEmptyBucket(key)
 }
 
 
-inline fun abs(number: Int): Int = when {
+fun abs(number: Int): Int = when {
     number < 0 -> number * -1
     else -> number
 }

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

@@ -164,3 +164,70 @@ fun pivotArrayAlternativeSolution(nums: IntArray, pivot: Int): IntArray {
 
     return result
 }
+
+
+/**
+ * 73. Set Matrix Zeroes
+ * Alternative Solution
+ */
+
+fun setZeroesAltSolution(matrix: Array<IntArray>) {
+    val m = matrix.size
+    val n = matrix[0].size
+    var firstRowZero = false
+    var firstColZero = false
+
+
+    for (i in 0 until m) {
+        for (j in 0 until n) {
+            if (matrix[i][j] == 0) {
+                if (i == 0) firstRowZero = true
+                if (j == 0) firstColZero = true
+                matrix[i][0] = 0
+                matrix[0][j] = 0
+            }
+        }
+    }
+
+
+    for (i in 1 until m) {
+        for (j in 1 until n) {
+            if (matrix[i][0] == 0 || matrix[0][j] == 0) {
+                matrix[i][j] = 0
+            }
+        }
+    }
+
+
+    if (firstRowZero) {
+        for (j in 0 until n) {
+            matrix[0][j] = 0
+        }
+    }
+    if (firstColZero) {
+        for (i in 0 until m) {
+            matrix[i][0] = 0
+        }
+    }
+}
+
+/**
+ * 2016. Maximum Difference Between Increasing Elements
+ * Alternative Solution
+ */
+
+fun maximumDifferenceAlternativeSolution(nums: IntArray): Int {
+    var diff = -1
+    var minVal = Int.MAX_VALUE
+
+    for (i in nums.indices) {
+        when {
+            nums[i] < minVal -> minVal = minOf(minVal, nums[i])
+            else -> if (nums[i] > minVal) diff = maxOf(diff, nums[i] - minVal) else continue
+        }
+    }
+
+    return diff
+}
+
+