add 2094 alternative solution

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.findEvenNumbers
+import com.github.contest.hashTable.findEvenNumbersAlternativeSolution
 import com.github.contest.math.numberOfPowerfulInt
 import com.github.contest.slidingWindow.longestDupSubstring
 import com.github.contest.strings.fullJustify
@@ -15,7 +15,7 @@ import java.util.TreeMap
 
 fun main() {
 
-    findEvenNumbers(intArrayOf(2, 2, 8, 8, 2)).also { it.printArray() }
+    findEvenNumbersAlternativeSolution(intArrayOf(1, 2, 3)).also { it.printArray() }
 }
 
 fun longestDupSubStringTest() {

contest/src/main/java/com/github/contest/hashTable/HashTableAlternativeSolution.kt

@@ -84,4 +84,34 @@ fun countGoodAlternativeSolution(nums: IntArray, k: Int): Long {
     }
 
     return count
+}
+
+/**
+ * 2094. Finding 3-Digit Even Numbers
+ */
+
+fun findEvenNumbersAlternativeSolution(digits: IntArray): IntArray {
+    val freq = IntArray(10)
+    digits.forEach { freq[it]++ }
+
+    val result = mutableListOf<Int>()
+
+    for (h in 1..9) {
+        if (freq[h] == 0) continue
+
+        for (t in 0..9) {
+            if (freq[t] == 0 || (t == h && freq[t] < 2)) continue
+
+            for (u in 0..8 step 2) {
+                if (freq[u] == 0) continue
+                if (u == h && u == t && freq[u] < 3) continue
+                if (u == h && freq[u] < 2) continue
+                if (u == t && freq[u] < 2) continue
+
+                result.add(h * 100 + t * 10 + u)
+            }
+        }
+    }
+
+    return result.sorted().toIntArray()
 }