Some renames

Author: whichrakesh

30 Days Challenge/Single Number.js renamed to April 30 Days Challenge/Day 1 - Single Number.js

@@ -1,9 +1,9 @@
-/**
- * @param {number[]} nums
- * @return {number}
- */
-var singleNumber = function(nums) {
-    let xor = 0;
-    nums.forEach(n => xor = xor ^ n);
-    return xor;
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var singleNumber = function(nums) {
+    let xor = 0;
+    nums.forEach(n => xor = xor ^ n);
+    return xor;
 };

30 Days Challenge/Min Stack.cpp renamed to April 30 Days Challenge/Day 10 - Min Stack.cpp

@@ -1,42 +1,42 @@
-class MinStack {
-    stack<int> s1, s2;
-public:
-    
-    /** initialize your data structure here. */
-    MinStack() {
-        s1 = stack<int>();
-        s2 = stack<int>();
-    }
-    
-    void push(int x) {
-        s1.push(x);
-        if(s2.empty() || x <= getMin()){
-            s2.push(x);
-        }
-    }
-    
-    void pop() {
-        int x = s1.top();
-        s1.pop();
-        if(!s2.empty() && x == getMin()){
-            s2.pop();
-        }
-    }
-    
-    int top() {
-        return s1.top();
-    }
-    
-    int getMin() {
-        return s2.top();
-    }
-};
-
-/**
- * Your MinStack object will be instantiated and called as such:
- * MinStack* obj = new MinStack();
- * obj->push(x);
- * obj->pop();
- * int param_3 = obj->top();
- * int param_4 = obj->getMin();
+class MinStack {
+    stack<int> s1, s2;
+public:
+    
+    /** initialize your data structure here. */
+    MinStack() {
+        s1 = stack<int>();
+        s2 = stack<int>();
+    }
+    
+    void push(int x) {
+        s1.push(x);
+        if(s2.empty() || x <= getMin()){
+            s2.push(x);
+        }
+    }
+    
+    void pop() {
+        int x = s1.top();
+        s1.pop();
+        if(!s2.empty() && x == getMin()){
+            s2.pop();
+        }
+    }
+    
+    int top() {
+        return s1.top();
+    }
+    
+    int getMin() {
+        return s2.top();
+    }
+};
+
+/**
+ * Your MinStack object will be instantiated and called as such:
+ * MinStack* obj = new MinStack();
+ * obj->push(x);
+ * obj->pop();
+ * int param_3 = obj->top();
+ * int param_4 = obj->getMin();
  */

April 30 Days Challenge/Day 11 - Diameter of Binary Tree.js

@@ -0,0 +1,30 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {number}
+ */
+var diameterOfBinaryTree = function(root) {
+    if(root == null) return 0;
+    return diameterAndMaxHeightOfBinaryTree(root).diameter - 1;
+};
+
+var diameterAndMaxHeightOfBinaryTree = function(root) {
+    if(root == null){
+        return {
+        height: 0, 
+        diameter: 0
+    };
+    }
+    let dlh = diameterAndMaxHeightOfBinaryTree(root.left);
+    let drh = diameterAndMaxHeightOfBinaryTree(root.right);
+    return {
+        height: Math.max(dlh.height, drh.height)+1, 
+        diameter: Math.max(dlh.diameter, drh.diameter, dlh.height + drh.height + 1)
+    };
+};

30 Days Challenge/Last Stone Weight.cpp renamed to April 30 Days Challenge/Day 12 - Last Stone Weight.cpp

@@ -1,26 +1,26 @@
-class Solution {
-public:
-    int lastStoneWeight(vector<int>& stones) {
-        priority_queue<int> stonesq;
-        for(int i=0; i<stones.size(); i++){
-         stonesq.push(stones[i])  ;
-        }
-        if(stonesq.size() == 1){
-            return stonesq.top();
-        }
-        while(!stonesq.empty()){
-            int x = stonesq.top();
-            stonesq.pop();
-            int y = stonesq.top();
-            stonesq.pop();
-            if(x != y){
-                stonesq.push(abs(x-y));
-            }    
-            
-            if(stonesq.size() == 1){
-                return stonesq.top();
-            }
-        }
-        return 0;
-    }
+class Solution {
+public:
+    int lastStoneWeight(vector<int>& stones) {
+        priority_queue<int> stonesq;
+        for(int i=0; i<stones.size(); i++){
+         stonesq.push(stones[i])  ;
+        }
+        if(stonesq.size() == 1){
+            return stonesq.top();
+        }
+        while(!stonesq.empty()){
+            int x = stonesq.top();
+            stonesq.pop();
+            int y = stonesq.top();
+            stonesq.pop();
+            if(x != y){
+                stonesq.push(abs(x-y));
+            }    
+            
+            if(stonesq.size() == 1){
+                return stonesq.top();
+            }
+        }
+        return 0;
+    }
 };

April 30 Days Challenge/Day 13 - Contiguous Array.js

@@ -0,0 +1,15 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var findMaxLength = function(nums) {
+    let k = 0, maxLength = 0, map = {0: -1};
+    nums.forEach((n, i) => {
+        if(!map.hasOwnProperty(n == 0 ? ++k : --k)){
+            map[k] = i;
+        } else {
+            maxLength = Math.max(maxLength, i - map[k]);
+        }
+    })
+    return maxLength;
+};

April 30 Days Challenge/Day 14 - Perform String Shifts.js

@@ -0,0 +1,21 @@
+/**
+ * @param {string} s
+ * @param {number[][]} shift
+ * @return {string}
+ */
+var stringShift = function(s, shift) {
+    let k = 0;
+    shift.forEach(sh => { k += (sh[0] == 0 ? 1 : -1) * sh[1]});
+    if(k < 0){
+        k = k * -1;
+        k = k % s.length;
+        let l = s.substr(s.length - k, k);
+        let r = s.substr(0, s.length - k);    
+        return l + r;
+    } else {
+        k = k % s.length;
+        let l = s.substr(k, s.length - k);
+        let r = s.substr(0, k);    
+        return l + r;
+    }
+};

30 Days Challenge/Product of Array Except Self.js renamed to April 30 Days Challenge/Day 15 - Product of Array Except Self.js

@@ -1,22 +1,22 @@
-/**
- * @param {number[]} nums
- * @return {number[]}
- */
-var productExceptSelf = function(nums) {
-    let output = nums.map(n => 0);
-    output[0] = nums[0];
-    for(let i=1; i<nums.length; i++){
-        output[i] = output[i-1] * nums[i];
-    }
-    for(let i=nums.length-2; i>=0; i--){
-        nums[i] = nums[i+1] * nums[i];
-    }
-    
-    output[nums.length - 1] = output[nums.length - 2];
-    for(let i=nums.length - 2; i > 0; i--){
-        output[i] = output[i-1] * nums[i+1];
-    }
-    output[0] = nums[1];
-    
-    return output;
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var productExceptSelf = function(nums) {
+    let output = nums.map(n => 0);
+    output[0] = nums[0];
+    for(let i=1; i<nums.length; i++){
+        output[i] = output[i-1] * nums[i];
+    }
+    for(let i=nums.length-2; i>=0; i--){
+        nums[i] = nums[i+1] * nums[i];
+    }
+    
+    output[nums.length - 1] = output[nums.length - 2];
+    for(let i=nums.length - 2; i > 0; i--){
+        output[i] = output[i-1] * nums[i+1];
+    }
+    output[0] = nums[1];
+    
+    return output;
 };

30 Days Challenge/Number of Islands.js renamed to April 30 Days Challenge/Day 17 - Number of Islands.js

@@ -0,0 +1,35 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+var search = function(nums, target) {
+    return search2(nums, target, 0, nums.length - 1);
+};
+
+var search2 = function(nums, target, start, end) {
+    if(nums[start] == target){
+        return start;
+    }
+    if(nums[end] == target){
+        return end;
+    }
+    if(start >= end){
+        return -1;
+    }
+    let midPoint = Math.floor((start + end) / 2);
+    if(nums[midPoint] == target){
+        return midPoint;
+    }
+    if((nums[start] < nums[midPoint] && nums[start] < target && target < nums[midPoint]) || 
+       (nums[start] > nums[midPoint] && (nums[start] < target || target < nums[midPoint]))){
+        return search2(nums, target, start, midPoint - 1);
+    }
+    else if((nums[midPoint] < nums[end] && nums[midPoint] < target && target < nums[end]) || 
+       (nums[midPoint] > nums[end] && (nums[midPoint] < target || target < nums[end]))){
+        return search2(nums, target, midPoint + 1, end);
+    }
+    return -1;    
+};
+    
+