adding sqrtx and pow x n algos

src/my_project/interviews/top_150_questions_round_22/ex_129_sqrtx.py

@@ -0,0 +1,20 @@
+from typing import List, Union, Collection, Mapping, Optional
+from abc import ABC, abstractmethod
+
+class Solution:
+    def mySqrt(self, x: int) -> int:
+
+        left, right = 0, x 
+
+        while left <= right:
+
+            mid = (left + right)//2
+
+            if mid ** 2 < x:
+                left = mid + 1
+            elif mid ** 2 > x:
+                right = mid - 1
+            else:
+                return mid
+
+        return min(left, right)

src/my_project/interviews/top_150_questions_round_22/ex_130_pow_x_n.py

@@ -0,0 +1,14 @@
+from typing import List, Union, Collection, Mapping, Optional
+from abc import ABC, abstractmethod
+
+class Solution:
+    def myPow(self, x, n):
+
+        if not n: 
+            return 1
+        if n < 1: 
+            return self.myPow(1/x, -n)
+        if n % 2:
+            return x*self.myPow(x,n-1)
+        else: 
+            return self.myPow(x**2,n//2)

src/my_project/interviews_typescript/top_150_questions_round_1/ex_129_sqrtx.ts

@@ -0,0 +1,29 @@
+function mySqrt(x: number): number {
+    // Edge cases
+    if (x === 0 || x === 1) {
+        return x;
+    }
+
+    // Binary search for the square root
+    let left = 1;
+    let right = x;
+    let result = 0;
+
+    while (left <= right) {
+        const mid = Math.floor(left + (right - left) / 2);
+        const square = mid * mid;
+
+        if (square === x) {
+            return mid;
+        } else if (square < x) {
+            // Store the potential answer and search in the right half
+            result = mid;
+            left = mid + 1;
+        } else {
+            // square > x, search in the left half
+            right = mid - 1;
+        }
+    }
+
+    return result;
+};

src/my_project/interviews_typescript/top_150_questions_round_1/ex_130_pow_x_n.ts

@@ -0,0 +1,14 @@
+function myPow(x: number, n: number): number {
+
+    if (!n){
+        return 1
+    }
+    if (n < 0){
+        return 1/myPow(x,-n)
+    }
+    if (n%2 !== 0){
+        return x * myPow(x,n-1)
+    }
+    return myPow(x*x,n/2)
+
+};

tests/test_150_questions_round_22/test_129_sqrtx_round_22.py

@@ -0,0 +1,17 @@
+import unittest
+from src.my_project.interviews.top_150_questions_round_22\
+.ex_129_sqrtx import Solution
+
+class SqrtxTestCase(unittest.TestCase):
+
+    def test_even_sqrtx(self):
+        solution = Solution()
+        output = solution.mySqrt(x=4)
+        target = 2 
+        self.assertEqual(output, target)
+
+    def test_odd_sqrtx(self):
+        solution = Solution()
+        output = solution.mySqrt(x=8)
+        target = 2 
+        self.assertEqual(output, target)