commit

Author: Aman burnwal

Practice In JavaScript Progrmas/day21_13July/bracket.js

@@ -0,0 +1,14 @@
+function bracket(n,open,close,str) {
+    if(open === n && close === n){
+        console.log(str);
+        return;
+    }
+    if(open < n){
+        bracket(n, open+1, close, str+"(")
+    }
+    if(open > close) {
+        bracket(n, open, close+1, str+")")
+    }
+}
+
+a(3,0,0,"");

Practice In JavaScript Progrmas/day21_13July/prime.js

@@ -0,0 +1,35 @@
+// let n = -20;
+// for (let i = 0; i <= n; i++) {
+//     let prime = 0;
+//     for (let j = 2; j < i; j++) {
+//         if (i % j === 0) {
+//             prime = 1;
+//             break;
+//         }
+//     }
+//     if (i > 1 && prime == 0) {
+//         console.log(i)
+//     }
+// }
+
+function primeis(num) {
+    if(num <= 1) {
+        return -1;
+    }
+
+    for(let i = 2; i < num; i++) {
+        let a = true;
+        for(let j = 2; j <= i; j++ ) {
+            if(i % j === 0) {
+                a = false;
+                break;
+            }
+        }
+        if(a === true){
+            console.log(i)
+        }
+    }
+
+}
+
+primeis(20)

Practice In JavaScript Progrmas/day21_13July/sum.js

@@ -1,4 +1,12 @@
 function sum (num1, num2) {
-    let carry = 1;
+    while(num2 != 0) {
+        let carry = num1 & num2
+        num1 = num1 ^ num2;
+
+        num2 = carry << 1;
+    }
+    return num1;
 
-}
+}
+
+console.log(sum(3,5));

ReLevel By Unacademy/Class Desk/27May/binomialCoefficient.js

@@ -0,0 +1,15 @@
+function binomialCoefficient(n , k){
+    //Base cases
+    if(k > n){
+      return 0;
+    }
+    
+    if(k === 0 || k === n){
+      return 1;
+    }
+    
+    return binomialCoefficient(n - 1, k - 1) + binomialCoefficient(n - 1, k);
+  }
+  
+  console.log(binomialCoefficient(6, 4));
+  

ReLevel By Unacademy/Class Desk/27May/calculate_n!.js

@@ -0,0 +1,9 @@
+function factorial(n){
+    if(n === 0){
+        return 1;
+    }
+    return n * factorial(n - 1);
+
+}
+
+console.log(factorial(5));

leet Code/alindrome_Linked_List.js

@@ -0,0 +1,62 @@
+// Given the head of a singly linked list, return true if it is a palindrome.
+
+
+
+// Example 1:
+
+
+// Input: head = [1,2,2,1]
+// Output: true
+// Example 2:
+
+
+// Input: head = [1,2]
+// Output: false
+
+
+// Constraints:
+
+// The number of nodes in the list is in the range [1, 105].
+// 0 <= Node.val <= 9
+
+
+// Follow up: Could you do it in O(n) time and O(1) space?
+
+
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val, next) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.next = (next===undefined ? null : next)
+ * }
+ */
+/**
+ * @param {ListNode} head
+ * @return {boolean}
+ */
+
+
+var isPalindrome = function (head) {
+    let a = true;
+    for (let i = 0; i < head.length / 2; i++) {
+        if (head[i] !== head[head.length - 1 - i]) {
+            a = false;
+            break;
+        }
+    }
+    return a;
+
+};
+
+let head = [1, 2]
+console.log(isPalindrome(head));
+
+// let a = true;
+// for(let i = 0; i < head.length/ 2; i++){
+//     if(head[i] !== head[head.length - 1 - i]){
+//         a = false;
+//         break;
+//     }
+// }
+
+// console.log(a);

leet Code/tempCodeRunnerFile.js

@@ -1 +1 @@
-"IXIV"
+toString(head);