Requirements.txt added

Author: andreafiori

README.md

@@ -2,14 +2,10 @@
 
 A curated collection of competitive programming problems and solutions in Python, sourced from the most popular platforms. Every solution is adapted with unit tests for easy verification and learning.
 
----
-
 ## 📋 Requirements
 
 - **Python**: 3.13.3
 
----
-
 ## 🚀 Getting Started
 
 ### 1. Create a virtual environment
@@ -43,7 +39,6 @@ docker build --target test -t myapp-test .
 docker run --rm myapp-test
 ```
 
----
 
 ## 🧪 Running Tests
 
@@ -57,7 +52,6 @@ Or explicitly via the venv Python:
 .venv/bin/python -m pytest
 ```
 
----
 
 ## 🧹 Cleaning Up
 
@@ -73,7 +67,6 @@ rm -rf .venv
 
 > ⚠️ Note: The cleanup command uses `rm -rf .venv` (not `rm .env`) to remove the virtual environment directory.
 
----
 
 ## 🌐 Platforms
 
@@ -86,7 +79,6 @@ Solutions are sourced from the following competitive programming platforms:
 | Codility | [codility.com](https://www.codility.com) |
 | LeetCode | [leetcode.com](https://www.leetcode.com) |
 
----
 
 ## 📁 Project Structure
 
@@ -98,12 +90,10 @@ Solutions are sourced from the following competitive programming platforms:
 └── Dockerfile        # Docker configuration
 ```
 
----
-
 ## 🤝 Contributing
 
 Contributions are welcome! When adding a new solution, please ensure:
 
 1. The solution is placed in the appropriate platform folder.
 2. A corresponding unit test is included.
-3. All existing tests pass before submitting.
+3. All existing tests pass before submitting.

requirements.txt

@@ -1,5 +1,5 @@
 """
-Frog River One
+Frog River One | https://app.codility.com/programmers/lessons/4-counting_elements/frog_river_one/
 
 Find the earliest time when a frog can jump to the other side of a river.
 

src/app/codility/counting_elements/frog_river_one.py

@@ -81,10 +81,8 @@ def self.maxCounters.solution(N, A)
 """
 
 class MaxCounters:
-    # MAX_INT = 100000
-    # INT_RANGE = (1, MAX_INT)
 
-    def solution(self, N: int, A):
+    def solution(self, N: int, A: list[int]) -> list[int]:
         """
         :param N: integer - the number of counters
         :param A: a sequence of integers specifying which counter to increase

src/app/codility/counting_elements/max_counters.py

@@ -22,4 +22,4 @@ def dfs(self, root: TreeNode, curSum: int, targetSum: int) -> bool:
         if root.left is None and root.right is None:
             return curSum == targetSum
 
-        return self.dfs(root.left, curSum, targetSum) or self.dfs(root.right, curSum, targetSum)
+        return self.dfs(root.left, curSum, targetSum) or self.dfs(root.right, curSum, targetSum)

src/app/leetcode/guess_number_higher_or_lower_ii.py

@@ -1,5 +1,7 @@
 """
-# https://leetcode.com/articles/intersection-two-linked-lists/
+Intersection of Two Linked Lists | https://leetcode.com/problems/intersection-of-two-linked-lists/
+
+https://leetcode.com/articles/intersection-two-linked-lists/
 
 """
 

src/app/leetcode/ltc_0112_path sum.py

@@ -0,0 +1,24 @@
+"""
+Guess Number Higher or Lower II | htttp://leetcode.com/problems/guess-number-higher-or-lower-ii/
+
+https://discuss.leetcode.com/topic/51353/simple-dp-solution-with-explanation/2
+
+"""
+
+import sys
+
+class GuessNumberHigherOrLowerII:
+
+    def getMoneyAmount(self, n: int) -> int:
+        dp = [[0] * (n + 1) for _ in range(n + 1)]
+        for j in range(2, n + 1):
+            for i in range(j - 1, 0, -1):
+                global_min = sys.maxsize
+                for k in range(i + 1, j):
+                    local_max = k + max(dp[i][k - 1], dp[k + 1][j])
+                    global_min = min(global_min, local_max)
+                if i + 1 == j:
+                    dp[i][j] = i
+                else:
+                    dp[i][j] = global_min
+        return dp[1][n]