Merge branch 'neetcode-gh:main' into main

sahasourav17 · web-flow · commit c685bf6e7fcd · 2023-08-27T23:11:00.000+06:00
diff --git a/README.md b/README.md
@@ -404,7 +404,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[1035 - Uncrossed Lines](https://leetcode.com/problems/uncrossed-lines/)</sub> | <sub><div align='center'>[✔️](c%2F1035-uncrossed-lines.c)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1035-uncrossed-lines.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[2140 - Solving Questions With Brainpower](https://leetcode.com/problems/solving-questions-with-brainpower/)</sub> | <sub><div align='center'>[✔️](c%2F2140-solving-questions-with-brainpower.c)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F2140-solving-questions-with-brainpower.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[2466 - Count Ways to Build Good Strings](https://leetcode.com/problems/count-ways-to-build-good-strings/)</sub> | <sub><div align='center'>[✔️](c%2F2466-count-ways-to-build-good-strings.c)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F2466-count-ways-to-build-good-strings.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
-<sub>[0837 - New 21 Game](https://leetcode.com/problems/new-21-game/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0837-new-21-game.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
+<sub>[0837 - New 21 Game](https://leetcode.com/problems/new-21-game/)</sub> | <sub><div align='center'>[✔️](c%2F0837-new-21-game.c)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0837-new-21-game.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[1626 - Best Team with no Conflicts](https://leetcode.com/problems/best-team-with-no-conflicts/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1626-best-team-with-no-conflicts.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[1406 - Stone Game III](https://leetcode.com/problems/stone-game-iii/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1406-stone-game-iii.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0472 - Concatenated Words](https://leetcode.com/problems/concatenated-words/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0472-concatenated-words.go)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](javascript%2F0472-concatenated-words.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0472-concatenated-words.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0472-concatenated-words.ts)</div></sub>
diff --git a/c/0837-new-21-game.c b/c/0837-new-21-game.c
@@ -0,0 +1,27 @@
+double new21Game(int n, int k, int maxPts) {
+    if (k == 0 || n >= k + maxPts) {
+        return 1.0;
+    }
+
+    double windowSum = 1.0;
+    double probability = 0.0;
+
+    double dp[n + 1];
+    dp[0] = 1.0;
+
+    for (int i = 1; i <= n; i++) {
+        dp[i] = windowSum / maxPts;
+
+        if (i < k) {
+            windowSum += dp[i];
+        } else {
+            probability += dp[i];
+        }
+
+        if (i >= maxPts) {
+            windowSum -= dp[i - maxPts];
+        }
+    }
+
+    return probability;
+}
diff --git a/java/0028-find-the-index-of-the-first-occurrence-in-a-string.java b/java/0028-find-the-index-of-the-first-occurrence-in-a-string.java
@@ -1,3 +1,4 @@
+// Solution One
 public class Solution {
     public int strStr(String haystack, String needle) {
         if (needle.isEmpty()) {
@@ -40,3 +41,17 @@ public int strStr(String haystack, String needle) {
     }
 }
 
+// Solution Two (Linear search using indexOf method for arrays)
+class Solution {
+    public int strStr(String haystack, String needle) {
+        int result = 0;
+        if (haystack.length() <= 0 && needle.length() > 0) return -1;
+        if (haystack.length() != 0) {
+            int occurence = haystack.indexOf(needle);
+            if (occurence == -1) 
+                return occurence;
+            result = occurence;
+        }
+        return result;
+    }
+}
