update 10 oct

khemssharma · khemssharma · commit 9b45f8c48d4c · 2024-10-24T20:12:10.000+05:30
diff --git a/DailyProblems.js b/DailyProblems.js
@@ -0,0 +1,14 @@
+```24/10/24. For a binary tree T, we can define a flip operation as follows: choose any node, and swap the left and right child subtrees.
+
+A binary tree X is flip equivalent to a binary tree Y if and only if we can make X equal to Y after some number of flip operations.
+
+Given the roots of two binary trees root1 and root2, return true if the two trees are flip equivalent or false otherwise```
+
+var flipEquiv = function(root1, root2) {
+    // base case
+    if (root1 === null && root2 === null ) return true
+    if (root1 === null || root2 === null) return false
+    if (root1.val !== root2.val) return false;
+    // recursively check no-flip/ flip
+    return ( ( flipEquiv(root1.left, root2.left) && flipEquiv(root1.right, root2.right) ) || ( flipEquiv(root1.left, root2.right) && flipEquiv(root1.right, root2.left) ) )
+};
diff --git a/array.js b/array.js
@@ -1,3 +1,36 @@
+// check if array is sorted (increasing) and rotated
+var check = function (nums) {
+    // Simply check if the next number is greater than the current
+    // If the array is sorted in cyclic order then the next is nums[(i+1)%nums.length]
+    // in cyclic sorted array only 1 time the next number can not be greater/lesser than the current
+    let countDecreasingNums = 0; // counter
+    for (let i = 0; i < nums.length; i++) { 
+        if (nums[i] > nums[(i + 1) % nums.length]) {// iterate over nums, check and count
+            countDecreasingNums++; 
+        }
+    }
+    if (countDecreasingNums > 1) {
+        return false;
+    }
+    return true;
+};
+
+// array increment by one
+var plusOne = function (digits) {
+    for (let i = digits.length - 1; i >= 0; i--) {
+        if (digits[i] < 9) {
+            // simply add one and return digits
+            digits[i] += 1;
+            return digits;
+        }
+        // countinuosly mark digit zero if it is 9
+        digits[i] = 0;
+    }
+    // if all digits are marked zero then add a one in the beginning and return digits
+    digits.unshift(1);
+    return digits;
+};
+
 // remove duplicates in nums
 var removeDuplicates = function (nums) {
     let k = 0;
