30 oct

Author: khemssharma

JavaScript/math.js

@@ -0,0 +1,70 @@
+var fib = function(n) {
+    if (n <= 1){
+        return n;
+    }
+    return fib(n-1)+fib(n-2);
+};
+
+var isPalindrome = function(s) {
+    const cleaned = s.toLowerCase().replace(/[^a-z0-9]/g,'');
+    return cleaned === cleaned.split('').reverse().join('');
+};
+
+var kidsWithCandies = function(candies, extraCandies) {
+    let max = Math.max(candies);
+    let result = []
+    for (let candy in candies){
+        result.push(candy+extraCandies >= max)
+    }
+    return result;
+};
+
+var reverseList = function(head) {
+    let prev = null
+    let curr = head
+    while (curr != null){
+        let next = curr.next;
+        curr.next = prev;
+        next = prev
+        curr = next;
+    }
+};
+
+var kidsWithCandies = function(candies, extraCandies) {
+    let max = Math.max(...candies);
+    let result = []
+    for (let candy of candies){
+        result.push(candy+extraCandies >= max)
+    }
+    return result;
+};
+
+var reverseList = function(head) {
+    let prev = null
+    let curr = head
+    while (curr !== null){
+        let next = curr.next;
+        curr.next = prev;
+        prev = curr;
+        curr = next;
+    }
+    return prev;
+};
+
+var canPlaceFlowers = function(flowerbed, n) {
+    for (let i = 0; i < flowerbed.length; i++) {
+        // Check if the current plot is empty and the plots to the left and right are also empty or out of bounds
+        if (flowerbed[i] === 0 && 
+            (i === 0 || flowerbed[i - 1] === 0) && 
+            (i === flowerbed.length - 1 || flowerbed[i + 1] === 0)) {
+            
+            // Plant a flower
+            flowerbed[i] = 1;
+            n--;  // Reduce the count of flowers we need to plant
+
+            // If we have planted enough flowers, return true
+            if (n === 0) return true;
+        }
+    }
+    return n <= 0;  // If there are still flowers left to plant, return false
+};

Python/sudokuSolver.py

@@ -0,0 +1,29 @@
+class Solution(object):
+    def solveSudoku(self, board):
+        def isValid(num, row, col):
+            for i in range(9):
+                if board[row][i] == num:
+                    return False
+            for i in range(9):
+                if board[i][col] == num:
+                    return False
+            start_row, start_col = 3*(row//3), 3*(col//3)
+            for i in range(3):
+                for j in range(3):
+                    if board[start_row+i][start_col+j]==num:
+                        return False
+            return True
+
+        def solve():
+            for i in range(9):
+                for j in range(9):
+                    if board[i][j] == '.':
+                        for num in '123456789':
+                            if isValid(num, i, j) :
+                                board[i][j] = num
+                                if solve():
+                                    return True
+                                board[i][j] = '.'
+                        return False
+            return True
+        solve()