leetcode basecode update, updated README

Author: andreafiori

README.md

@@ -14,11 +14,16 @@ A curated collection of competitive programming problems and solutions in Python
 python -m venv .venv
 ```
 
-Activate it:
+Activate on Windows:
+
+```bash
+Set-ExecutionPolicy -ExecutionPolicy RemoteSigned -Scope CurrentUse
+.venv\Scripts\activate.ps1
+```
+
+
+Set-ExecutionPolicy -ExecutionPolicy RemoteSigned -Scope CurrentUse
 
-| Platform | Command |
-|---|---|
-| Windows | `.venv\Scripts\activate` |
 | macOS / Linux | `source .venv/bin/activate` |
 
 ### 2. Install dependencies
@@ -97,3 +102,7 @@ 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.
+
+## Resources
+
+* [Leetcode main](https://github.com/doocs/leetcode/tree/main)

src/app/leetcode/closest_binary_search_tree_value.py

@@ -0,0 +1,23 @@
+"""
+Integer to Roman | https://leetcode.com/problems/integer-to-roman/
+"""
+
+class IntegerToRoman:
+
+    def intToRoman(self, num: int) -> str:
+        values = [1000, 900, 500, 400,
+                  100, 90, 50, 40,
+                  10, 9, 5, 4, 1]
+        symbols = ["M", "CM", "D", "CD",
+                   "C", "XC", "L", "XL",
+                   "X", "IX", "V", "IV",
+                   "I"]
+        roman = ''
+        i = 0
+        while num > 0:
+            k = num / values[i]
+            for j in range(k):
+                roman += symbols[i]
+                num -= values[i]
+            i += 1
+        return roman

src/app/leetcode/convert_sorted_list_to_binary_search_tree.py

@@ -0,0 +1,23 @@
+"""
+Divide two integers without using multiplication, division and mod operator. | https://leetcode.com/problems/divide-two-integers/
+"""
+
+import math
+
+class DivideTwoIntegers:
+    MAX_INT = int(100000)
+
+    def divide(self, dividend, divisor):
+        if divisor == 0:
+            return self.MAX_INT
+        if dividend == 0:
+            return 0
+        isPositive = (dividend < 0) == (divisor < 0)
+        m = abs(dividend)
+        n = abs(divisor)
+        # ln and exp
+        res = math.log(m) - math.log(n)
+        res = int(math.exp(res))
+        if isPositive:
+            return min(res, 2147483647)
+        return max(0 - res, -2147483648)