diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..40b878d
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1 @@
+node_modules/
\ No newline at end of file
diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md
new file mode 100644
index 0000000..cd17a1f
--- /dev/null
+++ b/CONTRIBUTING.md
@@ -0,0 +1,84 @@
+# Contributing Guidelines  
+  
+This documentation contains a set of guidelines to help you during the contribution process.   
+We are happy to welcome all the contributions from anyone willing to improve this repository in any way possible. Thank you for helping out and remember, **no contribution is too small.**  
+
+# How can you help?🤝
+- Add Website Resources
+- Add Code Snippets
+- Enhancements in the exisiting code-snippets or Notes
+- More ideas are welcomed!
+  
+# Submitting Contributions👩‍💻👨‍💻  
+Below you will find the process and workflow used to review and merge your changes.  
+## Step 0 : Find an issue  
+- Take a look at the Existing Issues or create your **own** Issues!  
+- Wait for the Issue to be assigned to you after which you can start working on it.  
+- Note : Every change in this project should/must have an associated issue.   
+
+  
+## Step 1 : Fork the Project  
+- Fork this Repository. This will create a Local Copy of this Repository on your Github Profile. Keep a reference to the original project in `upstream` remote.  
+```  
+$ git clone https://github.com/<your-username>/<repo-name>  
+$ cd <repo-name>  
+$ git remote add upstream https://github.com/<upstream-owner>/<repo-name>  
+```    
+  
+- If you have already forked the project, update your copy before working.  
+```  
+$ git remote update  
+$ git checkout <branch-name>  
+$ git rebase upstream/<branch-name>  
+```  
+## Step 2 : Branch  
+Create a new branch. Use its name to identify the issue your addressing.  
+```  
+# It will create a new branch with name Branch_Name and switch to that branch 
+$ git checkout -b branch_name  
+```  
+## Step 3 : Work on the issue assigned  
+- Work on the issue(s) assigned to you.   
+- Add all the files/folders needed.  
+- After you've made changes or made your contribution to the project add changes to the branch you've just created by:  
+```  
+# To add all new files to branch Branch_Name  
+$ git add .  
+
+# To add only a few files to Branch_Name
+$ git add <some files>
+```
+- If not assigned, you can submit a PR solving the issue if no one else is working on that. 
+  
+## Step 4 : Commit  
+- To commit give a descriptive message for the convenience of reviewer by:  
+```
+# This message get associated with all files you have changed  
+$ git commit -m "message"  
+```  
+- **NOTE**: A PR should have only one commit. Multiple commits should be squashed. 
+ 
+## Step 5 : Work Remotely  
+- Now you are ready to your work to the remote repository.  
+- When your work is ready and complies with the project conventions, upload your changes to your fork:  
+  
+```  
+# To push your work to your remote repository  
+$ git push -u origin Branch_Name  
+```  
+ 
+  
+## Step 6 : Pull Request  
+- Go to your repository in browser and click on compare and pull requests. Then add a title and description to your pull request that explains your contribution.  
+   
+   
+- Voila! Your Pull Request has been submitted and will be reviewed and merged.🥳  
+  
+## Need more help?🤔  
+You can refer to the following articles on basics of Git and Github and also contact the Project Mentors, in case you are stuck:  
+- [Forking a Repo](https://help.github.com/en/github/getting-started-with-github/fork-a-repo)  
+- [Cloning a Repo](https://help.github.com/en/desktop/contributing-to-projects/creating-an-issue-or-pull-request)  
+- [How to create a Pull Request](https://opensource.com/article/19/7/create-pull-request-github)  
+- [Getting started with Git and GitHub](https://towardsdatascience.com/getting-started-with-git-and-github-6fcd0f2d4ac6)  
+- [Learn GitHub from Scratch](https://lab.github.com/githubtraining/introduction-to-github)  
+  
diff --git a/DSA/Arrays/BubbleSort.js b/DSA/Arrays/BubbleSort.js
new file mode 100644
index 0000000..c37a9d6
--- /dev/null
+++ b/DSA/Arrays/BubbleSort.js
@@ -0,0 +1,24 @@
+// Bubble sort Implementation using Javascript
+  
+ function bblSort(arr){
+   
+ // loop through array
+ for(var i = 0; i < arr.length; i++){
+     
+   for(var j = 0; j < ( arr.length - i -1 ); j++){
+       
+     if(arr[j] > arr[j+1]){
+         
+       var temp = arr[j]
+       arr[j] = arr[j + 1]
+       arr[j+1] = temp
+     }
+   }
+ }
+ console.log(arr);
+}
+  
+var arr = [234, 43, 55, 63,  5, 6, 235, 547];
+ 
+// call the function
+bblSort(arr);
\ No newline at end of file
diff --git a/DSA/Arrays/BubbleSortM2.js b/DSA/Arrays/BubbleSortM2.js
new file mode 100644
index 0000000..1ee0d53
--- /dev/null
+++ b/DSA/Arrays/BubbleSortM2.js
@@ -0,0 +1,24 @@
+function bubbleSort(arr) {
+    const n = arr.length;
+    let swapped;
+
+    do {
+        swapped = false;
+
+        for (let i = 0; i < n - 1; i++) {
+            if (arr[i] > arr[i + 1]) {
+                // Swap elements arr[i] and arr[i+1]
+                let temp = arr[i];
+                arr[i] = arr[i + 1];
+                arr[i + 1] = temp;
+                swapped = true;
+            }
+        }
+    } while (swapped);
+
+    return arr;
+}
+
+const arr = [234, 43, 55, 63, 5, 6, 235, 547];
+const sortedArray = bubbleSort(arr);
+console.log(sortedArray);
diff --git a/DSA/Arrays/BucketSort.js b/DSA/Arrays/BucketSort.js
new file mode 100644
index 0000000..b5e491f
--- /dev/null
+++ b/DSA/Arrays/BucketSort.js
@@ -0,0 +1,77 @@
+// Define the input array
+const arr = [5, 3, 1, 2, 4, 7, 6];
+
+// Define the bucketSort function
+const bucketSort = (arr) => {
+  // Check if the input array is empty
+  if (arr.length === 0) {
+    return arr; // Return the empty array
+  }
+
+  // Initialize variables for minValue, maxValue, and bucket size
+  let i,
+    minValue = arr[0],
+    maxValue = arr[0],
+    bucketSize = 5;
+
+  // Find the minimum and maximum values in the input array
+  arr.forEach(function (currentVal) {
+    if (currentVal < minValue) {
+      minValue = currentVal;
+    } else if (currentVal > maxValue) {
+      maxValue = currentVal;
+    }
+  });
+
+  // Calculate the number of buckets needed based on the range of values
+  let bucketCount = Math.floor((maxValue - minValue) / bucketSize) + 1;
+
+  // Create an array to hold all the buckets
+  let allBuckets = new Array(bucketCount);
+
+  // Initialize each bucket as an empty array
+  for (i = 0; i < allBuckets.length; i++) {
+    allBuckets[i] = [];
+  }
+
+  // Distribute values from the input array into the appropriate buckets
+  arr.forEach(function (currentVal) {
+    allBuckets[Math.floor((currentVal - minValue) / bucketSize)].push(
+      currentVal
+    );
+  });
+
+  // Clear the input array to prepare for sorting
+  arr.length = 0;
+
+  // Sort each bucket using insertion sort and merge them back into the input array
+  allBuckets.forEach(function (bucket) {
+    insertion(bucket);
+    bucket.forEach(function (element) {
+      arr.push(element);
+    });
+  });
+
+  // Return the sorted array
+  return arr;
+};
+
+// Define the insertion sort function
+const insertion = (arr) => {
+  let length = arr.length;
+  let i, j;
+
+  // Iterate through the elements in the bucket and perform insertion sort
+  for (i = 1; i < length; i++) {
+    let temp = arr[i];
+    for (j = i - 1; j >= 0 && arr[j] > temp; j--) {
+      arr[j + 1] = arr[j];
+    }
+    arr[j + 1] = temp;
+  }
+
+  return arr; // Return the sorted bucket
+};
+
+// Call the bucketSort function and print the sorted array
+console.log(bucketSort(arr));
diff --git a/DSA/Arrays/Heapsort in DSA b/DSA/Arrays/Heapsort in DSA
new file mode 100644
index 0000000..0398788
--- /dev/null
+++ b/DSA/Arrays/Heapsort in DSA	
@@ -0,0 +1,35 @@
+function heapSort(arr) {
+    buildMaxHeap(arr);
+    for (let i = arr.length - 1; i > 0; i--) {
+        [arr[0], arr[i]] = [arr[i], arr[0]];
+        maxHeapify(arr, 0, i);
+    }
+}
+function buildMaxHeap(arr) {
+    const n = arr.length;
+    for (let i = Math.floor(n / 2) - 1; i >= 0; i--) {
+        maxHeapify(arr, i, n);
+    }
+}
+function maxHeapify(arr, i, heapSize) {
+    const leftChild = 2 * i + 1;
+    const rightChild = 2 * i + 2;
+    let largest = i;
+
+    if (leftChild < heapSize && arr[leftChild] > arr[largest]) {
+        largest = leftChild;
+    }
+
+    if (rightChild < heapSize && arr[rightChild] > arr[largest]) {
+        largest = rightChild;
+    }
+
+    if (largest !== i) {
+        [arr[i], arr[largest]] = [arr[largest], arr[i]]; // Swap arr[i] and arr[largest]
+        maxHeapify(arr, largest, heapSize);
+    }
+}
+const arr = [12, 11, 13, 5, 6, 7];
+heapSort(arr);
+
+console.log("Sorted array:", arr);
diff --git a/DSA/Arrays/Insertionsort.js b/DSA/Arrays/Insertionsort.js
new file mode 100644
index 0000000..6fdfe9d
--- /dev/null
+++ b/DSA/Arrays/Insertionsort.js
@@ -0,0 +1,12 @@
+function insertionSort(arr) {
+  for (let i = 1; i < arr.length; i++) {
+    let currentValue = arr[i]
+    let j
+    for (j = i - 1; j >= 0 && arr[j] > currentValue; j--) {
+      arr[j + 1] = arr[j]
+    }
+    arr[j + 1] = currentValue
+  }
+  return arr
+}
+console.log(insertionSort([2, 1, 3, 7, 5])) // [1, 2, 3, 5, 7]
\ No newline at end of file
diff --git a/DSA/Arrays/KadanesAlgo.js b/DSA/Arrays/KadanesAlgo.js
new file mode 100644
index 0000000..8f1f962
--- /dev/null
+++ b/DSA/Arrays/KadanesAlgo.js
@@ -0,0 +1,31 @@
+
+function maxSubarraySum(arr, n) {
+    let maxi = Number.MIN_SAFE_INTEGER; // maximum sum
+    let sum = 0;
+
+    for (let i = 0; i < n; i++) {
+        sum += arr[i];
+
+        if (sum > maxi) {
+            maxi = sum;
+        }
+
+        // If sum < 0: discard the sum calculated
+        if (sum < 0) {
+            sum = 0;
+        }
+    }
+
+    // To consider the sum of the empty subarray
+    // uncomment the following check:
+
+    //if (maxi < 0) maxi = 0;
+
+    return maxi;
+}
+
+const arr = [-2, 1, -3, 4, -1, 2, 1, -5, 4];
+const n = arr.length;
+const maxSum = maxSubarraySum(arr, n);
+console.log("The maximum subarray sum is: " + maxSum);
+
diff --git a/DSA/Arrays/Maximumsubarray.js b/DSA/Arrays/Maximumsubarray.js
new file mode 100644
index 0000000..f3a7a8b
--- /dev/null
+++ b/DSA/Arrays/Maximumsubarray.js
@@ -0,0 +1,18 @@
+const maxSubArray = (nums) => {
+    // initiate two variable, maxSum for total max, sum for current max
+    let maxSum = -Infinity
+    let currentSum = 0
+    // iterate through the nums, store sub-problems result
+    for(let i = 0; i < nums.length; i++){ 
+        //cumulating answers to the top
+        
+        //compare currentSum add current number 
+        //with current number and store the maximum value
+        currentSum = Math.max(nums[i], currentSum + nums[i])
+        
+        //compare maxSum with currentSum and store the greater value
+        maxSum = Math.max(currentSum, maxSum)
+        
+    }
+    return maxSum
+}
\ No newline at end of file
diff --git a/DSA/Arrays/RadixSort.js b/DSA/Arrays/RadixSort.js
new file mode 100644
index 0000000..e4f1b5b
--- /dev/null
+++ b/DSA/Arrays/RadixSort.js
@@ -0,0 +1,43 @@
+const arr = [121, 432, 564, 23, 1, 45, 788];
+const countingSort = (arr, size, place) => {
+  
+  let output = new Array(size + 1).fill(0);
+  let max = Math.max(...arr);
+  
+  let freq = new Array(max + 1).fill(0);
+  
+  
+  for (let i = 0; i < size; i++){
+      const num = Math.floor(arr[i] / place) % 10;
+      freq[num]++;
+  }
+  
+  
+  for (let i = 1; i < 10; i++){
+      freq[i] += freq[i - 1];
+  }
+
+ 
+  for (let i = size - 1; i >= 0; i--) {
+      const num = Math.floor(arr[i] / place) % 10;
+      output[freq[num] - 1] = arr[i];
+      freq[num]--;
+  }
+  
+ 
+  for (let i = 0; i < size; i++){
+    arr[i] = output[i];
+  }
+}
+
+const radixSort = (arr, size = arr.length) => {
+ 
+  let max = Math.max(...arr);
+  
+ 
+  for(let i = 1; parseInt(max / i) > 0; i *= 10){
+    countingSort(arr, size, i);
+  }
+}
+radixSort(arr);
+console.log(arr);
\ No newline at end of file
diff --git a/DSA/Arrays/SelectionSort.js b/DSA/Arrays/SelectionSort.js
new file mode 100644
index 0000000..b1809bf
--- /dev/null
+++ b/DSA/Arrays/SelectionSort.js
@@ -0,0 +1,17 @@
+function selectionSort(arr) {
+    for (let i = 0; i < arr.length - 1; i++) {
+        let min_index = i;
+        for (let j = i + 1; j < arr.length; j++) {
+            if (arr[j] < arr[min_index]) { // Changed the comparison to sort in ascending order
+                min_index = j;
+            }
+        }
+        let temp = arr[min_index];
+        arr[min_index] = arr[i];
+        arr[i] = temp;
+    }
+    return arr;
+}
+
+let arr = [4, 12, 10, 15, 2];
+console.log(selectionSort(arr)); // Output: [2, 4, 10, 12, 15]
diff --git a/DSA/Arrays/SpecialArrayWithXElementsGreaterThanEqualToX.js b/DSA/Arrays/SpecialArrayWithXElementsGreaterThanEqualToX.js
new file mode 100644
index 0000000..7f83952
--- /dev/null
+++ b/DSA/Arrays/SpecialArrayWithXElementsGreaterThanEqualToX.js
@@ -0,0 +1,29 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var specialArray = function(nums) {
+    for (let i = 0; i <= nums.length; i++) {
+        let count = 0;
+        for (let j = 0; j < nums.length; j++) {
+            if (nums[j] >= i) {
+                count++;
+            }
+        }
+        if (count === i) {
+            return i;
+        }
+    }
+    return -1;
+};
+
+// Define an additional function to find the maximum value in the array.
+function findMaxValue(nums) {
+    return Math.max(...nums);
+}
+
+// Export the specialArray function and the findMaxValue function.
+module.exports = {
+    specialArray,
+    findMaxValue
+};
diff --git a/DSA/BFS/waterJug.js b/DSA/BFS/waterJug.js
new file mode 100644
index 0000000..6d887d0
--- /dev/null
+++ b/DSA/BFS/waterJug.js
@@ -0,0 +1,135 @@
+// Defining constants. 
+const ACTION_FILL_X = -1
+const ACTION_FILL_Y = -2
+const ACTION_EMPTY_X = -3
+const ACTION_EMPTY_Y = -4
+const ACTION_POUR_FILL_X = -5
+const ACTION_POUR_FILL_Y = -6
+const ACTION_POUR_EMPTY_X = -7
+const ACTION_POUR_EMPTY_Y = -8
+
+function getChildren(node, m, n) {
+  const results = [];
+  const {x, y} = node.state;
+  if (x < m)
+    results.push({
+      x: m,
+      y,
+      action: ACTION_FILL_X
+    });
+  if (y < n)
+    results.push({
+      x,
+      y: n,
+      action: ACTION_FILL_Y
+    });
+  if (x > 0)
+    results.push({
+      x: 0,
+      y,
+      action: ACTION_EMPTY_X
+    });
+  if (y > 0)
+    results.push({
+      x,
+      y: 0,
+      action: ACTION_EMPTY_Y
+    });
+  if (x + y >= m && y > 0)
+    results.push({
+      x: m,
+      y: x + y - m,
+      action: ACTION_POUR_FILL_X
+    });
+  if (x + y >= n && x > 0)
+    results.push({
+      x: x + y - n,
+      y: n,
+      action: ACTION_POUR_FILL_Y
+    });
+  if (x + y <= m && y >= 0)
+    results.push({
+      x: x + y,
+      y: 0,
+      action: ACTION_POUR_EMPTY_Y
+    });
+  if (x + y <= n && x >= 0)
+    results.push({
+      x: 0,
+      y: x + y,
+      action: ACTION_POUR_EMPTY_X
+    });
+  return results;
+}
+
+function solve(m, n, d) {
+  // The final state to achieve.
+  const goal = { x: d, y: 0 };
+  // Starting from the topmost row of the matrix.
+  // Initiating the first state and node
+  const initialState = {
+    x: 0,
+    y: 0
+  };
+  const initialNode = {
+    state: initialState,
+    parent: null,
+    action: null,
+  };
+  // For BFS, we use a Queue data type, FIFO.
+  let frontier = [initialNode];
+
+  while (frontier.length != 0) {
+    // Getting the first node in the frontier.
+    const node = frontier[0];
+    frontier = frontier.slice(1);
+    // Checking if the node represents an element in the last row.
+    // If so, then add it to the goal state list and continue.
+    if (node.state.x == goal.x) {
+      printSolution(node);
+      break;
+    }
+
+    // If it is not the goal state, we can get certain actions we can perform.
+    // Get all available actions the current node have.
+    const children = getChildren(node, m, n);
+
+    for (let j = 0; j < children.length; j++) {
+      const result = children[j];
+      const childState = {
+        x: result.x,
+        y: result.y,
+      };
+      const child = {
+        state: childState,
+        parent: node,
+        action: result.action,
+      };
+      // Add this node to the frontier.
+      frontier.push(child);
+    }
+  }
+}
+
+function printSolution(node) {
+  const nodes = [];
+  while (node.parent != null) {
+    nodes.push(node);
+    node = node.parent;
+  }
+  nodes.push(node);
+  nodes.reverse();
+  let answer = "{";
+  for (let i = 0; i < nodes.length; i++) {
+    answer += `(${nodes[i].state.x}, ${nodes[i].state.y})`;
+    if (i !== nodes.length - 1)
+      answer += ', ';
+  }
+  answer += "}";
+  console.log(answer);
+}
+
+(() => {
+  const [m, n, d] = [4, 3, 2];
+  solve(m, n, d);
+})();
\ No newline at end of file
diff --git a/DSA/BinarySearch/FindFirstAndLastPositionInASortedArray.js b/DSA/BinarySearch/FindFirstAndLastPositionInASortedArray.js
new file mode 100644
index 0000000..86cd1f3
--- /dev/null
+++ b/DSA/BinarySearch/FindFirstAndLastPositionInASortedArray.js
@@ -0,0 +1,41 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number[]}
+ */
+ var searchRange = function(arr, target) {
+    let firstPosition = -1;
+    let lastPosition = -1;
+    
+    let start = 0;
+    let end = arr.length - 1;
+    let mid;
+    
+    while(start <= end){
+        mid = end - parseInt((end - start)/2)
+        if(arr[mid] === target){
+            firstPosition = mid;
+            end = mid - 1
+        }else if (arr[mid] < target){
+            start = mid + 1
+        }else{
+            end = mid - 1
+        }
+    }
+    start = 0;
+    end = arr.length - 1;
+    
+    while(start <= end){
+        mid = end - parseInt((end - start)/2)
+        if(arr[mid] === target){
+            lastPosition = mid;
+            start = mid + 1
+        }else if (arr[mid] < target){
+            start = mid + 1
+        }else{
+            end = mid - 1
+        }
+    }
+    return [firstPosition, lastPosition]
+    
+};
\ No newline at end of file
diff --git a/DSA/BinarySearch/FindTheElementGivenPosition in linklist b/DSA/BinarySearch/FindTheElementGivenPosition in linklist
new file mode 100644
index 0000000..a558266
--- /dev/null
+++ b/DSA/BinarySearch/FindTheElementGivenPosition in linklist	
@@ -0,0 +1,60 @@
+class Node {
+  constructor(data) {
+    this.data = data;
+    this.next = null;
+  }
+}
+
+class LinkedList {
+  constructor() {
+    this.head = null;
+  }
+
+  append(data) {
+    const newNode = new Node(data);
+
+    if (!this.head) {
+      this.head = newNode;
+    } else {
+      let current = this.head;
+      while (current.next) {
+        current = current.next;
+      }
+      current.next = newNode;
+    }
+  }
+
+  findNodeAtPosition(position) {
+    if (position < 0 || !this.head) {
+      return null; // Position is out of bounds or the list is empty
+    }
+
+    let current = this.head;
+    let index = 0;
+
+    while (current) {
+      if (index === position) {
+        return current;
+      }
+      current = current.next;
+      index++;
+    }
+
+    return null;
+  }
+}
+const linkedList = new LinkedList();
+linkedList.append(10);
+linkedList.append(20);
+linkedList.append(30);
+linkedList.append(40);
+linkedList.append(50);
+
+const positionToFind = 4; 
+const node = linkedList.findNodeAtPosition(positionToFind);
+
+if (node) {
+  console.log(`Node at position ${positionToFind} contains data: ${node.data}`);
+} else {
+  console.log(`Node at position ${positionToFind} not found.`);
+}
diff --git a/DSA/BinarySearch/Sqrtx.js b/DSA/BinarySearch/Sqrtx.js
new file mode 100644
index 0000000..891b069
--- /dev/null
+++ b/DSA/BinarySearch/Sqrtx.js
@@ -0,0 +1,26 @@
+/**
+ * @param {number} x
+ * @return {number}
+ */
+
+// function to calculate square root of a number using binary search
+ var mySqrt = function(x) {
+    let start = 1;
+    let end = x;
+    let mid;
+    let res = 0
+    
+    while(start <= end){
+        mid = end - parseInt((end - start)/2)
+        console.log(mid)
+        if(mid*mid <= x){
+            res = mid;
+            start = mid + 1
+        }else{
+            end = mid - 1;
+        }
+    }
+    return res 
+    
+    
+};
\ No newline at end of file
diff --git a/DSA/BinarySearch/findElementInRotatedSortedArray.js b/DSA/BinarySearch/findElementInRotatedSortedArray.js
new file mode 100644
index 0000000..4ff4e5c
--- /dev/null
+++ b/DSA/BinarySearch/findElementInRotatedSortedArray.js
@@ -0,0 +1,57 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+ var search = function(nums, target) {
+    function binarySearch(arr, start, end, target){
+        let mid;
+        while(start <= end){
+            mid = end - parseInt((end - start)/2)
+            if(arr[mid] === target){
+                return mid;
+            }else if(arr[mid] < target){
+                start = mid + 1
+            }else{
+                end = mid - 1
+            }
+        }
+        return -1
+    }
+    function findMin(arr){
+        let start = 0;
+        let end = arr.length-1
+        let N = arr.length;
+        let res = -1;
+        
+        while(start <= end){
+            if(arr[start] <= arr[end]){
+                 return start;
+            }
+            mid = end - parseInt((end-start)/2)
+            if(arr[mid] <= arr[(mid+1) % N] && arr[mid] <= arr[(mid+ N -1)%N]) {
+               res = mid;
+               break;
+            } 
+            if(arr[mid] >= arr[start]){
+                start = mid + 1
+            } else if (arr[mid] <= arr[end]){
+                end = mid - 1
+            }
+        }
+        return res
+    }
+    
+    let minimumIndex = findMin(nums);
+    
+    
+    let res1 = binarySearch(nums, minimumIndex, nums.length, target);
+    let res2 = binarySearch(nums, 0, minimumIndex - 1, target);
+    
+    if(res1 !== -1){
+        return res1;
+    }
+    return res2
+};
+
+// cool stuff
\ No newline at end of file
diff --git a/DSA/BinarySearch/firstBadVersion.js b/DSA/BinarySearch/firstBadVersion.js
new file mode 100644
index 0000000..175b8d5
--- /dev/null
+++ b/DSA/BinarySearch/firstBadVersion.js
@@ -0,0 +1,36 @@
+/**
+ * Definition for isBadVersion()
+ * 
+ * @param {integer} version number
+ * @return {boolean} whether the version is bad
+ * isBadVersion = function(version) {
+ *     ...
+ * };
+ */
+
+/**
+ * @param {function} isBadVersion()
+ * @return {function}
+ */
+ var solution = function(isBadVersion) {
+    /**
+     * @param {integer} n Total versions
+     * @return {integer} The first bad version
+     */
+    return function(n) {
+        let start = 1;
+        let end = n;
+        let mid;
+        let res = -1;
+        while(start <= end){
+            mid = end - parseInt((end - start)/2)
+            if(isBadVersion(mid)){
+                res = mid;
+                end = mid - 1;
+            }else{
+                start = mid + 1;
+            }
+        }
+        return res    
+    };
+};
\ No newline at end of file
diff --git a/DSA/BinarySearch/guessNumber.js b/DSA/BinarySearch/guessNumber.js
new file mode 100644
index 0000000..7bb6ddd
--- /dev/null
+++ b/DSA/BinarySearch/guessNumber.js
@@ -0,0 +1,29 @@
+/** 
+ * Forward declaration of guess API.
+ * @param {number} num   your guess
+ * @return 	            -1 if num is lower than the guess number
+ *			             1 if num is higher than the guess number
+ *                       otherwise return 0
+ * var guess = function(num) {}
+ */
+
+/**
+ * @param {number} n
+ * @return {number}
+ */
+ var guessNumber = function(n) {
+    let start = 1;
+    let end = n;
+    let mid;
+    
+    while(start <= end){
+        mid = end - parseInt((end - start)/2)
+        if(guess(mid) === 0){
+            return mid
+        }else if(guess(mid) === -1){
+            end = mid - 1;
+        }else{
+            start = mid + 1
+        }
+    }
+};
\ No newline at end of file
diff --git a/DSA/BinarySearch/minimumDifferenceElementInSortedArray.js b/DSA/BinarySearch/minimumDifferenceElementInSortedArray.js
new file mode 100644
index 0000000..b5448f5
--- /dev/null
+++ b/DSA/BinarySearch/minimumDifferenceElementInSortedArray.js
@@ -0,0 +1,17 @@
+function minimumDifference(arr, target){
+    let start = 0;
+    let end = arr.length - 1;
+    let mid;
+    while(start <= end){
+        mid = end - parseInt((end-start)/2)
+        if(arr[mid] === target){
+            return arr[mid];
+        }
+        else if(arr[mid] < target){
+            start = mid + 1
+        }else{
+            end = mid - 1
+        }
+    }
+    return Math.min(Math.abs(arr[start] - target), Math.abs(arr[end] - target))
+}
\ No newline at end of file
diff --git a/DSA/BinarySearch/searchInsertPosition.js b/DSA/BinarySearch/searchInsertPosition.js
new file mode 100644
index 0000000..64a68d1
--- /dev/null
+++ b/DSA/BinarySearch/searchInsertPosition.js
@@ -0,0 +1,24 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+ var searchInsert = function(nums, target) {
+    let start = 0;
+    let end = nums.length - 1;
+    let mid;
+    let res = nums.length;
+    while(start <= end){
+        mid = end - parseInt((end - start)/2)
+        if(nums[mid] === target){
+            return mid
+        }else if(nums[mid] > target){
+            res = mid;
+            end = mid - 1;
+        }else{
+            start = mid + 1;
+        }
+    }
+    return res;
+    
+};
\ No newline at end of file
diff --git a/DSA/DFS/BinaryTreePaths.js b/DSA/DFS/BinaryTreePaths.js
new file mode 100644
index 0000000..a99c1c0
--- /dev/null
+++ b/DSA/DFS/BinaryTreePaths.js
@@ -0,0 +1,18 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+var binaryTreePaths = function(root) {
+    let allAr = [];
+    getPath(root);
+    function getPath(node,arr=[]){
+        (!node.left && !node.right) &&allAr.push([...arr, node.val]);        
+        node.left && getPath(node.left, [...arr,node.val]);
+        node.right && getPath(node.right, [...arr,node.val]);      
+    }
+    return allAr.map((a)=>a.join('->'));
+};
diff --git a/DSA/DFS/Diameter of Binary Tree b/DSA/DFS/Diameter of Binary Tree
new file mode 100644
index 0000000..6ee879c
--- /dev/null
+++ b/DSA/DFS/Diameter of Binary Tree	
@@ -0,0 +1,24 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+var diameterOfBinaryTree = function(root) {
+    let result = 0;
+    helper(root);
+    return result
+    
+    function helper(root){
+        if(!root)return 0;
+        
+        let left = helper(root.left);
+        let right = helper(root.right);
+        
+        result = Math.max(left + right , result);
+        
+        return 1 + Math.max(left, right)
+    }
+};
diff --git a/DSA/DFS/Find Mode in Binary Search Tree.js b/DSA/DFS/Find Mode in Binary Search Tree.js
new file mode 100644
index 0000000..1f77f2c
--- /dev/null
+++ b/DSA/DFS/Find Mode in Binary Search Tree.js	
@@ -0,0 +1,28 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+var findMode = function(r) {
+  const map = new Map()
+  const maxMap = new Map()
+  let max = -Infinity
+  
+  function dfs(root){
+    if(!root) return
+    map.set(root.val, (map.get(root.val) || 0) + 1)
+      if(map.get(root.val) >= max){
+        max = map.get(root.val)
+        if(!maxMap.get(max)) maxMap.set(max, new Set())
+        maxMap.get(max).add(root.val)
+      }    
+    dfs(root.left)
+    dfs(root.right)
+  } 
+  
+  dfs(r)
+  return [...maxMap.get(max)]
+};
diff --git a/DSA/DFS/InvertBinaryTree.js b/DSA/DFS/InvertBinaryTree.js
new file mode 100644
index 0000000..6491180
--- /dev/null
+++ b/DSA/DFS/InvertBinaryTree.js
@@ -0,0 +1,16 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+
+var invertTree = function(root) {
+     if(!root) {
+        return null;
+    }
+    [root.left, root.right] = [invertTree(root.right), invertTree(root.left)];
+    return root;
+};
diff --git a/DSA/DFS/KthSmallestElementInABST.js b/DSA/DFS/KthSmallestElementInABST.js
new file mode 100644
index 0000000..6179420
--- /dev/null
+++ b/DSA/DFS/KthSmallestElementInABST.js
@@ -0,0 +1,21 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+var kthSmallest = function(root, k) {
+    let arrayOfElements = []
+
+    function dfs(node) {
+        if(!node) return;
+    
+        dfs(node.left);
+        arrayOfElements.push(node.val);
+        dfs(node.right);
+    }
+    dfs(root);
+    return arrayOfElements[k - 1];
+};
diff --git a/DSA/DFS/LowestCommonAncestorOfABinarySearchTree.js b/DSA/DFS/LowestCommonAncestorOfABinarySearchTree.js
new file mode 100644
index 0000000..a9320f7
--- /dev/null
+++ b/DSA/DFS/LowestCommonAncestorOfABinarySearchTree.js
@@ -0,0 +1,37 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+var lowestCommonAncestor = function(root, p, q) {
+
+let ansNode = null
+if(p.val == root.val || q.val == root.val){
+    return root
+}
+function traverse(node){
+    if((p.val < node.val && q.val > node.val) || (p.val > node.val && q.val < node.val)){
+        ansNode = node
+        return    
+    }
+    else if(p.val == node.val || q.val == node.val){
+        ansNode = node
+        return
+    }
+    if(node.left)
+        traverse(node.left)
+    if(node.right)
+        traverse(node.right)
+}
+
+if((p.val < root.val && q.val > root.val) || (p.val > root.val && q.val < root.val))
+    return root
+else if(p.val > root.val && q.val > root.val)
+    traverse(root.right)
+else if(p.val < root.val && q.val < root.val)
+    traverse(root.left)
+
+return ansNode
+};
diff --git a/DSA/DFS/SameTree.js b/DSA/DFS/SameTree.js
new file mode 100644
index 0000000..936e6ad
--- /dev/null
+++ b/DSA/DFS/SameTree.js
@@ -0,0 +1,20 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+var isSameTree = function(p, q) {
+    return is_tree_equal(p, q);
+    function is_tree_equal(tree1, tree2){
+        if (tree1 === null && tree2 === null) return true;
+        if (tree1 === null || tree2 === null) return false;
+        if (tree1.val !== tree2.val) return false;
+        
+        const is_left_tree_equal  = is_tree_equal(tree1.left, tree2.left)
+        const is_right_tree_equal = is_tree_equal(tree1.right, tree2.right)
+        return is_left_tree_equal && is_right_tree_equal
+    }
+};
diff --git a/DSA/DFS/SymmetricTree.js b/DSA/DFS/SymmetricTree.js
new file mode 100644
index 0000000..fb7a863
--- /dev/null
+++ b/DSA/DFS/SymmetricTree.js
@@ -0,0 +1,29 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+var isSymmetric = function(root) {
+if(!root.left && !root.right)
+    return true
+if((root.left && !root.right) || (!root.left && root.right))
+    return false
+let ans = true
+function traverse(nodeL,nodeR){
+    if(nodeL.val != nodeR.val)
+        ans = false
+    if(nodeL.left && nodeR.right)
+        traverse(nodeL.left,nodeR.right)
+    else if((!nodeL.left && nodeR.right) || (nodeL.left && !nodeR.right))
+        ans = false
+    if(nodeL.right && nodeR.left)
+        traverse(nodeL.right, nodeR.left)
+    else if((!nodeL.right && nodeR.left) || (nodeL.right && !nodeR.left))
+        ans = false
+}
+traverse(root.left,root.right)
+return ans
+};
diff --git a/DSA/DFS/lowest-common-ancestor-of-a-binary-tree.js b/DSA/DFS/lowest-common-ancestor-of-a-binary-tree.js
new file mode 100644
index 0000000..4c99d9d
--- /dev/null
+++ b/DSA/DFS/lowest-common-ancestor-of-a-binary-tree.js
@@ -0,0 +1,24 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+var lowestCommonAncestor = function(root, p, q) {
+     if(!root) {
+        return null;
+    }
+    const left = lowestCommonAncestor(root.left, p, q),
+          right = lowestCommonAncestor(root.right, p, q);
+    if((left && right) || root.val === p.val || root.val === q.val) {
+        return root;
+    } 
+    else if(left) {    
+        return left;
+    } 
+    else if(right) { 
+        return right;
+    }
+    return null;
+};
diff --git a/DSA/DFS/maximumSumDownAMatrix.js b/DSA/DFS/maximumSumDownAMatrix.js
new file mode 100644
index 0000000..eb1ce15
--- /dev/null
+++ b/DSA/DFS/maximumSumDownAMatrix.js
@@ -0,0 +1,146 @@
+/*
+ * This is a simple Depth-First Search Algorithm.
+ *
+ * You are provided with a square matrix with integer values.
+ * The task is to find the maximum sum using the integers in the matrix,
+ * starting from the first row and ending in the last row, such that you
+ * can only move diagonally left or diagonally right.
+ * 
+ * If you have a 4x4 matrix:
+ * 1  7  3  6
+ * 1  2  9  4
+ * 9  8  5  7
+ * 4  5  2  1
+ * 
+ * The path that you will have to find is:
+ *    7
+ *       9
+ *    8
+ * 4
+ * 
+ * 7 + 9 + 8 + 4 = 28.
+ */
+
+
+// Defining constants. 
+const ACTION_RIGHT = 100;
+const ACTION_LEFT = -100;
+
+function getChildren(x, y, n) {
+  const results = [];
+  // Checking if the values aren't at the left edge of the matrix
+  if (x != n - 1 && y != 0) {
+    results.push({
+      x: x + 1,
+      y: y - 1,
+      action: ACTION_LEFT,
+    });
+  }
+  // Checking if the values aren't at the right edge of the matrix
+  if (x != n - 1 && y != n - 1) {
+    results.push({
+      x: x + 1,
+      y: y + 1,
+      action: ACTION_RIGHT,
+    });
+  }
+  return results;
+}
+
+function solve(matrix) {
+  // The list of nodes that are in the bottom of the matrix.
+  const goalList = [];
+  // Starting from the topmost row of the matrix.
+  for (let i = 0; i < matrix.length; i++) {
+    // Initiating the first state and node
+    const initialState = {
+      sum: matrix[0][i],
+      x: 0,
+      y: i,
+    };
+    const initialNode = {
+      state: initialState,
+      parent: null,
+      action: null,
+    };
+    // For DFS, we use a Stack data type, LIFO.
+    let frontier = [initialNode];
+
+    while (frontier.length != 0) {
+      // Getting the last node in the frontier.
+      const node = frontier.pop();
+      // Checking if the node represents an element in the last row.
+      // If so, then add it to the goal state list and continue.
+      if (node.state.x == matrix.length - 1) {
+        goalList.push(node);
+        continue;
+      }
+
+      // If it is not the goal state, we can get certain actions we can perform.
+      // Get all available actions the current node have.
+      const children = getChildren(node.state.x, node.state.y, matrix.length);
+
+      for (let j = 0; j < children.length; j++) {
+        const result = children[j];
+        // Record the cummulative sum and initialise a child state.
+        const newSum = node.state.sum + matrix[result.x][result.y];
+        const childState = {
+          sum: newSum,
+          x: result.x,
+          y: result.y,
+        };
+        const child = {
+          state: childState,
+          parent: node,
+          action: result.action,
+        };
+        // Add this state to the frontier.
+        frontier.push(child);
+      }
+    }
+  }
+
+  // After collecting all the goal states, sort them in decreasing order.
+  goalList.sort((n1, n2) => n2.state.sum - n1.state.sum);
+  // The first element with the sum will be the answer.
+  return goalList[0].state.sum;
+}
+
+function printMatrix(matrix) {
+  for (let i = 0; i < matrix.length; i++) {
+    let s = "";
+    for (let j = 0; j < matrix[i].length; j++) {
+      s += `${matrix[i][j]}\t`;
+    }
+    console.log(`\n${s}`);
+  }
+}
+
+(() => {
+  // Initial driver code.
+  const matrix = [
+    [5, 10, 75, 20, 76],
+    [4, 5, 8, 50, 32],
+    [80, 42, 0, 3, 4],
+    [82, 73, 7, 58, 45],
+    [45, 24, 13, 86, 0],
+  ];
+  printMatrix(matrix);
+  const answer = solve(matrix);
+  console.log(answer);
+})();
+
+/*
+ * Explanation:
+ * 
+ * State: it's the attributes that is required related to the problem.
+ * Action: it's the constant that defines how different nodes are connected.
+ * Node: it contains the current state, the action taken to reach that state, and the parent node.
+ * Frontier: A Stack which contains all the nodes and to be used while searching.
+ * 
+ * We start with the inital node in the frontier and start a loop.
+ * We pop out the last node and check if it is the goal state and perform some action.
+ * If it is not a goal state, we will get all available actions that node currently have and iterate through them.
+ * Using the actions, we will create successive states and add them to the frontier.
+ * This process will continue till the frontier is empty. Hence, we can perform some final code to get the answer.
+ */
\ No newline at end of file
diff --git a/DSA/DFS/minimum-distance-between-bst-nodes.js b/DSA/DFS/minimum-distance-between-bst-nodes.js
new file mode 100644
index 0000000..a931a50
--- /dev/null
+++ b/DSA/DFS/minimum-distance-between-bst-nodes.js
@@ -0,0 +1,26 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+var minDiffInBST = function(root) {
+    let min = Number.MAX_VALUE
+let arr = []
+function traverse(node){
+    if(node.left)
+        traverse(node.left)
+    arr.push(node.val)
+    if(node.right)
+        traverse(node.right)
+}
+traverse(root)
+for(let i = arr.length - 1 ; i > 0 ; i--){
+    if(arr[i] - arr[i-1] < min){
+        min = arr[i] - arr[i-1]
+    }
+}
+return min
+};
diff --git a/DSA/DFS/validateBinaryTree.js b/DSA/DFS/validateBinaryTree.js
new file mode 100644
index 0000000..60f49ea
--- /dev/null
+++ b/DSA/DFS/validateBinaryTree.js
@@ -0,0 +1,17 @@
+var isValidBST = function (root) {
+
+
+    function helper(node, min, max) {
+        if (!node) return true;
+
+        if (node.val <= min || node.val >= max) return false;
+
+        let left = helper(node.left, min, node.val);
+        let right = helper(node.right, node.val, max)
+
+        return left && right
+
+    }
+
+    return helper(root, -Infinity, Infinity)
+};
\ No newline at end of file
diff --git a/DSA/Graphs/DijkstraAlgorithm.js b/DSA/Graphs/DijkstraAlgorithm.js
new file mode 100644
index 0000000..534c848
--- /dev/null
+++ b/DSA/Graphs/DijkstraAlgorithm.js
@@ -0,0 +1,73 @@
+const graphInfo = {
+    source: {A: 4, B: 1},
+    A: {C: 3, D: 5},
+    B: {A: 7, D: 2},
+    C: {D: 4, destination: 3},
+    D: {destination: 2},
+    destination: {}
+  };
+  
+  // primary function
+  const dijkstra = (graph) => {
+  
+    // shortest distance to each vertex
+    const distance = Object.assign(
+        {destination: Infinity}, graph.source);
+  
+    // display path
+    const parentArray = {destination: null};
+    for (let child in graph.source) {
+      parentArray[child] = 'source';
+    }
+  
+    // track vertexs that are marked
+    const marked = [];
+  
+    let vertex = minimumDistancevertex(distance, marked);
+  
+    while (vertex) {
+      let cost = distance[vertex];
+      let children = graph[vertex];
+      for (let n in children) {
+        let latestDistance = cost + children[n];
+        if (!distance[n]) {
+          distance[n] = latestDistance;
+          parentArray[n] = vertex;
+        }
+        if (distance[n] > latestDistance) {
+          distance[n] = latestDistance;
+          parentArray[n] = vertex;
+        }
+      }
+      marked.push(vertex);
+      vertex = minimumDistancevertex(distance, marked);
+    }
+  
+    let shortestPath = ['destination'];
+    let parent = parentArray.destination;
+    while (parent) {
+      shortestPath.push(parent);
+      parent = parentArray[parent];
+    }
+    shortestPath.reverse();
+  
+    const result = {
+      distance: distance.destination,
+      path: shortestPath
+    };
+  
+    return result;
+  };
+
+  const minimumDistancevertex = (distance, marked) => {
+    return Object.keys(distance).reduce((lowest, vertex) => {
+      if (lowest === null || distance[vertex] < distance[lowest]) {
+        if (!marked.includes(vertex)) {
+          lowest = vertex;
+        }
+      }
+      return lowest;
+    }, null);
+  };
+
+  console.log(dijkstra(graphInfo));
\ No newline at end of file
diff --git a/DSA/Graphs/Kruskal Algorithm b/DSA/Graphs/Kruskal Algorithm
new file mode 100644
index 0000000..8080866
--- /dev/null
+++ b/DSA/Graphs/Kruskal Algorithm	
@@ -0,0 +1,43 @@
+class UnionFind {
+   constructor(elements) {
+      // Number of disconnected components
+      this.count = elements.length;
+
+      // Keep Track of connected components
+      this.parent = {};
+
+      // Initialize the data structure such that all
+      // elements have themselves as parents
+      elements.forEach(e => (this.parent[e] = e));
+   }
+
+   union(a, b) {
+      let rootA = this.find(a);
+      let rootB = this.find(b);
+
+      // Roots are same so these are already connected.
+      if (rootA === rootB) return;
+
+      // Always make the element with smaller root the parent.
+      if (rootA < rootB) {
+         if (this.parent[b] != b) this.union(this.parent[b], a);
+         this.parent[b] = this.parent[a];
+      } else {
+         if (this.parent[a] != a) this.union(this.parent[a], b);
+         this.parent[a] = this.parent[b];
+      }
+   }
+
+   // Returns final parent of a node
+   find(a) {
+      while (this.parent[a] !== a) {
+         a = this.parent[a];
+      }
+      return a;
+   }
+
+   // Checks connectivity of the 2 nodes
+   connected(a, b) {
+      return this.find(a) === this.find(b);
+   }
+}
diff --git a/DSA/Graphs/Maze.js b/DSA/Graphs/Maze.js
new file mode 100644
index 0000000..d33ef15
--- /dev/null
+++ b/DSA/Graphs/Maze.js
@@ -0,0 +1,209 @@
+const maze = [
+    ['S', 0, 1, 0, 1],
+    [0, 1, 0, 0, 0],
+    [0, 0, 1, 1, 0],
+    [1, 0, 0, 0, 'E'],
+];
+
+
+function solveMazeDFS(maze) {
+    const rows = maze.length;
+    const cols = maze[0].length;
+
+    function dfs(x, y) {
+        if (x < 0 || x >= rows || y < 0 || y >= cols || maze[x][y] === 1) {
+            return false;
+        }
+
+        if (maze[x][y] === 'E') {
+            return true; // Reached the end of the maze
+        }
+
+        maze[x][y] = 1; // Mark as visited
+
+        // Explore in all four directions (up, down, left, right)
+        if (dfs(x + 1, y) || dfs(x - 1, y) || dfs(x, y + 1) || dfs(x, y - 1)) {
+            return true;
+        }
+
+        maze[x][y] = 0; // Mark as unvisited if no path was found
+        return false;
+    }
+
+    // Find the start point
+    let startX, startY;
+    for (let i = 0; i < rows; i++) {
+        for (let j = 0; j < cols; j++) {
+            if (maze[i][j] === 'S') {
+                startX = i;
+                startY = j;
+                break;
+            }
+        }
+    }
+
+    // Call DFS from the start point
+    if (dfs(startX, startY)) {
+        return "Maze is solvable.";
+    } else {
+        return "Maze has no solution.";
+    }
+}
+
+console.log(solveMazeDFS(maze));
+
+
+
+
+function solveMazeBFS(maze) {
+    const rows = maze.length;
+    const cols = maze[0].length;
+    const queue = [];
+
+    // Find the start point
+    let startX, startY;
+    for (let i = 0; i < rows; i++) {
+        for (let j = 0; j < cols; j++) {
+            if (maze[i][j] === 'S') {
+                startX = i;
+                startY = j;
+                break;
+            }
+        }
+    }
+
+    // Define possible moves (up, down, left, right)
+    const moves = [[1, 0], [-1, 0], [0, 1], [0, -1]];
+
+    queue.push([startX, startY]);
+
+    while (queue.length > 0) {
+        const [x, y] = queue.shift();
+
+        if (maze[x][y] === 'E') {
+            return "Maze is solvable.";
+        }
+
+        maze[x][y] = 1; // Mark as visited
+
+        for (const [dx, dy] of moves) {
+            const newX = x + dx;
+            const newY = y + dy;
+
+            if (newX >= 0 && newX < rows && newY >= 0 && newY < cols && maze[newX][newY] === 0) {
+                queue.push([newX, newY]);
+            }
+        }
+    }
+
+    return "Maze has no solution.";
+}
+
+console.log(solveMazeBFS(maze));
+
+
+class PriorityQueue {
+    constructor() {
+        this.elements = [];
+    }
+
+    enqueue(element, priority) {
+        this.elements.push({ element, priority });
+        this.elements.sort((a, b) => a.priority - b.priority);
+    }
+
+    dequeue() {
+        return this.elements.shift().element;
+    }
+
+    isEmpty() {
+        return this.elements.length === 0;
+    }
+}
+
+function heuristic(x1, y1, x2, y2) {
+    // A simple heuristic function (Manhattan distance)
+    return Math.abs(x1 - x2) + Math.abs(y1 - y2);
+}
+
+function solveMazeAStar(maze) {
+    const rows = maze.length;
+    const cols = maze[0].length;
+
+    // Find the start and end points
+    let startX, startY, endX, endY;
+    for (let i = 0; i < rows; i++) {
+        for (let j = 0; j < cols; j++) {
+            if (maze[i][j] === 'S') {
+                startX = i;
+                startY = j;
+            } else if (maze[i][j] === 'E') {
+                endX = i;
+                endY = j;
+            }
+        }
+    }
+
+    const openSet = new PriorityQueue();
+    openSet.enqueue({ x: startX, y: startY, cost: 0 }, 0);
+
+    const cameFrom = {};
+    const gScore = {};
+
+    gScore[`${startX}-${startY}`] = 0;
+
+    while (!openSet.isEmpty()) {
+        const current = openSet.dequeue();
+        const { x, y } = current;
+
+        if (x === endX && y === endY) {
+            // Reconstruct the path
+            const path = [];
+            let currentNode = { x: endX, y: endY };
+            while (currentNode) {
+                path.unshift(currentNode);
+                currentNode = cameFrom[`${currentNode.x}-${currentNode.y}`];
+            }
+            return path;
+        }
+
+        for (const [dx, dy] of [[1, 0], [-1, 0], [0, 1], [0, -1]]) {
+            const newX = x + dx;
+            const newY = y + dy;
+
+            if (
+                newX >= 0 &&
+                newX < rows &&
+                newY >= 0 &&
+                newY < cols &&
+                maze[newX][newY] !== 1
+            ) {
+                const tentativeGScore = gScore[`${x}-${y}`] + 1;
+
+                if (
+                    !gScore[`${newX}-${newY}`] ||
+                    tentativeGScore < gScore[`${newX}-${newY}`]
+                ) {
+                    cameFrom[`${newX}-${newY}`] = { x, y };
+                    gScore[`${newX}-${newY}`] = tentativeGScore;
+                    const fScore =
+                        tentativeGScore + heuristic(newX, newY, endX, endY);
+                    openSet.enqueue({ x: newX, y: newY, cost: fScore }, fScore);
+                }
+            }
+        }
+    }
+
+    return "Maze has no solution.";
+}
+
+const path = solveMazeAStar(maze);
+
+if (path !== "Maze has no solution.") {
+    console.log("Path found:");
+    path.forEach((cell, index) => {
+        console.log(`Step ${index + 1}: (${cell.x}, ${cell.y})`);
+    });
+} else {
+    console.log("Maze has no solution.");
+}
diff --git a/DSA/Graphs/Prim'sAlgorithm.js b/DSA/Graphs/Prim'sAlgorithm.js
new file mode 100644
index 0000000..0201e0c
--- /dev/null
+++ b/DSA/Graphs/Prim'sAlgorithm.js
@@ -0,0 +1,53 @@
+primsMST() {
+   // Initialize graph that'll contain the MST
+   const MST = new Graph();
+   if (this.nodes.length === 0) {
+      return MST;
+   }
+
+
+   // Select first node as starting node
+   let s = this.nodes[0];
+
+
+   // Create a Priority Queue and explored set
+   let edgeQueue = new PriorityQueue(this.nodes.length * this.nodes.length);
+   let explored = new Set();
+   explored.add(s);
+   MST.addNode(s);
+
+
+   // Add all edges from this starting node to the PQ taking weights as priority
+   this.edges[s].forEach(edge => {
+      edgeQueue.enqueue([s, edge.node], edge.weight);
+   });
+
+
+   // Take the smallest edge and add that to the new graph
+   let currentMinEdge = edgeQueue.dequeue();
+   while (!edgeQueue.isEmpty()) {
+
+
+      // Continue removing edges till we get an edge with an unexplored node
+      while (!edgeQueue.isEmpty() && explored.has(currentMinEdge.data[1])) {
+         currentMinEdge = edgeQueue.dequeue();
+      }
+      let nextNode = currentMinEdge.data[1];
+
+
+      // Check again as queue might get empty without giving back unexplored element
+      if (!explored.has(nextNode)) {
+         MST.addNode(nextNode);
+         MST.addEdge(currentMinEdge.data[0], nextNode, currentMinEdge.priority);
+         // Again add all edges to the PQ
+         this.edges[nextNode].forEach(edge => {
+            edgeQueue.enqueue([nextNode, edge.node], edge.weight);
+         });
+
+
+         // Mark this node as explored explored.add(nextNode);
+         s = nextNode;
+      }
+   }
+   return MST;
+}
diff --git a/DSA/Graphs/Travelling Salesman Problem/AntColonyOptimization.js b/DSA/Graphs/Travelling Salesman Problem/AntColonyOptimization.js
new file mode 100644
index 0000000..3096252
--- /dev/null
+++ b/DSA/Graphs/Travelling Salesman Problem/AntColonyOptimization.js	
@@ -0,0 +1,101 @@
+function antColonyOptimizationTSP(cities, distances, numAnts, maxIterations, pheromoneEvaporationRate, alpha, beta) {
+    const numCities = cities.length;
+    const initialPheromoneLevel = 1 / (numCities * numCities);
+    let pheromoneMatrix = Array.from({ length: numCities }, () =>
+        Array(numCities).fill(initialPheromoneLevel)
+    );
+    let bestOrder;
+    let bestDistance = Infinity;
+
+    for (let iteration = 0; iteration < maxIterations; iteration++) {
+        const antPaths = [];
+        for (let ant = 0; ant < numAnts; ant++) {
+            const path = constructAntPath(pheromoneMatrix, distances, alpha, beta);
+            antPaths.push(path);
+            const pathDistance = calculateTotalDistance(path, distances);
+            if (pathDistance < bestDistance) {
+                bestOrder = path;
+                bestDistance = pathDistance;
+            }
+        }
+
+        updatePheromoneMatrix(pheromoneMatrix, antPaths, pheromoneEvaporationRate);
+    }
+
+    return { order: bestOrder, distance: bestDistance };
+}
+
+function constructAntPath(pheromoneMatrix, distances, alpha, beta) {
+    const numCities = pheromoneMatrix.length;
+    const startCity = Math.floor(Math.random() * numCities);
+    let currentCity = startCity;
+    const path = [startCity];
+    const unvisitedCities = new Set([...Array(numCities).keys()].filter((i) => i !== startCity));
+
+    while (unvisitedCities.size > 0) {
+        const nextCity = chooseNextCity(currentCity, unvisitedCities, pheromoneMatrix, distances, alpha, beta);
+        path.push(nextCity);
+        unvisitedCities.delete(nextCity);
+        currentCity = nextCity;
+    }
+
+    return path;
+}
+
+function chooseNextCity(currentCity, unvisitedCities, pheromoneMatrix, distances, alpha, beta) {
+    const pheromoneLevels = [];
+    const totalProbability = [...unvisitedCities].reduce((sum, city) => {
+        const pheromone = pheromoneMatrix[currentCity][city];
+        const distance = distances[currentCity][city];
+        const probability = Math.pow(pheromone, alpha) * Math.pow(1 / distance, beta);
+        pheromoneLevels.push(probability);
+        return sum + probability;
+    }, 0);
+
+    const randomValue = Math.random() * totalProbability;
+    let accumulatedProbability = 0;
+
+    for (let i = 0; i < pheromoneLevels.length; i++) {
+        accumulatedProbability += pheromoneLevels[i];
+        if (accumulatedProbability >= randomValue) {
+            return [...unvisitedCities][i];
+        }
+    }
+
+    return [...unvisitedCities][0]; // Fallback in case of numerical instability
+}
+
+function updatePheromoneMatrix(pheromoneMatrix, antPaths, pheromoneEvaporationRate) {
+    const numCities = pheromoneMatrix.length;
+
+    // Evaporate pheromone
+    for (let i = 0; i < numCities; i++) {
+        for (let j = 0; j < numCities; j++) {
+            pheromoneMatrix[i][j] *= (1 - pheromoneEvaporationRate);
+        }
+    }
+
+    // Deposit pheromone based on ant paths
+    for (const path of antPaths) {
+        const pathDistance = calculateTotalDistance(path, distances);
+        for (let i = 0; i < path.length - 1; i++) {
+            const fromCity = path[i];
+            const toCity = path[i + 1];
+            pheromoneMatrix[fromCity][toCity] += 1 / pathDistance;
+            pheromoneMatrix[toCity][fromCity] += 1 / pathDistance;
+        }
+    }
+}
+
+// Test case
+const cities = ["A", "B", "C", "D"];
+const distances = [
+    [0, 10, 15, 20],
+    [10, 0, 35, 25],
+    [15, 35, 0, 30],
+    [20, 25, 30, 0],
+];
+
+const result = antColonyOptimizationTSP(cities, distances, 10, 100, 0.5, 1.0, 2.0);
+console.log("Ant Colony Optimization Order:", result.order.map((idx) => cities[idx]).join(" -> "));
+console.log("Ant Colony Optimization Distance:", result.distance);
diff --git a/DSA/Graphs/Travelling Salesman Problem/BranchAndBound.js b/DSA/Graphs/Travelling Salesman Problem/BranchAndBound.js
new file mode 100644
index 0000000..68e764e
--- /dev/null
+++ b/DSA/Graphs/Travelling Salesman Problem/BranchAndBound.js	
@@ -0,0 +1,50 @@
+function tspBranchAndBound(cities, distances) {
+    const n = cities.length;
+    const visited = new Array(n).fill(false);
+    visited[0] = true;
+    const initialPath = [0];
+    const { order, distance } = branchAndBoundHelper(0, initialPath, 0, Infinity);
+
+    function branchAndBoundHelper(currentCity, path, currentDistance, bestDistance) {
+        if (path.length === n) {
+            return { order: path, distance: currentDistance + distances[currentCity][0] };
+        }
+
+        let minDistance = bestDistance;
+        let minOrder = [];
+
+        for (let nextCity = 0; nextCity < n; nextCity++) {
+            if (!visited[nextCity]) {
+                visited[nextCity] = true;
+                const newPath = [...path, nextCity];
+                const newDistance = currentDistance + distances[currentCity][nextCity];
+
+                if (newDistance < minDistance) {
+                    const result = branchAndBoundHelper(nextCity, newPath, newDistance, minDistance);
+                    if (result.distance < minDistance) {
+                        minDistance = result.distance;
+                        minOrder = result.order;
+                    }
+                }
+
+                visited[nextCity] = false;
+            }
+        }
+
+        return { order: minOrder, distance: minDistance };
+    }
+
+    return { order, distance };
+}
+
+// Test case
+const cities = ["A", "B", "C"];
+const distances = [
+    [0, 10, 15],
+    [10, 0, 20],
+    [15, 20, 0],
+];
+
+const result = tspBranchAndBound(cities, distances);
+console.log("Branch and Bound Optimal Order:", result.order.map((idx) => cities[idx]).join(" -> "));
+console.log("Branch and Bound Optimal Distance:", result.distance);
diff --git a/DSA/Graphs/Travelling Salesman Problem/BruteForce.js b/DSA/Graphs/Travelling Salesman Problem/BruteForce.js
new file mode 100644
index 0000000..fdba98c
--- /dev/null
+++ b/DSA/Graphs/Travelling Salesman Problem/BruteForce.js	
@@ -0,0 +1,45 @@
+function permute(arr) {
+    if (arr.length === 0) return [[]];
+    const [first, ...rest] = arr;
+    const permutationsWithoutFirst = permute(rest);
+    return permutationsWithoutFirst.flatMap((perm) =>
+        perm.map((_, idx) => [...perm.slice(0, idx), first, ...perm.slice(idx)])
+    );
+}
+
+function calculateTotalDistance(order, distances) {
+    let totalDistance = 0;
+    for (let i = 0; i < order.length - 1; i++) {
+        totalDistance += distances[order[i]][order[i + 1]];
+    }
+    return totalDistance;
+}
+
+function bruteForceTSP(cities, distances) {
+    const cityIndices = Array.from({ length: cities.length }, (_, i) => i);
+    const permutations = permute(cityIndices);
+    let minDistance = Infinity;
+    let bestOrder = [];
+
+    for (const perm of permutations) {
+        const distance = calculateTotalDistance(perm, distances);
+        if (distance < minDistance) {
+            minDistance = distance;
+            bestOrder = perm;
+        }
+    }
+
+    return { order: bestOrder, distance: minDistance };
+}
+
+// Test case
+const cities = ["A", "B", "C"];
+const distances = [
+    [0, 10, 15],
+    [10, 0, 20],
+    [15, 20, 0],
+];
+
+const result = bruteForceTSP(cities, distances);
+console.log("Optimal Order:", result.order.map((idx) => cities[idx]).join(" -> "));
+console.log("Optimal Distance:", result.distance);
\ No newline at end of file
diff --git a/DSA/Graphs/Travelling Salesman Problem/ChristofidesAlgorithm.js b/DSA/Graphs/Travelling Salesman Problem/ChristofidesAlgorithm.js
new file mode 100644
index 0000000..1ea53c3
--- /dev/null
+++ b/DSA/Graphs/Travelling Salesman Problem/ChristofidesAlgorithm.js	
@@ -0,0 +1,127 @@
+function minimumSpanningTree(graph) {
+    const numVertices = graph.length;
+    const parent = new Array(numVertices).fill(-1);
+    const key = new Array(numVertices).fill(Infinity);
+    const inMST = new Array(numVertices).fill(false);
+
+    key[0] = 0;
+
+    for (let count = 0; count < numVertices - 1; count++) {
+        const u = minKey(key, inMST);
+        inMST[u] = true;
+
+        for (let v = 0; v < numVertices; v++) {
+            if (graph[u][v] && !inMST[v] && graph[u][v] < key[v]) {
+                parent[v] = u;
+                key[v] = graph[u][v];
+            }
+        }
+    }
+
+    return parent;
+}
+
+function minKey(key, inMST) {
+    const numVertices = key.length;
+    let min = Infinity;
+    let minIndex = -1;
+
+    for (let v = 0; v < numVertices; v++) {
+        if (!inMST[v] && key[v] < min) {
+            min = key[v];
+            minIndex = v;
+        }
+    }
+
+    return minIndex;
+}
+
+function minimumWeightPerfectMatching(graph, parent) {
+    const numVertices = graph.length;
+    const edges = [];
+
+    for (let i = 1; i < numVertices; i++) {
+        edges.push([i, parent[i]]);
+    }
+
+    const matching = [];
+
+    const visited = new Array(numVertices).fill(false);
+
+    for (const [u, v] of edges) {
+        if (!visited[u] && !visited[v]) {
+            matching.push([u, v]);
+            visited[u] = visited[v] = true;
+        }
+    }
+
+    return matching;
+}
+
+function eulerianTour(graph, startVertex) {
+    const tour = [];
+    const stack = [startVertex];
+    while (stack.length) {
+        const currentVertex = stack.pop();
+        tour.push(currentVertex);
+        for (let i = graph[currentVertex].length - 1; i >= 0; i--) {
+            if (graph[currentVertex][i] !== 0) {
+                stack.push(i);
+                graph[currentVertex][i] = graph[i][currentVertex] = 0; // Remove edge to avoid revisiting
+            }
+        }
+    }
+    return tour;
+}
+
+function christofidesTSP(cities, distances) {
+    const numCities = cities.length;
+    const minimumSpanningTreeGraph = minimumSpanningTree(distances);
+    const matching = minimumWeightPerfectMatching(distances, minimumSpanningTreeGraph);
+    const graph = Array(numCities).fill(null).map(() => Array(numCities).fill(0));
+
+    for (const [u, v] of matching) {
+        graph[u][v] = graph[v][u] = distances[u][v];
+    }
+
+    for (let i = 0; i < numCities; i++) {
+        for (let j = 0; j < numCities; j++) {
+            if (minimumSpanningTreeGraph[i] !== j) {
+                graph[i][j] = distances[i][j];
+            }
+        }
+    }
+
+    const eulerianTourPath = eulerianTour(graph, 0);
+    const visited = new Set();
+    const hamiltonianTour = [];
+
+    for (const vertex of eulerianTourPath) {
+        if (!visited.has(vertex)) {
+            hamiltonianTour.push(vertex);
+            visited.add(vertex);
+        }
+    }
+
+    hamiltonianTour.push(hamiltonianTour[0]);
+
+    let totalDistance = 0;
+    for (let i = 0; i < hamiltonianTour.length - 1; i++) {
+        totalDistance += distances[hamiltonianTour[i]][hamiltonianTour[i + 1]];
+    }
+
+    return { order: hamiltonianTour, distance: totalDistance };
+}
+
+// Test case
+const cities = ["A", "B", "C", "D"];
+const distances = [
+    [0, 10, 15, 20],
+    [10, 0, 35, 25],
+    [15, 35, 0, 30],
+    [20, 25, 30, 0],
+];
+
+const result = christofidesTSP(cities, distances);
+console.log("Christofides Algorithm Order:", result.order.map((idx) => cities[idx]).join(" -> "));
+console.log("Christofides Algorithm Distance:", result.distance);
diff --git a/DSA/Graphs/Travelling Salesman Problem/DynamicProgramingBitmask.js b/DSA/Graphs/Travelling Salesman Problem/DynamicProgramingBitmask.js
new file mode 100644
index 0000000..60d237a
--- /dev/null
+++ b/DSA/Graphs/Travelling Salesman Problem/DynamicProgramingBitmask.js	
@@ -0,0 +1,40 @@
+function tspDynamicProgrammingBitmask(cities, distances) {
+    const n = cities.length;
+    const memo = new Array(n).fill(null).map(() => new Array(1 << n).fill(null));
+
+    function dp(node, bitmask) {
+        if (bitmask === (1 << n) - 1) {
+            return distances[node][0];
+        }
+
+        if (memo[node][bitmask] !== null) {
+            return memo[node][bitmask];
+        }
+
+        let minDistance = Infinity;
+        for (let nextNode = 0; nextNode < n; nextNode++) {
+            if ((bitmask & (1 << nextNode)) === 0) {
+                const newDistance = distances[node][nextNode] + dp(nextNode, bitmask | (1 << nextNode));
+                minDistance = Math.min(minDistance, newDistance);
+            }
+        }
+
+        memo[node][bitmask] = minDistance;
+        return minDistance;
+    }
+
+    const initialBitmask = 1; // Start from city 0
+    const minDistance = dp(0, initialBitmask);
+    return minDistance;
+}
+
+// Test case
+const cities = ["A", "B", "C"];
+const distances = [
+    [0, 10, 15],
+    [10, 0, 20],
+    [15, 20, 0],
+];
+
+const result = tspDynamicProgrammingBitmask(cities, distances);
+console.log("Dynamic Programming (Bitmask) Optimal Distance:", result);
diff --git a/DSA/Graphs/Travelling Salesman Problem/Dynamic_programming.js b/DSA/Graphs/Travelling Salesman Problem/Dynamic_programming.js
new file mode 100644
index 0000000..f66fb90
--- /dev/null
+++ b/DSA/Graphs/Travelling Salesman Problem/Dynamic_programming.js	
@@ -0,0 +1,44 @@
+function dynamicProgrammingTSP(cities, distances) {
+    const numCities = cities.length;
+    const numStates = 1 << numCities; // 2^n states to represent subsets of cities
+    const memo = Array(numCities)
+        .fill(null)
+        .map(() => Array(numStates).fill(null));
+
+    function tspDP(currentCity, state) {
+        if (state === (1 << numCities) - 1) {
+            // All cities visited, return to the starting city
+            return distances[currentCity][0];
+        }
+
+        if (memo[currentCity][state] !== null) {
+            return memo[currentCity][state];
+        }
+
+        let minDistance = Infinity;
+        for (let nextCity = 0; nextCity < numCities; nextCity++) {
+            if ((state & (1 << nextCity)) === 0) {
+                // Next city not visited
+                const newDistance = distances[currentCity][nextCity] + tspDP(nextCity, state | (1 << nextCity));
+                minDistance = Math.min(minDistance, newDistance);
+            }
+        }
+
+        memo[currentCity][state] = minDistance;
+        return minDistance;
+    }
+
+    const optimalDistance = tspDP(0, 1); // Start from city 0 (the first city), with only city 0 visited
+    return optimalDistance;
+}
+
+// Test case
+const cities = ["A", "B", "C"];
+const distances = [
+    [0, 10, 15],
+    [10, 0, 20],
+    [15, 20, 0],
+];
+
+const result = dynamicProgrammingTSP(cities, distances);
+console.log("Dynamic Programming Optimal Distance:", result);
diff --git a/DSA/Graphs/Travelling Salesman Problem/GeneticAlgorithm.js b/DSA/Graphs/Travelling Salesman Problem/GeneticAlgorithm.js
new file mode 100644
index 0000000..c0ad8fd
--- /dev/null
+++ b/DSA/Graphs/Travelling Salesman Problem/GeneticAlgorithm.js	
@@ -0,0 +1,76 @@
+function generateRandomOrder(n) {
+    const order = Array.from({ length: n }, (_, i) => i);
+    for (let i = n - 1; i > 0; i--) {
+        const j = Math.floor(Math.random() * (i + 1));
+        [order[i], order[j]] = [order[j], order[i]]; // Swap elements randomly
+    }
+    return order;
+}
+
+function calculateTotalDistance(order, distances) {
+    let totalDistance = 0;
+    for (let i = 0; i < order.length - 1; i++) {
+        totalDistance += distances[order[i]][order[i + 1]];
+    }
+    return totalDistance;
+}
+
+function geneticAlgorithmTSP(cities, distances, populationSize, generations) {
+    let population = Array.from({ length: populationSize }, () => generateRandomOrder(cities.length));
+    let bestOrder = population[0];
+    let minDistance = calculateTotalDistance(bestOrder, distances);
+
+    for (let generation = 0; generation < generations; generation++) {
+        population = population.sort(() => 0.5 - Math.random()); // Shuffle population
+
+        for (let i = 0; i < populationSize; i += 2) {
+            const parent1 = population[i];
+            const parent2 = population[i + 1];
+            const [child1, child2] = crossover(parent1, parent2);
+            mutate(child1);
+            mutate(child2);
+
+            population[i] = child1;
+            population[i + 1] = child2;
+        }
+
+        const newBestOrder = population[0];
+        const newMinDistance = calculateTotalDistance(newBestOrder, distances);
+        if (newMinDistance < minDistance) {
+            bestOrder = newBestOrder;
+            minDistance = newMinDistance;
+        }
+    }
+
+    return { order: bestOrder, distance: minDistance };
+}
+
+// Helper functions for Genetic Algorithm
+function crossover(parent1, parent2) {
+    const n = parent1.length;
+    const start = Math.floor(Math.random() * n);
+    const end = Math.floor(Math.random() * (n - start)) + start;
+    const child1 = parent1.slice(start, end + 1).concat(parent2.filter((city) => !child1.includes(city)));
+    const child2 = parent2.slice(start, end + 1).concat(parent1.filter((city) => !child2.includes(city)));
+    return [child1, child2];
+}
+
+function mutate(order) {
+    const n = order.length;
+    const i = Math.floor(Math.random() * n);
+    const j = (i + 1) % n;
+    [order[i], order[j]] = [order[j], order[i]]; // Swap two cities
+}
+
+// Test case
+const cities = ["A", "B", "C", "D"];
+const distances = [
+    [0, 10, 15, 20],
+    [10, 0, 35, 25],
+    [15, 35, 0, 30],
+    [20, 25, 30, 0],
+];
+
+const result = geneticAlgorithmTSP(cities, distances, 100, 1000);
+console.log("Genetic Algorithm Order:", result.order.map((idx) => cities[idx]).join(" -> "));
+console.log("Genetic Algorithm Distance:", result.distance);
diff --git a/DSA/Graphs/Travelling Salesman Problem/HeuristicApproach.js b/DSA/Graphs/Travelling Salesman Problem/HeuristicApproach.js
new file mode 100644
index 0000000..d68cb97
--- /dev/null
+++ b/DSA/Graphs/Travelling Salesman Problem/HeuristicApproach.js	
@@ -0,0 +1,44 @@
+function solveILPHeuristic() {
+    const coefficients = [2, 3, 5]; // Coefficients of the objective function
+    const constraintCoefficients = [
+        [1, 2, 1], // Coefficients of the constraints
+    ];
+    const constraintLimits = [0]; // Right-hand side of the constraints
+
+    const numVariables = coefficients.length;
+    const numConstraints = constraintCoefficients.length;
+
+    const solution = Array(numVariables).fill(0);
+    let objectiveValue = 0;
+
+    for (let i = 0; i < numVariables; i++) {
+        // Calculate the marginal contribution of variable i to the objective function
+        const marginalContribution = coefficients[i];
+
+        // Check if adding variable i to the solution violates any constraints
+        let isFeasible = true;
+        for (let j = 0; j < numConstraints; j++) {
+            let constraintValue = 0;
+            for (let k = 0; k < numVariables; k++) {
+                constraintValue += solution[k] * constraintCoefficients[j][k];
+            }
+            if (constraintValue + constraintCoefficients[j][i] > constraintLimits[j]) {
+                isFeasible = false;
+                break;
+            }
+        }
+
+        // If adding variable i is feasible and improves the objective, include it in the solution
+        if (isFeasible && marginalContribution > 0) {
+            solution[i] = 1;
+            objectiveValue += marginalContribution;
+        }
+    }
+
+    return { solution, objectiveValue };
+}
+
+// Test the heuristic approach for ILP
+const result = solveILPHeuristic();
+console.log('Solution:', result.solution);
+console.log('Objective Value (approximate):', result.objectiveValue);
diff --git a/DSA/Graphs/Travelling Salesman Problem/IntegerLinearProgramming.js b/DSA/Graphs/Travelling Salesman Problem/IntegerLinearProgramming.js
new file mode 100644
index 0000000..1d29fe4
--- /dev/null
+++ b/DSA/Graphs/Travelling Salesman Problem/IntegerLinearProgramming.js	
@@ -0,0 +1,52 @@
+function solveILP() {
+    const coefficients = [2, 3, 5]; // Coefficients of the objective function
+    const constraintCoefficients = [
+        [1, 2, 1], // Coefficients of the constraints
+    ];
+    const constraintLimits = [0]; // Right-hand side of the constraints
+
+    const numVariables = coefficients.length;
+    const numConstraints = constraintCoefficients.length;
+
+    let bestObjectiveValue = -Infinity;
+    let bestSolution = Array(numVariables).fill(0);
+
+    // Generate all possible binary combinations for the variables
+    for (let i = 0; i < Math.pow(2, numVariables); i++) {
+        const binary = (i >>> 0).toString(2).padStart(numVariables, '0').split('').map(Number);
+        let isFeasible = true;
+
+        // Check if the binary combination satisfies the constraints
+        for (let j = 0; j < numConstraints; j++) {
+            let constraintValue = 0;
+            for (let k = 0; k < numVariables; k++) {
+                constraintValue += binary[k] * constraintCoefficients[j][k];
+            }
+            if (constraintValue > constraintLimits[j]) {
+                isFeasible = false;
+                break;
+            }
+        }
+
+        if (isFeasible) {
+            // Calculate the objective value for this combination
+            let objectiveValue = 0;
+            for (let k = 0; k < numVariables; k++) {
+                objectiveValue += binary[k] * coefficients[k];
+            }
+
+            // Update the best solution if this combination has a better objective value
+            if (objectiveValue > bestObjectiveValue) {
+                bestObjectiveValue = objectiveValue;
+                bestSolution = [...binary];
+            }
+        }
+    }
+
+    return { solution: bestSolution, objectiveValue: bestObjectiveValue };
+}
+
+// Test the ILP solver
+const result = solveILP();
+console.log('Solution:', result.solution);
+console.log('Optimal Objective Value:', result.objectiveValue);
diff --git a/DSA/Graphs/Travelling Salesman Problem/IterativeImprovement(Heuristic).js b/DSA/Graphs/Travelling Salesman Problem/IterativeImprovement(Heuristic).js
new file mode 100644
index 0000000..3fb118c
--- /dev/null
+++ b/DSA/Graphs/Travelling Salesman Problem/IterativeImprovement(Heuristic).js	
@@ -0,0 +1,48 @@
+function iterativeImprovementTSP(cities, distances) {
+    const numCities = cities.length;
+    let currentOrder = generateRandomOrder(numCities);
+    let currentDistance = calculateTotalDistance(currentOrder, distances);
+    let improvement = true;
+
+    while (improvement) {
+        improvement = false;
+
+        for (let i = 0; i < numCities - 1; i++) {
+            for (let j = i + 1; j < numCities; j++) {
+                const newOrder = twoOptSwap(currentOrder, i, j);
+                const newDistance = calculateTotalDistance(newOrder, distances);
+
+                if (newDistance < currentDistance) {
+                    currentOrder = newOrder;
+                    currentDistance = newDistance;
+                    improvement = true;
+                }
+            }
+        }
+    }
+
+    return { order: currentOrder, distance: currentDistance };
+}
+
+function twoOptSwap(order, i, j) {
+    const newOrder = [...order];
+    while (i < j) {
+        [newOrder[i], newOrder[j]] = [newOrder[j], newOrder[i]];
+        i++;
+        j--;
+    }
+    return newOrder;
+}
+
+// Test case
+const cities = ["A", "B", "C", "D"];
+const distances = [
+    [0, 10, 15, 20],
+    [10, 0, 35, 25],
+    [15, 35, 0, 30],
+    [20, 25, 30, 0],
+];
+
+const result = iterativeImprovementTSP(cities, distances);
+console.log("Iterative Improvement Order:", result.order.map((idx) => cities[idx]).join(" -> "));
+console.log("Iterative Improvement Distance:", result.distance);
diff --git a/DSA/Graphs/Travelling Salesman Problem/Lin-Kernighan.js b/DSA/Graphs/Travelling Salesman Problem/Lin-Kernighan.js
new file mode 100644
index 0000000..79b0f88
--- /dev/null
+++ b/DSA/Graphs/Travelling Salesman Problem/Lin-Kernighan.js	
@@ -0,0 +1,73 @@
+function linKernighanTSP(cities, distances) {
+    const n = cities.length;
+    let bestTour = [];
+    let bestCost = Infinity;
+
+    function calculateTourCost(tour) {
+        let cost = 0;
+        for (let i = 0; i < n - 1; i++) {
+            const from = tour[i];
+            const to = tour[i + 1];
+            cost += distances[from][to];
+        }
+        cost += distances[tour[n - 1]][tour[0]]; // Return to the starting city
+        return cost;
+    }
+
+    function reverseSubtour(tour, i, j) {
+        while (i < j) {
+            const temp = tour[i];
+            tour[i] = tour[j];
+            tour[j] = temp;
+            i++;
+            j--;
+        }
+    }
+
+    function explore(k, tour, gain, canRemove) {
+        if (k === n) {
+            const tourCost = calculateTourCost(tour);
+            if (tourCost < bestCost) {
+                bestTour = [...tour];
+                bestCost = tourCost;
+            }
+        } else {
+            for (let i = k; i < n; i++) {
+                if (canRemove[tour[i]]) {
+                    for (let j = 0; j < n; j++) {
+                        if (!canRemove[tour[j]]) {
+                            const nextTour = [...tour];
+                            reverseSubtour(nextTour, k, i);
+                            nextTour[k] = tour[i];
+                            const newGain = gain - distances[tour[k - 1]][tour[k]] + distances[tour[i]][tour[i + 1]];
+
+                            if (newGain < 0) {
+                                explore(k + 1, nextTour, newGain, canRemove);
+                            }
+                        }
+                    }
+                }
+            }
+        }
+    }
+
+    const initialTour = Array.from({ length: n }, (_, i) => i);
+    const canRemove = Array(n).fill(true);
+    canRemove[0] = false; // Starting city cannot be removed
+    explore(1, initialTour, 0, canRemove);
+
+    return { order: bestTour.map((idx) => cities[idx]), distance: bestCost };
+}
+
+// Test case
+const cities = ["A", "B", "C", "D"];
+const distances = [
+    [0, 10, 15, 20],
+    [10, 0, 35, 25],
+    [15, 35, 0, 30],
+    [20, 25, 30, 0],
+];
+
+const result = linKernighanTSP(cities, distances);
+console.log("Lin-Kernighan Algorithm Order:", result.order.join(" -> "));
+console.log("Lin-Kernighan Algorithm Distance:", result.distance);
diff --git a/DSA/Graphs/Travelling Salesman Problem/NearestNeighborAlgorithm.js b/DSA/Graphs/Travelling Salesman Problem/NearestNeighborAlgorithm.js
new file mode 100644
index 0000000..9202d2e
--- /dev/null
+++ b/DSA/Graphs/Travelling Salesman Problem/NearestNeighborAlgorithm.js	
@@ -0,0 +1,38 @@
+function nearestNeighborTSP(cities, distances) {
+    const n = cities.length;
+    const visited = Array(n).fill(false);
+    const order = [0]; // Start from the first city (index 0)
+    let totalDistance = 0;
+
+    visited[0] = true;
+    for (let i = 1; i < n; i++) {
+        let nearestIdx = -1;
+        let minDistance = Infinity;
+
+        for (let j = 0; j < n; j++) {
+            if (!visited[j] && distances[order[i - 1]][j] < minDistance) {
+                nearestIdx = j;
+                minDistance = distances[order[i - 1]][j];
+            }
+        }
+
+        order.push(nearestIdx);
+        visited[nearestIdx] = true;
+        totalDistance += minDistance;
+    }
+
+    totalDistance += distances[order[n - 1]][order[0]]; // Return to the starting city
+    return { order, distance: totalDistance };
+}
+
+// Test case
+const cities = ["A", "B", "C"];
+const distances = [
+    [0, 10, 15],
+    [10, 0, 20],
+    [15, 20, 0],
+];
+
+const result = nearestNeighborTSP(cities, distances);
+console.log("Approximate Order:", result.order.map((idx) => cities[idx]).join(" -> "));
+console.log("Approximate Distance:", result.distance);
diff --git a/DSA/Graphs/Travelling Salesman Problem/README.md b/DSA/Graphs/Travelling Salesman Problem/README.md
new file mode 100644
index 0000000..d2f0d43
--- /dev/null
+++ b/DSA/Graphs/Travelling Salesman Problem/README.md	
@@ -0,0 +1,57 @@
+# Travelling Salesman Problem
+
+The Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem in the field of mathematics and computer science. It is a challenging problem that can be stated as follows:
+
+Given a list of cities and the distances between each pair of cities, the objective is to find the shortest possible route that visits each city exactly once and returns to the starting city.
+
+In other words, a traveling salesman needs to determine the most efficient way to visit all the cities in their itinerary without revisiting any city and returning to the starting point while minimizing the total distance traveled. The problem is often represented as a graph, where cities are nodes, and the distances between them are represented as edges.
+
+The Traveling Salesman Problem has numerous practical applications beyond sales, such as:
+
+1. Logistics and Transportation: Optimizing delivery routes for couriers, trucks, or drones to minimize travel time and fuel costs.
+
+2. Circuit Design: Designing the most efficient electronic circuit layout to connect a set of components.
+
+3. Manufacturing: Determining the order in which machines should process parts to minimize production time.
+
+4. DNA Sequencing: Finding the optimal order to sequence fragments of DNA in genomics research.
+
+5. Network Design: Planning the most efficient layout for connecting network nodes while minimizing data transmission costs.
+
+The TSP is a well-known NP-hard problem, which means that finding the optimal solution becomes increasingly difficult as the number of cities increases. There are various algorithms and heuristics used to approximate solutions to the TSP, such as brute force, dynamic programming, and various metaheuristic methods like genetic algorithms, simulated annealing, and ant colony optimization.
+
+Due to its computational complexity, finding the exact optimal solution for large instances of the TSP is often infeasible, and approximation algorithms are used to find near-optimal solutions that are practical for real-world applications.
+
+## Solution to the Travelling Salesman Problem
+
+### Exact Algorithms:
+
+    1. Brute Force: Enumerate all possible permutations of cities and calculate the total distance for each permutation to find the optimal solution. Practical only for small problem instances due to its exponential time complexity.
+    
+    2. Dynamic Programming: The Held-Karp algorithm is a dynamic programming approach that improves efficiency by avoiding redundant calculations. It can solve TSP for moderate-sized instances but still has exponential time complexity in the worst case.
+
+### Approximation Algorithms:
+
+    1. Nearest Neighbor Algorithm: Start from a selected city and repeatedly choose the nearest unvisited city until all cities are visited. This is a simple and fast heuristic but may not always produce optimal solutions.
+    
+    2. Christofides Algorithm: An approximation algorithm that guarantees a solution within 3/2 times the optimal solution for metric TSP instances (where distances satisfy the triangle inequality). It includes minimum spanning tree and minimum-weight perfect matching steps.
+
+    3. Lin-Kernighan Algorithm: An improvement heuristic that iteratively swaps edges in the tour to improve the solution quality.
+
+### Metaheuristic Algorithms:
+
+    1. Genetic Algorithms: Inspired by natural selection, these algorithms involve creating a population of candidate solutions and iteratively evolving them through selection, crossover, and mutation operations. Genetic algorithms can be effective for finding near-optimal solutions.
+
+    2. Simulated Annealing: Based on the annealing process in metallurgy, this algorithm explores the solution space by accepting suboptimal solutions with a decreasing probability as the search progresses. It can escape local optima.
+
+    3. Ant Colony Optimization: Inspired by the foraging behavior of ants, this algorithm models the exploration of solution space as ants deposit pheromones on edges. Over time, paths with higher pheromone concentrations are more likely to be chosen.
+    
+    4. Integer Linear Programming (ILP): Formulate the TSP as an ILP problem and use ILP solvers like CPLEX or Gurobi to find exact solutions for small to moderately sized instances.
+
+    5. Heuristic Approaches: Various heuristics and custom algorithms can be designed specifically for certain types of TSP instances, such as planar TSP, Euclidean TSP, or TSP with time windows.
+
+    6. Hybrid Approaches: Combine multiple algorithms or heuristics to improve solution quality and efficiency. For example, a genetic algorithm might be enhanced with local search.
+
+    7. Preprocessing and Data Reduction: Reduce the problem size by removing dominated or redundant cities or by using geometric properties of the problem to simplify the search.
+
+The choice of method depends on factors such as the size and type of the TSP instance, the desired solution quality, and available computational resources. In practice, many large TSP instances are solved using approximation algorithms or metaheuristic methods to find high-quality solutions efficiently.
diff --git a/DSA/Graphs/Travelling Salesman Problem/SimulatedAnnealing.js b/DSA/Graphs/Travelling Salesman Problem/SimulatedAnnealing.js
new file mode 100644
index 0000000..907878a
--- /dev/null
+++ b/DSA/Graphs/Travelling Salesman Problem/SimulatedAnnealing.js	
@@ -0,0 +1,41 @@
+function simulatedAnnealingTSP(cities, distances, temperature, coolingRate) {
+    let currentOrder = generateRandomOrder(cities.length);
+    let currentDistance = calculateTotalDistance(currentOrder, distances);
+    let bestOrder = currentOrder.slice();
+    let minDistance = currentDistance;
+
+    while (temperature > 1) {
+        const i = Math.floor(Math.random() * cities.length);
+        const j = Math.floor(Math.random() * cities.length);
+        const newOrder = currentOrder.slice();
+        [newOrder[i], newOrder[j]] = [newOrder[j], newOrder[i]]; // Swap two cities
+        const newDistance = calculateTotalDistance(newOrder, distances);
+
+        const delta = newDistance - currentDistance;
+        if (delta < 0 || Math.random() < Math.exp(-delta / temperature)) {
+            currentOrder = newOrder;
+            currentDistance = newDistance;
+            if (currentDistance < minDistance) {
+                bestOrder = currentOrder.slice();
+                minDistance = currentDistance;
+            }
+        }
+
+        temperature *= coolingRate;
+    }
+
+    return { order: bestOrder, distance: minDistance };
+}
+
+// Test case
+const cities = ["A", "B", "C", "D"];
+const distances = [
+    [0, 10, 15, 20],
+    [10, 0, 35, 25],
+    [15, 35, 0, 30],
+    [20, 25, 30, 0],
+];
+
+const result = simulatedAnnealingTSP(cities, distances, 1000, 0.99);
+console.log("Simulated Annealing Order:", result.order.map((idx) => cities[idx]).join(" -> "));
+console.log("Simulated Annealing Distance:", result.distance);
diff --git a/DSA/Miscelleneous/SmallestCommonMultiple.js b/DSA/Miscelleneous/SmallestCommonMultiple.js
new file mode 100644
index 0000000..b18d7e8
--- /dev/null
+++ b/DSA/Miscelleneous/SmallestCommonMultiple.js
@@ -0,0 +1,36 @@
+/*
+
+Find the smallest common multiple of the provided parameters that can be evenly divided by both, as well as by 
+all sequential numbers in the range between these parameters.
+
+The range will be an array of two numbers that will not necessarily be in numerical order.
+
+For example, if given 1 and 3, find the smallest common multiple of both 1 and 3 that is also evenly divisible 
+by all numbers between 1 and 3. The answer here would be 6.
+
+*/
+
+function smallestCommons(arr) {
+    var range = [];
+    for (var i = Math.max(arr[0], arr[1]); i >= Math.min(arr[0], arr[1]); i--) {
+      range.push(i);
+    }
+
+    // could use reduce() in place of this block
+    var lcm = range[0];
+    for (i = 1; i < range.length; i++) {
+      var GCD = gcd(lcm, range[i]);
+      lcm = (lcm * range[i]) / GCD;
+      }
+    return lcm;
+
+    function gcd(x, y) {
+      if (y === 0)
+          return x;
+      else
+          return gcd(y, x%y);
+    }
+}
+
+// test here
+smallestCommons([1,5]);
diff --git a/DSA/Miscelleneous/mark_and_sweep.js b/DSA/Miscelleneous/mark_and_sweep.js
new file mode 100644
index 0000000..e78b511
--- /dev/null
+++ b/DSA/Miscelleneous/mark_and_sweep.js
@@ -0,0 +1,115 @@
+let HEAP = [];
+
+const A = {
+  language: "JavaScript",
+};
+
+HEAP.push(A);
+
+const root = () => HEAP[0];
+
+const B = {
+  language: "Rust",
+};
+
+HEAP.push(B);
+
+A.B = B;
+
+const C = {
+  language: "Elm",
+};
+
+HEAP.push(C);
+
+A.C = C;
+
+// Let's remove the reference C
+delete A.C;
+
+const D = {
+  language: "GoLang",
+};
+
+HEAP.push(D);
+
+// Object "D" is reachable from "B" and is allocated the memory
+B.D = D;
+
+// "B" reference is removed from "A".
+delete A.B;
+
+// It means that "D" still has the reference to it from "B" but it's
+// not reachable (because B is not reachable anymore)
+
+// After these manipulations, the heap still contains four objects:
+// [{ A }, { B }, { C }, { D }], but only the "A" object is reachable (root)
+
+// Garbage collector (uses mark and sweep algorithm )
+const gc = () => {
+  // Set __mark__ bits on the reachable objects to 1
+  mark();
+
+  // Collect the garbage (objects with __mark__ bit not set to 1)
+  sweep();
+};
+
+// Traverse all the reachable objects starting from the root and set the
+// __mark__ bit on it to 1
+const mark = () => {
+  // Initially only the root is reachable
+  let reachables = [root()];
+
+  while (reachables.length) {
+    // Get the next object
+    let current = reachables.pop();
+    // Mark the object if it is not already marked
+    if (!current.__markBit__) {
+      current.__markBit__ = 1;
+      // add all the reachable objects from the current object
+      // reachables array
+      for (let i in current) {
+        if (typeof current[i] === "object") {
+          // Add it to the reachables
+          reachables.push(current[i]);
+        }
+      }
+    }
+  }
+};
+
+// Traverse the heap and move all unmarked or unreachable objects to the free list.
+const sweep = () => {
+  // Update the state
+  HEAP = HEAP.filter((current) => {
+    // For future Garbage collection cycles, reset the __markBit__ bit to 0
+    if (current.__markBit__ === 1) {
+      current.__markBit__ = 0;
+      return true;
+    } else return false; // move it to the free list
+  });
+};
+
+const main = () => {
+  console.log("\nHeap state before garbage collection: ", HEAP);
+
+  // Make a call to garbage collector
+  gc();
+
+  console.log("\nHeap state after garbage collection: ", HEAP);
+};
+
+main();
+
+/*
+Output-->
+
+Heap state before garbage collection:  [
+  { language: 'JavaScript' },
+  { language: 'Rust', D: { language: 'GoLang' } },
+  { language: 'Elm' },
+  { language: 'GoLang' }
+]
+
+Heap state after garbage collection:  [ { language: 'JavaScript', __markBit__: 0 } ]
+*/
diff --git a/DSA/Strings/Capitalize.js b/DSA/Strings/Capitalize.js
new file mode 100644
index 0000000..0333a33
--- /dev/null
+++ b/DSA/Strings/Capitalize.js
@@ -0,0 +1,16 @@
+// Convert a sentence to title case using Javascript
+// example: Input: this is a phrase
+// Output: This Is A Phrase
+
+const toTitleCase = (sentence) => {
+    let words = sentence.split(' ');
+    let capitalizedSentence = '';
+    words.forEach((word) => {
+        capitalizedSentence += String(word).charAt(0).toUpperCase() + word.slice(1) + ' ';
+    })
+
+    return capitalizedSentence.trim();
+}
+const sentence = 'this is a sentence'
+
+console.log(toTitleCase(sentence));
\ No newline at end of file
diff --git a/DSA/Strings/ShortestSubstring.js b/DSA/Strings/ShortestSubstring.js
new file mode 100644
index 0000000..e141cd7
--- /dev/null
+++ b/DSA/Strings/ShortestSubstring.js
@@ -0,0 +1,32 @@
+// This function compares two sets 'a' and 'b' to check if they have the same elements.
+// It returns true if the sets have the same elements, and false otherwise.
+const compareSets = (a, b) => a.size === b.size && [...a].every(e => b.has(e))
+
+// This function, 'shortestSubstring', calculates the length of the shortest substring
+// in the input string 's' that contains all unique characters present in the original string.
+function shortestSubstring(s) {
+    let len = s.length; // Get the length of the input string.
+    let uniqueChars = new Set(Array.from(s)); // Create a set of unique characters from the input string.
+    let subString = ''; // Initialize an empty substring.
+    let mLen = len + 1; // Initialize 'mLen' to be greater than the length of the input string.
+
+    // Nested loops to find all possible substrings.
+    for (let i = 0; i < len; i++) {
+        for (let j = i; j < len; j++) {
+            subString = subString + s[j]; // Add characters to the current substring.
+            
+            // Check if the unique characters of the current substring match the unique characters of the input string.
+            if (compareSets(new Set(subString), uniqueChars)) {
+                if (mLen > subString.length) {
+                    mLen = subString.length; // Update 'mLen' if a shorter valid substring is found.
+                }
+                break; // Exit the inner loop once a valid substring is found.
+            }
+        }
+        subString = ''; // Reset the current substring for the next iteration.
+    }
+
+    return mLen; // Return the length of the shortest valid substring.
+}
+
+console.log(shortestSubstring('bcaacbc')); // Example usage of the function.
diff --git a/EloquentJS/Notes/HOF.md b/EloquentJS/Notes/HOF.md
index d952297..3f2376d 100644
--- a/EloquentJS/Notes/HOF.md
+++ b/EloquentJS/Notes/HOF.md
@@ -10,7 +10,7 @@ Abstractions hide details and give us the ability to talk about problems at a hi
 
 Functions that operate on other functions, either by taking them as arguments or by returning them, are called higher-order functions.
 
-```
+```js
 function greaterThan(n) {
   return m => m > n;
 }
@@ -21,7 +21,7 @@ console.log(greaterThan10(11));
 
 Another Example...
 
-```
+```js
 function noisy(f) {
   return (...args) => {
     console.log("calling with", args);
@@ -40,7 +40,7 @@ noisy(Math.min)(3, 2, 1);
 
 There is a built-in array method, forEach, that provides something like a for/of loop as a higher-order function.
 
-```
+```js
 ["A", "B"].forEach(l => console.log(l));
 // → A
 // → B
@@ -54,7 +54,7 @@ It returns a new array that has filtered values.
 
 Suppose we have some SCRIPT data, then:
 
-```
+```js
 SCRIPT.filter(s => s.direction == "ttb")
 ```
 
@@ -62,7 +62,7 @@ SCRIPT.filter(s => s.direction == "ttb")
 
 Map function is used for mapping each value of the passed iterator object to a particular another value based on the `transform` method passed.
 
-```
+```js
 SCRIPT.map(s=> s.name);
 ```
 
@@ -74,12 +74,12 @@ It builds a value by repeatedly taking a single element from the array and combi
 
 Parameters to reduce are: Array, Combining function and a Start value.
 
-```
+```js
 console.log([1, 2, 3, 4].reduce((a, b) => a + b));
 // → 10
 ```
 
-```
+```js
 function characterCount(script) {
   return script.ranges.reduce((count, [from, to]) => {
     return count + (to - from);
@@ -97,7 +97,7 @@ console.log(SCRIPTS.reduce((a, b) => {
 
 
 
-```
+```js
 function average(array) {
   return array.reduce((a, b) => a + b) / array.length;
 }
diff --git a/InterviewQuestions/DecimaltoRoman.js b/InterviewQuestions/DecimaltoRoman.js
new file mode 100644
index 0000000..5616166
--- /dev/null
+++ b/InterviewQuestions/DecimaltoRoman.js
@@ -0,0 +1,53 @@
+// javascript code implementation
+
+function integerToRoman(num) {
+	let roman = new Map(); // move outside
+	roman.set(1, 'I');
+	roman.set(5, 'V');
+	roman.set(10, 'X');
+	roman.set(50, 'L');
+	roman.set(100, 'C');
+	roman.set(500, 'D');
+	roman.set(1000, 'M');
+	roman.set(5000, 'G');
+	roman.set(10000, 'H');
+	
+	let tmp = Array.from(String(num));
+	let numDigits = tmp.length;
+
+	let res = [];
+	for(let i=0;i<numDigits;++i) {
+		let src = tmp[i]; // orig
+		let number = (src.charCodeAt(0) - 48); // convert to integer
+		let place = (numDigits-1)-i;
+		let absolute = Math.pow(10, place);
+
+		if (number == 9) {
+			res.push(roman.get(absolute));
+			res.push(roman.get((number+1) * absolute));
+		} else
+		if (number >= 5) {
+			res.push(roman.get(5*absolute));
+			
+			let cnt = number-5;
+			while(cnt--) res.push(roman.get(absolute));
+		} 
+		else{
+			if (number >= 4) {
+				res.push(roman.get(absolute));
+				res.push(roman.get(5*absolute));
+			} 
+			else {
+				
+				let cnt = number;
+				while(cnt--) res.push(roman.get(absolute));
+			}
+		}
+	}
+	return res;
+}
+
+let ans = integerToRoman(3549).join('');
+console.log(ans);
+
+// This code is contributed by Nidhi goel.
diff --git a/InterviewQuestions/README.md b/InterviewQuestions/README.md
new file mode 100644
index 0000000..fcdfdfe
--- /dev/null
+++ b/InterviewQuestions/README.md
@@ -0,0 +1,18 @@
+# JS Interview Questions Practice Resources
+
+### Interview Questions Blogs
+- https://javascript.plainenglish.io/some-of-the-javascript-interview-questions-i-have-experienced-ce802e4e107d
+- https://levelup.gitconnected.com/7-common-frontend-interview-questions-c8dddd3a9382
+- https://www.freecodecamp.org/news/3-questions-to-watch-out-for-in-a-javascript-interview-725012834ccb/
+- https://blog.usejournal.com/most-frequently-asked-topics-in-the-javascript-interview-part-ii-ac9468970d5d
+- What would you ask in FE interview: https://www.quora.com/What-would-you-ask-in-a-JavaScript-frontend-interview
+- http://javascriptissexy.com/understand-javascripts-this-with-clarity-and-master-it/
+
+### Concepts and Topics Resources
+- Many Good JS Interview Practice Topics: https://skilled.dev/course
+- Pub Sub Architecture by Gaurav Sen: https://www.youtube.com/watch?v=FMhbR_kQeHw
+- Pub Sub Architecture by Hussain: https://www.youtube.com/watch?v=O1PgqUqZKTA
+- RabbitMQ: https://www.youtube.com/watch?v=Cie5v59mrTg&t=44s
+- REST API: https://www.youtube.com/watch?v=M3XQ6yEC51Q&list=PLQnljOFTspQXNP6mQchJVP3S-3oKGEuw9&index=1
+- Build a JavaScript Promise: https://skilled.dev/course/build-a-javascript-promise
+- Essential Design Patterns: https://addyosmani.com/resources/essentialjsdesignpatterns/book/
\ No newline at end of file
diff --git a/InterviewQuestions/customBind.js b/InterviewQuestions/customBind.js
new file mode 100644
index 0000000..e69de29
diff --git a/InterviewQuestions/customList.js b/InterviewQuestions/customList.js
new file mode 100644
index 0000000..57b5e40
--- /dev/null
+++ b/InterviewQuestions/customList.js
@@ -0,0 +1,7 @@
+function list() {
+    console.log(arguments);
+    return Array.prototype.slice.call(arguments);
+  }
+  
+  const lis = list(1,2,3)
+  console.log(lis)
\ No newline at end of file
diff --git a/InterviewQuestions/debounce.js b/InterviewQuestions/debounce.js
new file mode 100644
index 0000000..cd865d3
--- /dev/null
+++ b/InterviewQuestions/debounce.js
@@ -0,0 +1,34 @@
+// Implementation 1
+const getData = () => {
+    console.log("Fetching Data...");
+  };
+
+  const debounce = (fn, delay) => {
+    // returns a function that calls getData() only when x ms delay is observed
+    let timer;
+    return function () {
+      // call getData after some interval x
+      let context = this;
+      args = arguments;
+      clearTimeout(timer);
+      timer = setTimeout(() => {
+        fn();
+      }, delay);
+    };
+  };
+
+  const debounceFunction = debounce(getData, 1000);
+
+  // Implementation 2
+
+  function debounce(delay, func){
+    let timeoutID = null;
+  
+    return function(...args){
+      if(timeoutID){
+        clearTimeout(timeoutID);
+      }
+  
+      timeoutID = setTimeout(() => func(...args), delay);
+    }
+  }
\ No newline at end of file
diff --git a/InterviewQuestions/findSecondLargestElementInArray.js b/InterviewQuestions/findSecondLargestElementInArray.js
new file mode 100644
index 0000000..088e6ed
--- /dev/null
+++ b/InterviewQuestions/findSecondLargestElementInArray.js
@@ -0,0 +1,20 @@
+/**
+ * Problem statement: Find second largest element in the array. Consider the case wherein duplicates can exist
+ * arr = [12, 35, 1, 10, 34, 35, 35] - Here 35 occurs 3 times, but second largest element should be 34
+ */
+function findSecondLargestElementInArray(arr) {
+  let largest = -1,
+    secondLargest = -1;
+
+  for (let i = 0; i <= arr.length - 1; i++) {
+    if (arr[i] > largest) {
+      secondLargest = largest;
+      largest = arr[i];
+    } else if (arr[i] > secondLargest && arr[i] != largest) {
+      secondLargest = arr[i];
+    }
+  }
+  console.log(secondLargest);
+}
+let arr = [12, 35, 1, 10, 34, 35, 35];
+findSecondLargestElementInArray(arr);
diff --git a/InterviewQuestions/flattenArray.js b/InterviewQuestions/flattenArray.js
new file mode 100644
index 0000000..774c786
--- /dev/null
+++ b/InterviewQuestions/flattenArray.js
@@ -0,0 +1,20 @@
+const arr = [[1,2,3], 2,5,4,56, [4,5,[45,6,7]]];
+
+const customFlat = function (arr, level, resArr=[]){
+ if(level === 0 )  return arr;
+ 
+ for(let item of arr){
+   if(Array.isArray(item)){
+     resArr.push(...item);
+   }else{
+     resArr.push(item);
+   }
+ }
+ resArr = customFlat(resArr, --level);
+ 
+ return resArr;
+}
+
+const flatArr = customFlat(arr, 5);
+console.log(flatArr);
+
diff --git a/InterviewQuestions/sumFunction.js b/InterviewQuestions/sumFunction.js
new file mode 100644
index 0000000..1dd0401
--- /dev/null
+++ b/InterviewQuestions/sumFunction.js
@@ -0,0 +1,10 @@
+let sum = function(a){
+    return function(b){
+      if(b === undefined){
+        return a;
+      }
+      return sum(a+b);
+    }
+  }
+  
+console.log(sum(1)(2)(10)(5)())
\ No newline at end of file
diff --git a/InterviewQuestions/throttle.js b/InterviewQuestions/throttle.js
new file mode 100644
index 0000000..7e837f4
--- /dev/null
+++ b/InterviewQuestions/throttle.js
@@ -0,0 +1,36 @@
+// Implementation 1
+const getData = () => {
+    console.log("Fetching Data...");
+};
+
+const throttle = (func, limit) => {
+    let flag = true
+    return function(){
+        let context = this;
+        let args = arguments;
+        if(flag){
+            func.apply(context, args);
+            flag = false;
+            setTimeout(() => {
+                flag=true;
+            }, limit);
+        }
+            
+    }
+}
+
+// Implementation 2
+
+const throttle2 = (func, limit) => {
+    let last = new Date().getTime();
+    return function(){
+        let curr = new Date().getTime();
+        if(curr - last < limit){
+            return
+        }
+        last = current;
+        return func(...args); 
+    }
+}
+
+const betterThrottle = throttle(getData, 300);
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day01/bg.jpg b/JavaScript Challenges/Javascript 30/Day01/bg.jpg
new file mode 100644
index 0000000..869152c
Binary files /dev/null and b/JavaScript Challenges/Javascript 30/Day01/bg.jpg differ
diff --git a/JavaScript Challenges/Javascript 30/Day01/index.html b/JavaScript Challenges/Javascript 30/Day01/index.html
new file mode 100644
index 0000000..3af2c82
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day01/index.html	
@@ -0,0 +1,139 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Drum Kit</title>
+    <style>
+        body::before{
+            content: '';
+            height: 100vh;
+            width: 100vw;
+            background: url(bg.jpg) no-repeat center center/cover;
+            position: absolute;
+            top: 0;
+            left: 0;
+            z-index: -1;
+            opacity: 0.5;
+        }
+
+        .container{
+            box-sizing: border-box;
+            height: 500px;
+            padding: 150px 0;
+        }
+        .rows{
+            max-width:1100px;
+            width:100%;
+            display: flex;
+            margin: 2rem auto;
+            flex-flow:row wrap;
+            justify-content: space-evenly;
+            align-items: center;
+        }
+        .keys{
+            width: 70px;
+            height: 70px;
+            border: 4px solid black;
+            background: rgba(0,0,0,0.4);
+            color: black;
+            font-size: 1.5rem;
+            transition: all 0.5s;
+            display: flex;
+            justify-content: center;
+            align-items: center;
+            margin: 1rem;
+        }
+        .pressed{
+            transform: scale(1.1);
+            font-size: 2rem;
+            box-shadow: 0 0 10px black;
+        }
+    </style>
+</head>
+<body>
+    <div class="container">
+        <div class="rows">
+            <div data-key="81" class="keys">Q</div>
+            <div data-key="87" class="keys">W</div>
+            <div data-key="69" class="keys">E</div>
+            <div data-key="82" class="keys">R</div>
+            <div data-key="84" class="keys">T</div>
+            <div data-key="89" class="keys">Y</div>
+            <div data-key="85" class="keys">U</div>
+            <div data-key="73" class="keys">I</div>
+            <div data-key="79" class="keys">O</div>
+            <div data-key="80" class="keys">P</div>
+        </div>
+        <div class="rows">        
+            <div data-key="65" class="keys">A</div>
+            <div data-key="83" class="keys">S</div>
+            <div data-key="68" class="keys">D</div>
+            <div data-key="70" class="keys">F</div>
+            <div data-key="71" class="keys">G</div>
+            <div data-key="72" class="keys">H</div>
+            <div data-key="74" class="keys">J</div>
+            <div data-key="75" class="keys">K</div>
+            <div data-key="76" class="keys">L</div>
+        </div>
+        <div class="rows">        
+            <div data-key="90" class="keys">Z</div>
+            <div data-key="88" class="keys">X</div>
+            <div data-key="67" class="keys">C</div>
+            <div data-key="86" class="keys">V</div>
+            <div data-key="66" class="keys">B</div>
+            <div data-key="78" class="keys">N</div>
+            <div data-key="77" class="keys">M</div>
+        </div>
+    </div>
+
+    <audio data-key="65" src="sounds/claps.wav"></audio>
+    <audio data-key="66" src="sounds/claps.wav"></audio>
+    <audio data-key="67" src="sounds/claps.wav"></audio>
+    <audio data-key="68" src="sounds/claps.wav"></audio>
+    <audio data-key="69" src="sounds/claps.wav"></audio>
+    <audio data-key="70" src="sounds/claps.wav"></audio>
+    <audio data-key="71" src="sounds/claps.wav"></audio>
+    <audio data-key="72" src="sounds/claps.wav"></audio>
+    <audio data-key="73" src="sounds/claps.wav"></audio>
+    <audio data-key="74" src="sounds/claps.wav"></audio>
+    <audio data-key="75" src="sounds/claps.wav"></audio>
+    <audio data-key="76" src="sounds/claps.wav"></audio>
+    <audio data-key="77" src="sounds/claps.wav"></audio>
+    <audio data-key="78" src="sounds/claps.wav"></audio>
+    <audio data-key="79" src="sounds/claps.wav"></audio>
+    <audio data-key="80" src="sounds/claps.wav"></audio>
+    <audio data-key="81" src="sounds/claps.wav"></audio>
+    <audio data-key="82" src="sounds/claps.wav"></audio>
+    <audio data-key="83" src="sounds/claps.wav"></audio>
+    <audio data-key="84" src="sounds/claps.wav"></audio>
+    <audio data-key="85" src="sounds/claps.wav"></audio>
+    <audio data-key="86" src="sounds/claps.wav"></audio>
+    <audio data-key="87" src="sounds/claps.wav"></audio>
+    <audio data-key="88" src="sounds/claps.wav"></audio>
+    <audio data-key="89" src="sounds/claps.wav"></audio>
+    <audio data-key="90" src="sounds/claps.wav"></audio>
+    
+    <script>
+        window.addEventListener('keydown',(e)=>{
+
+            const audio = document.querySelector(`audio[data-key="${e.keyCode}"]`)
+            const key = document.querySelector(`div[data-key="${e.keyCode}"]`)
+            // console.log(audio);
+            // console.log(key);
+            
+            
+            //if there is no audio attached to that key
+            if(!audio) return; 
+
+
+            key.classList.add('pressed');
+            audio.currentTime = 0;
+            audio.play();
+            setTimeout(()=>{
+                key.classList.remove('pressed')
+            },250)
+        })
+    </script>
+</body>
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day01/sounds/claps.wav b/JavaScript Challenges/Javascript 30/Day01/sounds/claps.wav
new file mode 100644
index 0000000..991e83e
Binary files /dev/null and b/JavaScript Challenges/Javascript 30/Day01/sounds/claps.wav differ
diff --git a/JavaScript Challenges/Javascript 30/Day02/index.html b/JavaScript Challenges/Javascript 30/Day02/index.html
new file mode 100644
index 0000000..5d2dc4d
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day02/index.html	
@@ -0,0 +1,99 @@
+<!DOCTYPE html>
+<html lang="en">
+    <head>
+        <meta charset="UTF-8">
+        <meta name="viewport" content="width=device-width, initial-scale=1.0">
+        <title>Clock</title>
+        <style>
+            html{
+                background: linear-gradient(to left,blue,rgb(158, 189, 250)) no-repeat center center/cover;
+                text-align: center;
+                font-size: 1rem;
+            }
+            body{
+                display: flex;
+                flex: 1;
+                min-height: 100vh;
+                align-items: center;
+            }
+            .clock{
+                width: 30rem;
+                height: 30rem;
+                border: 10px solid white;
+                border-radius: 50%;
+                margin: 50px auto;
+                position: relative ;
+                padding: 2rem;
+                box-shadow:0 0 0 4px rgba(0,0,0,0.1),inset 0 0 0 3px #efefef, inset 0 0 10px black,0 0 10px rgba(0,0,0,0.2);
+            }
+            .clock-face{
+                position: relative;
+                width: 100%;
+                height: 100%;
+                transform: translateY(-3px);
+            }
+            .hand
+            {
+                height: 50%;
+                background: black;
+                width: 6px;
+                position: absolute;
+                left:50%;
+                transform-origin: bottom;
+            }
+            .hour-hand{
+                height: 30%;
+                top:20%;
+            }
+            .minute-hand{
+                height: 40%;
+                top: 10%;
+                width: 4px;
+            }
+            .second-hand{
+                width: 2px;
+            }
+            .holder{
+                position: absolute;
+                left: 49.5%;
+                top:49%;
+                background-color: black;
+                width: 2%;
+                height: 2%;
+                border-radius: 50%;
+            }
+        </style>
+    </head>
+    
+    <body>
+       <div class="clock">
+           <div class="clock-face">
+               <div class="hand hour-hand" id="hours"></div>
+               <div class="hand minute-hand" id="minutes"></div>
+               <div class="hand second-hand" id="seconds"></div>  
+               <div class="holder"></div>  
+           </div>
+       </div> 
+
+
+       <script>
+
+           setInterval(() => {
+            let time = new Date();
+            let hours = time.getHours();
+            let minutes = time.getMinutes();
+            let seconds = time.getSeconds();
+
+            hrotation = 30 * (hours % 12) + minutes / 2 ; 
+            mrotation = 6 * minutes ;    // each minute makes 6deg turn for minute hand
+            srotation = 6 * seconds ;   // each second makes 6deg turn for second hand
+            console.log(`${hours}:${minutes}:${seconds}`)
+            document.getElementById("hours").style.transform = `rotate(${hrotation}deg)`;
+            document.getElementById("minutes").style.transform = `rotate(${mrotation}deg)`;
+            document.getElementById("seconds").style.transform = `rotate(${srotation}deg)`;
+               
+           }, 1000);
+       </script>
+    </body>
+
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day03/index.html b/JavaScript Challenges/Javascript 30/Day03/index.html
new file mode 100644
index 0000000..448d2c2
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day03/index.html	
@@ -0,0 +1,74 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>CSS variables</title>
+    <style>
+        :root{
+            --base : #ffc600;
+            --spacing : 10px;
+            --blur : 10px;
+        }
+        body{
+            text-align: center;
+            background-color:#193549;
+            color: white;
+            font-weight: 100;
+            font-size: 30px;
+        }
+        #hl{
+            color: var(--base);
+        }
+        .controls{
+            margin-bottom: 50px;
+        }
+        input{
+            vertical-align: middle;
+            margin: 0;
+            padding: 0;
+            border: 0;
+        }
+        img{
+            padding: var(--spacing);
+            width: 80%;
+            height: auto;
+            background: var(--base);
+            filter: blur(var(--blur));
+        }
+    </style>
+
+</head>
+<body>
+    <h2>Updating CSS Variables with <span id="hl">JS</span></h2>
+    <div class="controls">
+        
+        <label for="spacing">Spacing : </label> 
+        <input type="range" name="spacing" id="spacing" min="10" max="200" value="10" data-sizing="px">
+
+        <label for="blur">Blur : </label> 
+        <input type="range" name="blur" id="blur" min="0" max="25" value="10" data-sizing="px">
+
+        <label for="base">Base Color : </label> 
+        <input type="color" name="base" id="base" value="#ffc600">
+
+    </div>
+
+    <img src="paris.jpg" alt="Paris">
+
+    <script>
+        const inputs = document.querySelectorAll('.controls input');
+        
+        function handleUpdate(){
+            const suffix = this.dataset.sizing || '';
+            document.documentElement.style.setProperty(`--${this.name}`,this.value + suffix); 
+        }
+
+        inputs.forEach(input => {
+            input.addEventListener('change', handleUpdate);
+            input.addEventListener('mousemove', handleUpdate);
+        })
+
+    </script>
+</body>
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day03/paris.jpg b/JavaScript Challenges/Javascript 30/Day03/paris.jpg
new file mode 100644
index 0000000..8ac3d37
Binary files /dev/null and b/JavaScript Challenges/Javascript 30/Day03/paris.jpg differ
diff --git a/JavaScript Challenges/Javascript 30/Day04/index.html b/JavaScript Challenges/Javascript 30/Day04/index.html
new file mode 100644
index 0000000..1e7876b
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day04/index.html	
@@ -0,0 +1,96 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Day 4 - Arrays</title>
+</head>
+<body>
+    <script>
+        const inventors = 
+        [
+            { first: "Albert", last: "Einstein", year: 1879, passed: 1955 },
+            { first: "Isaac", last: "Newton", year: 1643, passed: 1727 },
+            { first: "Galileo", last: "Galilei", year: 1564, passed: 1642 },
+            { first: "Marie", last: "Curie", year: 1867, passed: 1934 },
+            { first: "Johanne", last: "Keppler", year: 1571, passed: 1630 },
+            { first: "Nicolous", last: "Corpenicus", year: 1473, passed:  1543},
+            { first: "Max", last: "Planck", year: 1858, passed: 1947},
+        ];
+
+        const people = 
+        [
+            'Bernhard, Sandra', 'Bethea, Erin', 'Becker, Carl', 'Bentsen, Lloyd', 'Beckett, Samuel', 'Blake, William', 'Berger, Ric', 'Beddoes, Mick', 'Beethoven, Ludwig',
+            'Belloc, Hilaire', 'Begin, Menachem', 'Bellow, Saul', 'Benchley, Robert', 'Blair, Robert', 'Benenson, Peter', 'Benjamin, Walter', 'Berlin, Irving',
+            'Benn, Tony', 'Benson, Leana', 'Bent, Silas', 'Berle, Milton', 'Berry, Halle', 'Biko, Steve', 'Beck, Glenn', 'Bergman, Ingmar', 'Black, Elk', 'Berio, Luciano',
+            'Berne, Eric', 'Berra, Yogi', 'Berry, Wendell', 'Bevan, Aneurin', 'Ben-Gurion, David', 'Bevel, Ken', 'Biden, Joseph', 'Bennington, Chester', 'Bierce, Ambrose',
+            'Billings, Josh', 'Birrell, Augustine', 'Blair, Tony', 'Beecher, Henry', 'Biondo, Frank'
+        ];
+
+        // filter
+        // 1. Filter the list of inventors for those who were born in the 1500's
+        const bornin1500 = inventors.filter( (inventor) => (inventor.year >= 1500 && inventor.year <= 1599)?true:false );
+        console.table(bornin1500);  // prints in console as a table
+
+        // map
+        // 2. Give us an array of the inventors first and last names
+        const fullNames = inventors.map(inventor => inventor.first + ' ' + inventor.last);
+        console.table(fullNames)
+        
+        // sort
+        // 3. Sort the inventors by birthdate, oldest to youngest
+        const sorted = inventors.sort((a, b)=> a.year > b.year?1:-1 );
+        console.table(sorted)
+
+        // reduce
+        // 4. How many years did all the inventors live all together?
+        const totalYears = inventors.reduce((total, inventor) => {
+            return total + (inventor.passed - inventor.year);
+        }, 0);
+
+        console.log(totalYears);
+
+        // 5. Sort the inventors by years lived
+        const oldest = inventors.sort((a, b) => {
+            const lastGuy = a.passed - a.year;
+            const nextGuy = b.passed - b.year;
+            return lastGuy > nextGuy ? 1 : -1;
+        })
+        console.table(oldest);
+
+        // 6. create a list of Boulevards in Paris that contain 'de' anywhere in the name
+        // https://en.wikipedia.org/wiki/Category:Boulevards_in_Paris
+
+        // const category = document.querySelector('.mw-category');
+        // const links = Array.from(category.querySelectorAll('a'));
+
+        // const de = links
+        //             .map(link => link.textContent)
+        //             .filter(streetName => streetName.includes('de'));
+
+        
+        // 7. Sort the people alphabetically by last name
+        const peopleSorted = people.sort((A, B) => {
+            const [alast, afirst] = A.split(', '); // split the name from ', ' into last name and first name of A
+            const [blast, bfirst] = B.split(', '); 
+
+            return alast>blast ? 1 : -1 ;
+        })
+
+        console.log(peopleSorted)
+
+
+        // 8. Sum up the instances of each of these
+        const data = ['car', 'car', 'truck', 'truck', 'bike', 'walk', 'car', 'van', 'bike', 'walk', 'car', 'van', 'car', 'truck', 'pogostick'];
+        const transportation = data.reduce(function(obj, item){
+            if(!obj[item])
+            {
+                obj[item] = 0;
+            }
+            obj[item]++;
+            return obj;
+        },{})
+        console.log(transportation);
+    </script>
+</body>
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day05/index.html b/JavaScript Challenges/Javascript 30/Day05/index.html
new file mode 100644
index 0000000..776538a
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day05/index.html	
@@ -0,0 +1,142 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <link href="https://fonts.googleapis.com/css2?family=Amatic+SC:wght@700&display=swap" rel="stylesheet"> 
+    <title>Day 5</title>
+    <style>
+        html{
+            box-sizing: border-box;
+            background-color: #ffc600;
+            font-family: 'helvetica neue';
+            font-size: 20px;
+            font-weight: 200;
+        }
+        body{
+            margin: 0;
+        }
+        *,*::before,*::after{
+            box-sizing: inherit;
+        }
+        .panels{
+            max-height: 100vh;
+            height: 100vh;
+            overflow: hidden;
+            display: flex;
+        }
+        .panel{
+            background: #680F9C ;
+            color: white;
+            box-shadow: inset 0 0 0 5px rgba(255, 255, 255, 0.1);
+            /* text-align: center; */
+            font-size: 20px;
+            background-size: cover;
+            background-position: center;
+            transition:
+                font-size 0.7s cubic-bezier(0.61,-0.19, 0.7,-0.11),
+                flex 0.7s cubic-bezier(0.61,-0.19, 0.7,-0.11),
+                background 0.2s;
+            flex: 1;
+            display: flex;
+            flex-direction: column;
+            justify-content: center;
+            align-items: center;
+        }
+        .panel-1{
+            /* background-image:url(https://source.unsplash.com/gYl-UtwNg_I/1500x1500);  */
+        }
+        .panel-2{ 
+            /* background-image:url(https://source.unsplash.com/rFKUFzjPYiQ/1500x1500);  */
+        }
+        .panel-3{ 
+            /* background-image:url(https://images.unsplash.com/photo-1465188162913-8fb5709d6d57?ixlib=rb-0.3.5&q=80&fm=jpg&crop=faces&cs=tinysrgb&w=1500&h=1500&fit=crop&s=967e8a713a4e395260793fc8c802901d);  */
+        }
+        .panel-4{ 
+            /* background-image:url(https://source.unsplash.com/ITjiVXcwVng/1500x1500);  */
+        }
+        .panel-5{ 
+            /* background-image:url(https://source.unsplash.com/3MNzGlQM7qs/1500x1500);  */
+        }
+        .panel > * {
+            margin: 0;
+            width: 100%;
+            transition: transform 1s;
+            flex: 1 0 auto;
+            display: flex;
+            justify-content: center;
+            align-items: center;
+        }
+        .panel > *:first-child{
+            transform: translateY(-100%);
+        }
+        .panel > *:last-child{
+            transform: translateY(100%);
+        }
+        .panel.open-active > *:first-child{
+            transform: translateY(0);
+        }
+        .panel.open-active > *:last-child{
+            transform: translateY(0);
+        }
+        .panel p {
+            text-transform: uppercase;
+            font-family: 'Amatic SC', cursive;
+            text-shadow: 0 0 4px rgba(0, 0, 0, 0.72), 0 0 14px rgba(0, 0, 0, 0.45);
+            font-size: 2em;
+        }
+        .panel p:nth-child(2) {
+            font-size: 4em;
+        }
+        .panel.open {
+            font-size: 40px;
+            flex: 5;
+        }
+    </style>
+</head>
+<body>
+    <div class="panels">
+        <div class="panel panel-1">
+            <p>Hey</p>
+            <p>Let's</p>
+            <p>Dance</p>
+        </div>
+        <div class="panel panel-2">
+            <p>Give</p>
+            <p>Take</p>
+            <p>Receive</p>
+        </div>
+        <div class="panel panel-3">
+            <p>Experience</p>
+            <p>It</p>
+            <p>Today</p>
+        </div>
+        <div class="panel panel-4">
+            <p>Give</p>
+            <p>All</p>
+            <p>You Can</p>
+        </div>
+        <div class="panel panel-5">
+            <p>Life</p>
+            <p>In</p>
+            <p>Motion</p>
+        </div>
+    </div>
+    <script>
+        let panels = document.querySelectorAll('.panel');
+
+        function toggleOpen(){
+            this.classList.toggle('open');
+        }
+        function toggleActive(e){
+            if(e.propertyName === 'flex-grow' || e.propertyName === 'flex')
+            {
+                this.classList.toggle('open-active');
+            }
+        }
+
+        panels.forEach(panel => panel.addEventListener('click', toggleOpen));
+        panels.forEach(panel => panel.addEventListener('transitionend', toggleActive));
+    </script>
+</body>
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day06/index.html b/JavaScript Challenges/Javascript 30/Day06/index.html
new file mode 100644
index 0000000..16a4061
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day06/index.html	
@@ -0,0 +1,143 @@
+<!DOCTYPE html>
+<html lang="en">
+
+<head>
+    <meta charset="UTF-8">
+    <title>Day - 6</title>
+    <style>
+        html {
+            box-sizing: border-box;
+            background: #ffc600;
+            font-family: 'helvetica neue';
+            font-weight: 200;
+            font-size: 20px;
+        }
+
+        *,
+        *:before,
+        *:after {
+            box-sizing: inherit;
+        }
+
+        input {
+            width: 100%;
+            padding: 20px;
+        }
+
+        .search-form {
+            max-width: 400px;
+            margin: 50px auto;
+        }
+
+        input.search {
+            margin: 0;
+            text-align: center;
+            outline: 0;
+            border: 10px solid #F7F7F7;
+            width: 120%;
+            position: relative;
+            top: 10px;
+            left: -10%;
+            z-index: 2;
+            border-radius: 5px;
+            font-size: 40px;
+            box-shadow: 0 0 5px rgba(0, 0, 0, 0.12), inset 0 0 2px rgba(0, 0, 0, 0.19);
+        }
+
+        .suggestions {
+            margin: 0;
+            padding: 0;
+            position: relative;
+            /*perspective: 20px;*/
+        }
+
+        .suggestions li {
+            background: white;
+            list-style: none;
+            border-bottom: 1px solid #D8D8D8;
+            box-shadow: 0 0 10px rgba(0, 0, 0, 0.14);
+            margin: 0;
+            padding: 20px;
+            transition: background 0.2s;
+            display: flex;
+            justify-content: space-between;
+            text-transform: capitalize;
+        }
+
+        .suggestions li:nth-child(even) {
+            transform: perspective(100px) rotateX(3deg) translateY(2px) scale(1.001);
+            background: linear-gradient(to bottom, #ffffff 0%, #EFEFEF 100%);
+        }
+
+        .suggestions li:nth-child(odd) {
+            transform: perspective(100px) rotateX(-3deg) translateY(3px);
+            background: linear-gradient(to top, #ffffff 0%, #EFEFEF 100%);
+        }
+
+        span.population {
+            font-size: 15px;
+        }
+
+        .hl {
+            background: #ffc600;
+        }
+    </style>
+</head>
+
+<body>
+
+    <form class="search-form">
+        <input type="text" class="search" id="search" placeholder="City or State">
+        <ul class="suggestions">
+            <li>Filter for a city</li>
+            <li>or a state</li>
+        </ul>
+    </form>
+
+    <script>
+        const endpoint = 'https://gist.githubusercontent.com/Miserlou/c5cd8364bf9b2420bb29/raw/2bf258763cdddd704f8ffd3ea9a3e81d25e2c6f6/cities.json';
+
+        let cities = [];
+
+        fetch(endpoint)
+        .then(blob => blob.json())
+        .then(data => cities = data);
+
+        function findMatches(match, cities)
+        {
+            return cities.filter(place => {
+                const regex = new RegExp(match, 'gi');
+                return place.city.match(regex) || place.state.match(regex);
+            }); 
+        }
+
+        function numberWithCommas(x) {
+           return x.toString().replace(/\B(?=(\d{3})+(?!\d))/g, ',');
+        }
+
+        function displayMatches(){
+            const matches = findMatches(this.value, cities);
+            const html = matches.map(place => {
+                const regex = new RegExp(this.value, 'gi');
+                const cityName = place.city.replace(regex, `<span class="hl">${this.value}</span>`)
+                const stateName = place.state.replace(regex, `<span class="hl">${this.value}</span>`)
+                return `
+                    <li>
+                        <span>${cityName}, ${stateName}</span>
+                        <span class="population">${numberWithCommas(place.population)}</population>
+                    </li>
+                `;
+            }).join('');
+            suggestions.innerHTML = html;
+        }
+
+        let searchInput = document.getElementById('search');
+        let suggestions = document.querySelector('.suggestions');
+    
+        searchInput.addEventListener('change', displayMatches);
+        searchInput.addEventListener('keyup', displayMatches);
+    </script>
+
+</body>
+
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day07/index.js b/JavaScript Challenges/Javascript 30/Day07/index.js
new file mode 100644
index 0000000..15db855
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day07/index.js	
@@ -0,0 +1,45 @@
+
+const people = [
+    { name: 'Wes', year: 1988 },
+    { name: 'Kait', year: 1986 },
+    { name: 'Irv', year: 1970 },
+    { name: 'Lux', year: 2015 }
+];
+
+const comments = [
+    { text: 'Love this!', id: 523423 },
+    { text: 'Super good', id: 823423 },
+    { text: 'You are the best', id: 2039842 },
+    { text: 'Ramen is my fav food ever', id: 123523 },
+    { text: 'Nice Nice Nice!', id: 542328 }
+];
+
+// Some and Every Checks
+// Array.prototype.some() // is at least one person 19 or older?
+
+const isAdult = people.some(person => ((new Date()).getFullYear()) - person.year >= 19);
+console.log(isAdult); //true
+
+// Array.prototype.every() // is everyone 19 or older?
+const allAdults = people.every(person => ((new Date()).getFullYear()) - person.year >= 19);
+console.log(allAdults); //false
+
+// Array.prototype.find()
+// Find is like filter, but instead returns just the one you are looking for
+// find the comment with the ID of 823423
+let comment = comments.find(comment => comment.id === 823423)
+console.log(comment);
+
+// Array.prototype.findIndex()
+// Find the comment with this ID
+let index = comments.findIndex(comment => comment.id === 823423);
+console.log(index);
+
+// delete the comment with the ID of 823423
+ comments.splice(index, 1);
+
+//  alternative
+ const newComments = [
+    ...comments.slice(0, index),
+    ...comments.slice(index + 1)
+];
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day08/index.html b/JavaScript Challenges/Javascript 30/Day08/index.html
new file mode 100644
index 0000000..88eeb7a
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day08/index.html	
@@ -0,0 +1,80 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Day 8 - HTML Canvas</title>
+    <style>
+        *{
+            margin: 0;
+        }
+    </style>
+</head>
+<body>
+    <canvas id="draw" width="800" height="800"></canvas>
+
+    <script>
+        const canvas = document.querySelector("#draw");
+        const context = canvas.getContext('2d');
+        canvas.width = window.innerWidth;
+        canvas.height = window.innerHeight;
+
+        context.strokeStyle = '#BADASS';
+        context.lineJoin = 'round';
+        context.lineCap = 'round';
+        context.globalCompositeOperation = 'multiply';
+
+        let isDrawing = false;
+
+        let lastX = 0;
+        let lastY = 0;
+        let hue = 0;
+        let lineWidth = 2;
+        let direction = true;
+
+        function Draw(e)
+        {
+            if(isDrawing)
+            {
+                // console.log(e);
+                context.strokeStyle = `hsl(${hue}, 100%, 50%)`;
+                context.beginPath();
+                context.lineWidth = lineWidth;
+                context.moveTo(lastX, lastY);   // start from
+                context.lineTo(e.offsetX, e.offsetY);   // go to
+                [lastX,lastY] = [e.offsetX, e.offsetY];
+                context.stroke();
+                hue++;
+                
+                if(hue >= 360)
+                {
+                    hue = 0;
+                }
+
+                if(lineWidth >= 200 || lineWidth <= 1)
+                {
+                    direction = !direction;
+                }
+
+                if(direction)
+                {
+                    lineWidth++;
+                }
+                else
+                {
+                    lineWidth--;
+                }
+            }
+        }
+
+        canvas.addEventListener('mousemove', Draw)
+        canvas.addEventListener('mousedown', (e) => {
+            isDrawing = true;
+            [lastX,lastY] = [e.offsetX, e.offsetY];     // start from the point we click and drag
+        });
+        canvas.addEventListener('mouseup', () => isDrawing = false);
+        canvas.addEventListener('mouseout', () => isDrawing = false);
+
+    </script>
+</body>
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day09/index.html b/JavaScript Challenges/Javascript 30/Day09/index.html
new file mode 100644
index 0000000..4df2b84
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day09/index.html	
@@ -0,0 +1,90 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Console Tricks!</title>
+</head>
+<body>
+
+  <p onClick="makeGreen()">×BREAK×DOWN×</p>
+
+  <script>
+    const dogs = [{ name: 'Snickers', age: 2 }, { name: 'hugo', age: 8 }];
+
+    function makeGreen() {
+      const p = document.querySelector('p');
+      p.style.color = '#BADA55';
+      p.style.fontSize = '50px';
+    }
+
+    // Regular
+    console.log('hello');
+
+    // Interpolated
+    console.log('Hello I am a %s string!', '💩');
+
+    // Styled
+    // console.log('%c I am some great text', 'font-size:50px; background:red; text-shadow: 10px 10px 0 blue')
+
+    // warning!
+    console.warn('OH NOOO');
+
+    // Error :|
+    console.error('Shit!');
+
+    // Info
+    console.info('Crocodiles eat 3-4 people per year');
+
+    // Testing
+    const p = document.querySelector('p');
+
+    console.assert(p.classList.contains('ouch'), 'That is wrong!');
+
+    // clearing
+    console.clear();
+
+    // Viewing DOM Elements
+    console.log(p);
+    console.dir(p);
+
+    console.clear();
+
+    // Grouping together
+    dogs.forEach(dog => {
+      console.groupCollapsed(`${dog.name}`);
+      console.log(`This is ${dog.name}`);
+      console.log(`${dog.name} is ${dog.age} years old`);
+      console.log(`${dog.name} is ${dog.age * 7} dog years old`);
+      console.groupEnd(`${dog.name}`);
+    });
+
+    // counting
+
+    console.count('Wes');
+    console.count('Wes');
+    console.count('Steve');
+    console.count('Steve');
+    console.count('Wes');
+    console.count('Steve');
+    console.count('Wes');
+    console.count('Steve');
+    console.count('Steve');
+    console.count('Steve');
+    console.count('Steve');
+    console.count('Steve');
+
+    // timing
+    console.time('fetching data');
+    fetch('https://api.github.com/users/wesbos')
+      .then(data => data.json())
+      .then(data => {
+        console.timeEnd('fetching data');
+        console.log(
+data);
+      });
+
+    console.table(dogs);
+
+  </script>
+</body>
+</html>
diff --git a/JavaScript Challenges/Javascript 30/Day10/index.html b/JavaScript Challenges/Javascript 30/Day10/index.html
new file mode 100644
index 0000000..2c9a6da
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day10/index.html	
@@ -0,0 +1,117 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Day 10</title>
+    <style>
+        body{
+            font-family: sans-serif;
+            background: #ffc600;
+        }
+        .inbox{
+            max-width: 400px;
+            margin: 50px auto;
+            background-color: white;
+            border-radius: 10px;
+            box-shadow: 10px 10px 5px 5px rgba(0,0,0,0.1);
+        }
+        .item{
+            display: flex;
+            align-items: center;
+            border-bottom: 1px solid #f1f1f1;
+        }
+        .item:last-child{
+            border-bottom: 0;
+        }
+        input:checked + p{
+            text-decoration: line-through;
+            background-color: #f9f9f9;
+        }
+        input[type="checkbox"]{
+            margin: 20px;
+        }
+        p{
+            margin: 0;
+            padding: 20px;
+            transition: background 0.2s;
+            flex: 1;
+            font-family:'helvetica neue';
+            font-size: 20px;
+            font-weight: 200;
+            border-left: 1px solid #D1E2FF;
+        }
+    </style>
+</head>
+<body>
+    <div class="inbox">
+        <div class="item">
+            <input type="checkbox">
+            <p>This is an inbox item</p>
+        </div>
+        <div class="item">
+            <input type="checkbox">
+            <p>Check one item</p>
+        </div>
+        <div class="item">
+            <input type="checkbox">
+            <p>Hold down you shift key</p>
+        </div>
+        <div class="item">
+            <input type="checkbox">
+            <p>Check lower item</p>
+        </div>
+        <div class="item">
+            <input type="checkbox">
+            <p>Everything in between should also be checked</p>
+        </div>
+        <div class="item">
+            <input type="checkbox">
+            <p>Try to do it without any libraries</p>
+        </div>
+        <div class="item">
+            <input type="checkbox">
+            <p>Just regular Javascript</p>
+        </div>
+        <div class="item">
+            <input type="checkbox">
+            <p>Good luck</p>
+        </div>
+        <div class="item">
+            <input type="checkbox">
+            <p>Don't forget to tweet your result</p>
+        </div>
+    </div>
+
+
+    <script>
+        let checkboxes = document.querySelectorAll('input[type="checkbox"]');
+        // console.log(checkboxes);
+
+        let lastChecked;
+
+        function handleCheck(e){
+            // if(e.shiftKey && e.target.checked)
+            let inBetween = false;
+            if(e.shiftKey && this.checked)
+            {
+                checkboxes.forEach(checkbox => {
+                    if(checkbox === this || checkbox === lastChecked)
+                    {
+                        inBetween = !inBetween;
+                    }
+
+                    if(inBetween)
+                    {
+                        checkbox.checked = true;
+                    }
+                })
+            }
+            // lastChecked = e.target;
+            lastChecked = this;
+        }
+
+        checkboxes.forEach( checkbox => checkbox.addEventListener( 'click', handleCheck ) );
+    </script>
+</body>
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day11/index.html b/JavaScript Challenges/Javascript 30/Day11/index.html
new file mode 100644
index 0000000..b20e799
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day11/index.html	
@@ -0,0 +1,26 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Day 11 - Html Video Player</title>
+    <link rel="stylesheet" href="style.css">
+</head>
+<body>
+    <div class="player">
+        <video class="player_video viewer" src="vid.mp4"></video>
+
+        <div class="player_controls">
+            <div class="progress">
+                <div class="progress_filled"></div>
+            </div>
+            <button class="player_button toggle">►</button>
+            <input type="range" tabIndex="-1" title="volume" name="volume" class="player_slider" min="0" max="1" step="0.05" value="1">
+            <input type="range" name="playbackRate" class="player_slider" min="0.5" max="2" step="0.1" value="1">
+            <button data-skip="-10" class="player_button">« 10s</button>
+            <button data-skip="10" class="player_button">10s »</button>
+        </div>
+    </div>
+    <script src="index.js"></script>
+</body>
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day11/index.js b/JavaScript Challenges/Javascript 30/Day11/index.js
new file mode 100644
index 0000000..b77b556
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day11/index.js	
@@ -0,0 +1,93 @@
+const player = document.querySelector('.player')
+const video = player.querySelector('video');
+const progress = player.querySelector('.progress');
+const progressBar = player.querySelector('.progress_filled');
+const toggle = player.querySelector('.toggle');
+const skipButtons = player.querySelectorAll('[data-skip]');
+const ranges = player.querySelectorAll('.player_slider');
+
+// functions
+function togglePlay()
+{
+    if(video.paused)
+    {
+        video.play();
+
+    }
+    else
+    {
+        video.pause();
+    }
+}
+
+function updateButton(){
+    // const icon = this.paused ? '►' : '❚ ❚';
+    // toggle.textContent = icon;
+    const icon = this.paused ? '►' : '<b>||</b>';
+    toggle.innerHTML = icon;
+}
+
+function skip(){
+    video.currentTime += parseFloat(this.dataset.skip);
+}
+
+function handleRangeUpdate(){
+    video[this.name] = this.value;
+    console.log(this);
+}
+
+function handleProgress(){
+    const percent = ( video.currentTime / video.duration ) * 100;
+    progressBar.style.flexBasis = `${percent}%`;
+}
+
+function scrub(e){
+    let scrubTime = ( e.offsetX / progress.offsetWidth ) * video.duration ;
+    video.currentTime = scrubTime;
+    console.log(e);
+}
+
+
+
+// eventListeners
+
+// 1.play/pause button
+video.addEventListener('click', togglePlay);
+video.addEventListener('play', updateButton);
+video.addEventListener('pause', updateButton);
+
+window.addEventListener('keydown', (e) => {
+    if(e.key === " ")
+    {
+        togglePlay();
+        updateButton();
+    }
+});
+
+toggle.addEventListener('click', togglePlay);
+
+// skip buttons
+skipButtons.forEach(button => button.addEventListener('click', skip));
+
+window.addEventListener('keydown',(e) => {
+    if(e.key === "ArrowLeft")
+    {
+        skipButtons[0].click();
+    }
+    if(e.key === "ArrowRight")
+    {
+        skipButtons[1].click();
+    }
+})
+
+// range inputs
+ranges.forEach(range => range.addEventListener('change', handleRangeUpdate))
+
+// progressBar
+video.addEventListener('timeupdate', handleProgress)
+
+let mousedown = false;
+progress.addEventListener('click', scrub)
+progress.addEventListener('mousemove', (e) => mousedown && scrub(e) );
+progress.addEventListener('mousedown', () => mousedown = true );
+progress.addEventListener('mouseup', () => mousedown = false );
diff --git a/JavaScript Challenges/Javascript 30/Day11/style.css b/JavaScript Challenges/Javascript 30/Day11/style.css
new file mode 100644
index 0000000..9dfa3cc
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day11/style.css	
@@ -0,0 +1,162 @@
+html{
+    box-sizing: border-box;
+}
+
+*,*::before,*::after{
+    box-sizing: inherit;
+}
+
+body{
+    margin: 0;
+    padding: 0;
+    display: flex;
+    min-height: 100vh;
+    background: #7A419B;
+    background: linear-gradient(135deg, #7c1599 0%,#921099 48%,#7e4ae8 100%);
+    background-size: cover;
+    align-items: center;
+    justify-content: center;  
+}
+
+.player{
+    max-width: 750px;
+    border: 5px solid rgba(0, 0, 0, 0.2);
+    box-shadow: 0 0 20px rgba(0, 0, 0, 0.2);
+    position: relative;
+    font-size: 0;
+    overflow: hidden;
+}
+
+.player:fullscreen {
+    max-width: none;
+    width: 100%;
+}
+.player:-webkit-full-screen {
+    max-width: none;
+    width: 100%;
+}
+
+.player_video{
+    width: 100%;
+}
+
+
+.player_button {
+    background: transparent;
+    border: 0;
+    line-height: 1;
+    color: white;
+    text-align: center;
+    outline: 0;
+    padding: 0;
+    cursor: pointer;
+    max-width: 100px;
+}
+
+.player_button:focus {
+    border-color: #ffc600;
+}
+
+.player_slider{
+    width: 10px;
+    height: 30px;
+}
+
+.player_controls{
+    display: flex;
+    position: absolute;
+    bottom: 0;
+    width: 100%;
+    transform: translateY(100%) translateY(-5px);
+    transition: all .3s;
+    flex-wrap: wrap;
+    background: rgba(0,0,0,0.1);
+}
+
+.player:hover .player_controls{
+    transform: translateY(0);
+}
+
+.player_controls > * {
+    flex: 1;
+}
+
+.progress {
+    flex: 10;
+    position: relative;
+    display: flex;
+    flex-basis: 100%;
+    height: 5px;
+    transition: height 0.3s;
+    background: rgba(0,0,0,0.5);
+    cursor: pointer;
+}
+.progress:hover{
+    height: 10px;
+}
+.progress_filled {
+    background: #ffc600;
+    flex: 0;
+    flex-basis: 0%;
+}
+
+input[type=range] {
+    -webkit-appearance: none;
+    background: transparent;
+    width: 100%;
+    margin: 0 5px;
+}
+
+input[type=range]:focus {
+outline: none;
+}
+
+input[type='range']:focus{
+    border: 0;
+    outline: none;
+}
+
+input[type=range]::-webkit-slider-runnable-track {
+    width: 100%;
+    height: 3px;
+    cursor: pointer;
+    box-shadow: 1px 1px 1px rgba(0, 0, 0, 0), 0 0 1px rgba(13, 13, 13, 0);
+    background: rgba(255,255,255,0.8);
+    border-radius: 1.3px;
+    border: 0.2px solid rgba(1, 1, 1, 0);
+}
+
+
+input[type=range]::-webkit-slider-thumb {
+    height: 8px;
+    width: 15px;
+    border-radius: 50px;
+    background: #ffc600;
+    cursor: pointer;
+    -webkit-appearance: none;
+    margin-top: -3.5px;
+    box-shadow:0 0 2px rgba(0,0,0,0.2);
+}
+
+input[type=range]:focus::-webkit-slider-runnable-track {
+    background: #bada55;
+}
+
+input[type=range]::-moz-range-track {
+    width: 100%;
+    height: 3px;
+    cursor: pointer;
+    box-shadow: 1px 1px 1px rgba(0, 0, 0, 0), 0 0 1px rgba(13, 13, 13, 0);
+    background: #ffffff;
+    border-radius: 1.3px;
+    border: 0.2px solid rgba(1, 1, 1, 0);
+}
+
+input[type=range]::-moz-range-thumb {
+    box-shadow: 0 0 0 rgba(0, 0, 0, 0), 0 0 0 rgba(13, 13, 13, 0);
+    height: 8px;
+    width: 8px;
+    border-radius: 50px;
+    background: #ffc600;
+    cursor: pointer;
+}
diff --git a/JavaScript Challenges/Javascript 30/Day11/vid.mp4 b/JavaScript Challenges/Javascript 30/Day11/vid.mp4
new file mode 100644
index 0000000..09ed31e
Binary files /dev/null and b/JavaScript Challenges/Javascript 30/Day11/vid.mp4 differ
diff --git a/JavaScript Challenges/Javascript 30/Day12/index.html b/JavaScript Challenges/Javascript 30/Day12/index.html
new file mode 100644
index 0000000..ebdb582
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day12/index.html	
@@ -0,0 +1,25 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Day12 - Key Detection</title>
+</head>
+<body>
+    <script>
+        let pressed = [];
+        let secretCode = "dhiraj";
+        window.addEventListener('keyup', (e) => {
+            // console.log(e.key);
+            pressed.push(e.key);
+            pressed.splice(-secretCode.length -1, pressed.length - secretCode.length);
+            // if(pressed.join('').includes(secretCode))
+            if(pressed.join('') === secretCode)
+            {
+                console.log('you did it!!');
+            }
+            // console.log(pressed);
+        })
+    </script>
+</body>
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day13/index.html b/JavaScript Challenges/Javascript 30/Day13/index.html
new file mode 100644
index 0000000..b42229a
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day13/index.html	
@@ -0,0 +1,149 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Document</title>
+</head>
+<body>
+
+  <div class="site-wrap">
+
+    <h1>Slide in on Scroll</h1>
+
+    <p>Consectetur adipisicing elit. Tempore tempora rerum, est autem cupiditate, corporis a qui libero ipsum delectus quidem dolor at nulla, adipisci veniam in reiciendis aut asperiores omnis blanditiis quod quas laborum nam! Fuga ad tempora in aspernatur pariaturlores sunt esse magni, ut, dignissimos.</p>
+    <p>Lorem ipsum cupiditate, corporis a qui libero ipsum delectus quidem dolor at nulla, adipisci veniam in reiciendis aut asperiores omnis blanditiis quod quas laborum nam! Fuga ad tempora in aspernatur pariatur fugit quibusdam dolores sunt esse magni, ut, dignissimos.</p>
+    <p>Adipisicing elit. Tempore tempora rerum..</p>
+    <p>Lorem ipsum dolor sit amet, consectetur adipisicing elit. Tempore tempora rerum, est autem cupiditate, corporis a qui libero ipsum delectus quidem dolor at nulla, adipisci veniam in reiciendis aut asperiores omnis blanditiis quod quas laborum nam! Fuga ad tempora in aspernatur pariatur fugit quibusdam dolores sunt esse magni, ut, dignissimos.</p>
+    <p>Lorem ipsum dolor sit amet, consectetur adipisicing elit. Tempore tempora rerum, est autem cupiditate, corporis a qui libero ipsum delectus quidem dolor at nulla, adipisci veniam in reiciendis aut asperiores omnis blanditiis quod quas laborum nam! Fuga ad tempora in aspernatur pariatur fugit quibusdam dolores sunt esse magni, ut, dignissimos.</p>
+    <p>Lorem ipsum dolor sit amet, consectetur adipisicing elit. Tempore tempora rerum, est autem cupiditate, corporis a qui libero ipsum delectus quidem dolor at nulla, adipisci veniam in reiciendis aut asperiores omnis blanditiis quod quas laborum nam! Fuga ad tempora in aspernatur pariatur fugit quibusdam dolores sunt esse magni, ut, dignissimos.</p>
+
+    <img src="http://unsplash.it/400/400" class="align-left slide-in">
+
+    <p>Lorem ipsum dolor sit amet, consectetur adipisicing elit. Voluptates, deserunt facilis et iste corrupti omnis tenetur est. Iste ut est dicta dolor itaque adipisci, dolorum minima, veritatis earum provident error molestias. Ratione magni illo sint vel velit ut excepturi consectetur suscipit, earum modi accusamus voluptatem nostrum, praesentium numquam, reiciendis voluptas sit id quisquam. Consequatur in quis reprehenderit modi perspiciatis necessitatibus saepe, quidem, suscipit iure natus dignissimos ipsam, eligendi deleniti accusantium, rerum quibusdam fugit perferendis et optio recusandae sed ratione. Culpa, dolorum reprehenderit harum ab voluptas fuga, nisi eligendi natus maiores illum quas quos et aperiam aut doloremque optio maxime fugiat doloribus. Eum dolorum expedita quam, nesciunt</p>
+
+    <img src="http://unsplash.it/400/401" class="align-right slide-in">
+
+    <p> at provident praesentium atque quas rerum optio dignissimos repudiandae ullam illum quibusdam. Vel ad error quibusdam, illo ex totam placeat. Quos excepturi fuga, molestiae ea quisquam minus, ratione dicta consectetur officia omnis, doloribus voluptatibus? Veniam ipsum veritatis architecto, provident quas consequatur doloremque quam quidem earum expedita, ad delectus voluptatum, omnis praesentium nostrum qui aspernatur ea eaque adipisci et cumque ab? Ea voluptatum dolore itaque odio. Eius minima distinctio harum, officia ab nihil exercitationem. Tempora rem nemo nam temporibus molestias facilis minus ipsam quam doloribus consequatur debitis nesciunt tempore officiis aperiam quisquam, molestiae voluptates cum, fuga culpa. Distinctio accusamus quibusdam, tempore perspiciatis dolorum optio facere consequatur quidem ullam beatae architecto, ipsam sequi officiis dignissimos amet impedit natus necessitatibus tenetur repellendus dolor rem! Dicta dolorem, iure, facilis illo ex nihil ipsa amet officia, optio temporibus eum autem odit repellendus nisi. Possimus modi, corrupti error debitis doloribus dicta libero earum, sequi porro ut excepturi nostrum ea voluptatem nihil culpa? Ullam expedita eligendi obcaecati reiciendis velit provident omnis quas qui in corrupti est dolore facere ad hic, animi soluta assumenda consequuntur reprehenderit! Voluptate dolor nihil veniam laborum voluptas nisi pariatur sed optio accusantium quam consectetur, corrupti, sequi et consequuntur, excepturi doloremque. Tempore quis velit corporis neque fugit non sequi eaque rem hic. Facere, inventore, aspernatur. Accusantium modi atque, asperiores qui nobis soluta cumque suscipit excepturi possimus doloremque odit saepe perferendis temporibus molestiae nostrum voluptatum quis id sint quidem nesciunt culpa. Rerum labore dolor beatae blanditiis praesentium explicabo velit optio esse aperiam similique, voluptatem cum, maiores ipsa tempore. Reiciendis sed culpa atque inventore, nam ullam enim expedita consectetur id velit iusto alias vitae explicabo nemo neque odio reprehenderit soluta sint eaque. Aperiam, qui ut tenetur, voluptate doloremque officiis dicta quaerat voluptatem rerum natus magni. Eum amet autem dolor ullam.</p>
+
+    <img src="http://unsplash.it/200/500" class="align-left slide-in">
+
+    <p>Lorem ipsum dolor sit amet, consectetur adipisicing elit. Distinctio maiores adipisci quibusdam repudiandae dolor vero placeat esse sit! Quibusdam saepe aperiam explicabo placeat optio, consequuntur nihil voluptatibus expedita quia vero perferendis, deserunt et incidunt eveniet <img src="http://unsplash.it/200/200" class="align-right slide-in"> temporibus doloremque possimus facilis. Possimus labore, officia dolore! Eaque ratione saepe, alias harum laboriosam deserunt laudantium blanditiis eum explicabo placeat reiciendis labore iste sint. Consectetur expedita dignissimos, non quos distinctio, eos rerum facilis eligendi. Asperiores laudantium, rerum ratione consequatur, culpa consectetur possimus atque ab tempore illum non dolor nesciunt. Neque, rerum. A vel non incidunt, quod doloremque dignissimos necessitatibus aliquid laboriosam architecto at cupiditate commodi expedita in, quae blanditiis. Deserunt labore sequi, repellat laboriosam est, doloremque culpa reiciendis tempore excepturi. Enim nostrum fugit itaque vel corporis ullam sed tenetur ipsa qui rem quam error sint, libero. Laboriosam rem, ratione. Autem blanditiis</p>
+
+
+    <p>laborum neque repudiandae quam, cumque, voluptate veritatis itaque, placeat veniam ad nisi. Expedita, laborum reprehenderit ratione soluta velit natus, odit mollitia. Corporis rerum minima fugiat in nostrum. Assumenda natus cupiditate hic quidem ex, quas, amet ipsum esse dolore facilis beatae maxime qui inventore, iste? Maiores dignissimos dolore culpa debitis voluptatem harum, excepturi enim reiciendis, tempora ab ipsam illum aspernatur quasi qui porro saepe iure sunt eligendi tenetur quaerat ducimus quas sequi omnis aperiam suscipit! Molestiae obcaecati officiis quo, ratione eveniet, provident pariatur. Veniam quasi expedita distinctio, itaque molestiae sequi, dolorum nisi repellendus quia facilis iusto dignissimos nam? Tenetur fugit quos autem nihil, perspiciatis expedita enim tempore, alias ab maiores quis necessitatibus distinctio molestias eum, quidem. Delectus impedit quidem laborum, fugit vel neque quo, ipsam, quasi aspernatur quas odio nihil? Veniam amet reiciendis blanditiis quis reprehenderit repudiandae neque, ab ducimus, odit excepturi voluptate saepe ipsam. Voluptatem eum error voluptas porro officiis, amet! Molestias, fugit, ut! Tempore non magnam, amet, facere ducimus accusantium eos veritatis neque.</p>
+
+    <img src="http://unsplash.it/400/400" class="align-right slide-in">
+
+    <p>Lorem ipsum dolor sit amet, consectetur adipisicing elit. Distinctio maiores adipisci quibusdam repudiandae dolor vero placeat esse sit! Quibusdam saepe aperiam explicabo placeat optio, consequuntur nihil voluptatibus expedita quia vero perferendis, deserunt et incidunt eveniet temporibus doloremque possimus facilis. Possimus labore, officia dolore! Eaque ratione saepe, alias harum laboriosam deserunt laudantium blanditiis eum explicabo placeat reiciendis labore iste sint. Consectetur expedita dignissimos, non quos distinctio, eos rerum facilis eligendi. Asperiores laudantium, rerum ratione consequatur, culpa consectetur possimus atque ab tempore illum non dolor nesciunt. Neque, rerum. A vel non incidunt, quod doloremque dignissimos necessitatibus aliquid laboriosam architecto at cupiditate commodi expedita in, quae blanditiis. Deserunt labore sequi, repellat laboriosam est, doloremque culpa reiciendis tempore excepturi. Enim nostrum fugit itaque vel corporis ullam sed tenetur ipsa qui rem quam error sint, libero. Laboriosam rem, ratione. Autem blanditiis laborum neque repudiandae quam, cumque, voluptate veritatis itaque, placeat veniam ad nisi. Expedita, laborum reprehenderit ratione soluta velit natus, odit mollitia. Corporis rerum minima fugiat in nostrum. Assumenda natus cupiditate hic quidem ex, quas, amet ipsum esse dolore facilis beatae maxime qui inventore, iste? Maiores dignissimos dolore culpa debitis voluptatem harum, excepturi enim reiciendis, tempora ab ipsam illum aspernatur quasi qui porro saepe iure sunt eligendi tenetur quaerat ducimus quas sequi omnis aperiam suscipit! Molestiae obcaecati officiis quo, ratione eveniet, provident pariatur. Veniam quasi expedita distinctio, itaque molestiae sequi, dolorum nisi repellendus quia facilis iusto dignissimos nam? Tenetur fugit quos autem nihil, perspiciatis expedita enim tempore, alias ab maiores quis necessitatibus distinctio molestias eum, quidem. Delectus impedit quidem laborum, fugit vel neque quo, ipsam, quasi aspernatur quas odio nihil? Veniam amet reiciendis blanditiis quis reprehenderit repudiandae neque, ab ducimus, odit excepturi voluptate saepe ipsam. Voluptatem eum error voluptas porro officiis, amet! Molestias, fugit, ut! Tempore non magnam, amet, facere ducimus accusantium eos veritatis neque.</p>
+    <p>Lorem ipsum dolor sit amet, consectetur adipisicing elit. Distinctio maiores adipisci quibusdam repudiandae dolor vero placeat esse sit! Quibusdam saepe aperiam explicabo placeat optio, consequuntur nihil voluptatibus expedita quia vero perferendis, deserunt et incidunt eveniet temporibus doloremque possimus facilis. Possimus labore, officia dolore! Eaque ratione saepe, alias harum laboriosam deserunt laudantium blanditiis eum explicabo placeat reiciendis labore iste sint. Consectetur expedita dignissimos, non quos distinctio, eos rerum facilis eligendi. Asperiores laudantium, rerum ratione consequatur, culpa consectetur possimus atque ab tempore illum non dolor nesciunt. Neque, rerum. A vel non incidunt, quod doloremque dignissimos necessitatibus aliquid laboriosam architecto at cupiditate commodi expedita in, quae blanditiis. Deserunt labore sequi, repellat laboriosam est, doloremque culpa reiciendis tempore excepturi. Enim nostrum fugit itaque vel corporis ullam sed tenetur ipsa qui rem quam error sint, libero. Laboriosam rem, ratione. Autem blanditiis laborum neque repudiandae quam, cumque, voluptate veritatis itaque, placeat veniam ad nisi. Expedita, laborum reprehenderit ratione soluta velit natus, odit mollitia. Corporis rerum minima fugiat in nostrum. Assumenda natus cupiditate hic quidem ex, quas, amet ipsum esse dolore facilis beatae maxime qui inventore, iste? Maiores dignissimos dolore culpa debitis voluptatem harum, excepturi enim reiciendis, tempora ab ipsam illum aspernatur quasi qui porro saepe iure sunt eligendi tenetur quaerat ducimus quas sequi omnis aperiam suscipit! Molestiae obcaecati officiis quo, ratione eveniet, provident pariatur. Veniam quasi expedita distinctio, itaque molestiae sequi, dolorum nisi repellendus quia facilis iusto dignissimos nam? Tenetur fugit quos autem nihil, perspiciatis expedita enim tempore, alias ab maiores quis necessitatibus distinctio molestias eum, quidem. Delectus impedit quidem laborum, fugit vel neque quo, ipsam, quasi aspernatur quas odio nihil? Veniam amet reiciendis blanditiis quis reprehenderit repudiandae neque, ab ducimus, odit excepturi voluptate saepe ipsam. Voluptatem eum error voluptas porro officiis, amet! Molestias, fugit, ut! Tempore non magnam, amet, facere ducimus accusantium eos veritatis neque.</p>
+
+
+
+
+  </div>
+
+  <script>
+    function debounce(func, wait = 20, immediate = true) {
+      var timeout;
+      return function() {
+        var context = this, args = arguments;
+        var later = function() {
+          timeout = null;
+          if (!immediate) func.apply(context, args);
+        };
+        var callNow = immediate && !timeout;
+        clearTimeout(timeout);
+        timeout = setTimeout(later, wait);
+        if (callNow) func.apply(context, args);
+      };
+    };
+
+    const sliderImages = document.querySelectorAll('.slide-in');
+
+    function checkSlide() {
+      sliderImages.forEach(sliderImage => {
+        // half way through the image
+        const slideInAt = (window.scrollY + window.innerHeight) - sliderImage.height/2 ;
+
+        // bottom of the image
+        const imageBottom = sliderImage.offsetTop + sliderImage.height;
+        
+        // when the bottom of the page crosses mid of the image
+        const isHalfShown = slideInAt > sliderImage.offsetTop;
+
+        // when top of the window crosses the image, means image is out of view
+        const isNotScrolledPast = window.scrollY < imageBottom;
+
+        if (isHalfShown && isNotScrolledPast) {
+          sliderImage.classList.add('active');
+        } else {
+          sliderImage.classList.remove('active');
+        }
+      });
+    }
+
+    window.addEventListener('scroll', debounce(checkSlide));
+
+  </script>
+
+  <style>
+    html {
+      box-sizing: border-box;
+      background: #ffc600;
+      font-family: 'helvetica neue';
+      font-size: 20px;
+      font-weight: 200;
+    }
+    
+    body {
+      margin: 0;
+    }
+    
+    *, *:before, *:after {
+      box-sizing: inherit;
+    }
+
+    h1 {
+      margin-top: 0;
+    }
+
+    .site-wrap {
+      max-width: 700px;
+      margin: 100px auto;
+      background: white;
+      padding: 40px;
+      text-align: justify;
+    }
+
+    .align-left {
+      float: left;
+      margin-right: 20px;
+    }
+
+    .align-right {
+      float: right;
+      margin-left: 20px;
+    }
+
+    .slide-in {
+      opacity: 0;
+      transition: all .5s;
+    }
+
+    .align-left.slide-in {
+      transform: translateX(-30%) scale(0.95);
+    }
+    
+    .align-right.slide-in {
+      transform: translateX(30%) scale(0.95);
+    }
+
+    .slide-in.active {
+      opacity: 1;
+      transform: translateX(0%) scale(1);
+    }
+
+  </style>
+
+</body>
+</html>
diff --git a/JavaScript Challenges/Javascript 30/Day14/index.html b/JavaScript Challenges/Javascript 30/Day14/index.html
new file mode 100644
index 0000000..83a4c08
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day14/index.html	
@@ -0,0 +1,65 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Day14 - JS Reference vs Copy</title>
+</head>
+<body>
+
+  <script>
+    let age = 100;
+    let h2 = age;
+    console.log(age, h2); // 100 100
+    age = 200; 
+    console.log(age, h2); // 200 100
+    // means for strings, numbers and bools even if we change the original variable, copied variable will not change
+
+
+    const players = ['Wes', 'Sarah', 'Ryan', 'Poppy'];
+    const team = players;
+
+    console.log(players, team);
+    team[2] = 'Lux';
+    console.log(players, team);
+    // here both the arrays change. means team created here is not a copy but a reference of players array and when anyone of them change, they reference back and change each other
+    // both of these point to same array and thus both of these change
+
+    // but sometimes we don;t want to change the original one, so how to take a copy:
+    // method 1
+    let team2 = players.slice();
+
+    // method2
+    let team3 = [].concat(players);
+
+    // method3
+    let team4 = [...players];
+    
+    // method4
+    let team5 = Array.from(players);
+
+
+    // The same thing happens with objects
+    const person = {
+      name: 'Danny',
+      age: 80,
+      social: {
+          insta: "abc",
+          fb: "abc"
+      }
+    };
+
+    const person2 = Object.assign({}, person, { age: 70 });
+    person2.lang = "english";
+
+    const person3 = {...person}
+
+    // note one thing that these things work only one level deep. that is if we are changing the name, of the copy object then original object will not change. 
+    // But if we change the onject inside the copy object (i.e social obj) then it would surely change in original object too
+
+    // too overcome the above situation we have one solution
+
+    let person4 = JSON.parse(JSON.stringify(person));
+  </script>
+
+</body>
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day15/bg.jpeg b/JavaScript Challenges/Javascript 30/Day15/bg.jpeg
new file mode 100644
index 0000000..404dd52
Binary files /dev/null and b/JavaScript Challenges/Javascript 30/Day15/bg.jpeg differ
diff --git a/JavaScript Challenges/Javascript 30/Day15/index.html b/JavaScript Challenges/Javascript 30/Day15/index.html
new file mode 100644
index 0000000..e0eca00
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day15/index.html	
@@ -0,0 +1,76 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <link rel="stylesheet" href="style.css">  
+    <title>Day 15</title>
+</head>
+<body>
+    
+    <svg xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" version="1.1" x="0px" y="0px" viewBox="0 0 512 512" enable-background="new 0 0 512 512" xml:space="preserve"><g><path d="M495.9,425.3H16.1c-5.2,0-10.1,2.9-12.5,7.6c-2.4,4.7-2.1,10.3,0.9,14.6l39,56.4c2.6,3.8,7,6.1,11.6,6.1h401.7   c4.6,0,9-2.3,11.6-6.1l39-56.4c3-4.3,3.3-9.9,0.9-14.6C506,428.2,501.1,425.3,495.9,425.3z M449.4,481.8H62.6L43,453.6H469   L449.4,481.8z"/><path d="M158.3,122c7.8,0,14.1-6.3,14.1-14.1V43.4c0-7.8-6.3-14.1-14.1-14.1c-7.8,0-14.1,6.3-14.1,14.1v64.5   C144.2,115.7,150.5,122,158.3,122z"/><path d="M245.1,94.7c7.8,0,14.1-6.3,14.1-14.1V16.1c0-7.8-6.3-14.1-14.1-14.1C237.3,2,231,8.3,231,16.1v64.5   C231,88.4,237.3,94.7,245.1,94.7z"/><path d="M331.9,122c7.8,0,14.1-6.3,14.1-14.1V43.4c0-7.8-6.3-14.1-14.1-14.1s-14.1,6.3-14.1,14.1v64.5   C317.8,115.7,324.1,122,331.9,122z"/><path d="M9.6,385.2c5.3,2.8,11.8,1.9,16.2-2.2l50.6-47.7c56.7,46.5,126.6,71.9,198.3,71.9c0,0,0,0,0,0   c87.5,0,169.7-36.6,231.4-103.2c5-5.4,5-13.8,0-19.2c-61.8-66.5-144-103.2-231.4-103.2c-72,0-142.2,25.6-199,72.5l-50-47.1   c-4.4-4.1-10.9-5-16.2-2.2c-5.3,2.8-8.3,8.7-7.4,14.6l11.6,75L2.2,370.6C1.3,376.5,4.2,382.4,9.6,385.2z M380.9,230.8   c34.9,14.3,67.2,35.7,95.3,63.6c-10.1,10-20.8,19.2-31.9,27.5c-22.4-3.3-29.6-8.8-30.7-9.7c-4-5.7-11.8-7.7-18.1-4.4   c-6.9,3.6-9.5,12.2-5.9,19.1c1.9,3.5,7.3,10.3,22.4,16c-10.1,5.7-20.5,10.7-31.1,15.1C352.4,320.2,352.4,268.6,380.9,230.8z    M36.3,255.6l29.4,27.7c5.3,5,13.6,5.1,19.1,0.3c53.2-47.6,120.7-73.7,190-73.7c26.9,0,53.2,3.9,78.5,11.3   c-29.3,44.6-29.3,102,0,146.6c-25.3,7.4-51.6,11.3-78.5,11.3c-69,0-136.3-26-189.4-73.2c-2.7-2.4-13.4-6.3-19.1,0.3l-30.1,28.3   l5.7-40C42.2,293,36.3,255.6,36.3,255.6z"/><circle cx="398.8" cy="273.8" r="14.1"/></g></svg>
+    
+    <div class="wrapper">
+        <h2>LOCAL TAPAS</h2>
+        <p></p>
+        <ul class="plates">
+          <li>Loading Tapas...</li>
+        </ul>
+        <form class="add-items">
+          <input type="text" name="item" placeholder="Item Name" required>
+          <input type="submit" value="+ Add Item">
+        </form>
+    </div>
+
+    <script>
+        const addItems = document.querySelector('.add-items');
+        const itemsList = document.querySelector('.plates');
+        const items = JSON.parse(localStorage.getItem('items')) || [];
+
+        function addItem(e) 
+        {
+            e.preventDefault();
+            
+            const text = this.querySelector('[name=item]')
+            const item = {
+                text: text.value,
+                done: false
+            }
+
+            items.push(item);
+            populateList(items, itemsList);
+            localStorage.setItem('items', JSON.stringify(items));
+            this.reset();
+        }
+
+        function populateList(plates = [], platesList)
+        {
+            platesList.innerHTML = plates.map((plate,i) => {
+                        // <input tpye="checkbox" data-index=${i} id="item${i}" ${plate.done?'checked':''}/>
+                return `
+                    <li>
+                        <input type="checkbox" data-index=${i} id="item${i}" ${plate.done ? 'checked' : ''}/>
+                        <label for="item${i}">${plate.text}</label>
+                    </li>
+                `;
+            }).join('');
+        }
+
+        function toggleDone(e)
+        {
+            if(!e.target.matches('input')) return;
+            
+            const index = e.target.dataset.index;
+            items[index].done = !items[index].done;
+            localStorage.setItem('items', JSON.stringify(items));
+            populateList(items, itemsList);
+        }
+
+        
+
+        addItems.addEventListener('submit', addItem);
+        itemsList.addEventListener('click', toggleDone)
+        populateList(items, itemsList);
+    </script>
+</body>
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day15/style.css b/JavaScript Challenges/Javascript 30/Day15/style.css
new file mode 100644
index 0000000..d689a36
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day15/style.css	
@@ -0,0 +1,94 @@
+html{
+    box-sizing: border-box;
+    background: url('bg.jpeg') center no-repeat;
+    background-size: cover;
+    min-height: 100vh;
+    display: flex;
+    justify-content: center;
+    /* align-items: center; */
+    text-align: center;
+    font-family: Futura, "Trebuchet MS", Arial, sans-serif;
+}
+
+
+*, *:before, *:after {
+  box-sizing: inherit;
+}
+
+svg {
+    fill: white;
+    background: rgba(0, 0, 0, 0.4);
+    padding: 20px;
+    border-radius: 50%;
+    width: 200px;
+    margin-bottom: 50px;
+}
+
+.wrapper{
+    padding: 20px;
+    max-width: 350px;
+    background-color: rgba(255,255,255,0.95);
+    box-shadow: 0 0 0 10px rgba(0, 0, 0, 0.3);
+}
+
+h2{
+    text-align: center;
+    margin: 0;
+    font-weight: 200;
+}
+
+.plates {
+    margin: 0;
+    padding: 0;
+    text-align: left;
+    list-style: none;
+}
+
+.plates li{
+    border-bottom: 1px solid rgba(0, 0, 0, 0.2);
+    padding: 10px 0;
+    font-weight: 100;
+    display: flex;
+}
+
+.plates label {
+    flex: 1;
+    cursor: pointer;
+}
+
+.plates input {
+    display: none;
+}
+
+.plates input + label::before {
+    content: "⬜";
+    margin-right: 10px;
+}
+
+.plates input:checked + label::before {
+    content: "🍔";
+}
+
+.add-items {
+    margin-top: 20px;
+}
+
+.add-items input {
+    padding: 10px;
+    outline: 0;
+    border: 1px solid rgba(0, 0, 0, 0.1);
+}
+
+.add-items input[type="submit"]{
+    background-color: grey;
+    color: black;
+    border: 2px solid balck;
+    border-radius: 7px;
+    font-weight: 400;
+    font-size: 15px;
+}
+
+.add-items input[type="submit"]:hover{
+    background-color: black;
+    color: white;
+}
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day15/try.html b/JavaScript Challenges/Javascript 30/Day15/try.html
new file mode 100644
index 0000000..174b023
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day15/try.html	
@@ -0,0 +1,65 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <link rel="stylesheet" href="style.css">  
+    <title>Day 15</title>
+</head>
+<body>
+    
+    <svg xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" version="1.1" x="0px" y="0px" viewBox="0 0 512 512" enable-background="new 0 0 512 512" xml:space="preserve"><g><path d="M495.9,425.3H16.1c-5.2,0-10.1,2.9-12.5,7.6c-2.4,4.7-2.1,10.3,0.9,14.6l39,56.4c2.6,3.8,7,6.1,11.6,6.1h401.7   c4.6,0,9-2.3,11.6-6.1l39-56.4c3-4.3,3.3-9.9,0.9-14.6C506,428.2,501.1,425.3,495.9,425.3z M449.4,481.8H62.6L43,453.6H469   L449.4,481.8z"/><path d="M158.3,122c7.8,0,14.1-6.3,14.1-14.1V43.4c0-7.8-6.3-14.1-14.1-14.1c-7.8,0-14.1,6.3-14.1,14.1v64.5   C144.2,115.7,150.5,122,158.3,122z"/><path d="M245.1,94.7c7.8,0,14.1-6.3,14.1-14.1V16.1c0-7.8-6.3-14.1-14.1-14.1C237.3,2,231,8.3,231,16.1v64.5   C231,88.4,237.3,94.7,245.1,94.7z"/><path d="M331.9,122c7.8,0,14.1-6.3,14.1-14.1V43.4c0-7.8-6.3-14.1-14.1-14.1s-14.1,6.3-14.1,14.1v64.5   C317.8,115.7,324.1,122,331.9,122z"/><path d="M9.6,385.2c5.3,2.8,11.8,1.9,16.2-2.2l50.6-47.7c56.7,46.5,126.6,71.9,198.3,71.9c0,0,0,0,0,0   c87.5,0,169.7-36.6,231.4-103.2c5-5.4,5-13.8,0-19.2c-61.8-66.5-144-103.2-231.4-103.2c-72,0-142.2,25.6-199,72.5l-50-47.1   c-4.4-4.1-10.9-5-16.2-2.2c-5.3,2.8-8.3,8.7-7.4,14.6l11.6,75L2.2,370.6C1.3,376.5,4.2,382.4,9.6,385.2z M380.9,230.8   c34.9,14.3,67.2,35.7,95.3,63.6c-10.1,10-20.8,19.2-31.9,27.5c-22.4-3.3-29.6-8.8-30.7-9.7c-4-5.7-11.8-7.7-18.1-4.4   c-6.9,3.6-9.5,12.2-5.9,19.1c1.9,3.5,7.3,10.3,22.4,16c-10.1,5.7-20.5,10.7-31.1,15.1C352.4,320.2,352.4,268.6,380.9,230.8z    M36.3,255.6l29.4,27.7c5.3,5,13.6,5.1,19.1,0.3c53.2-47.6,120.7-73.7,190-73.7c26.9,0,53.2,3.9,78.5,11.3   c-29.3,44.6-29.3,102,0,146.6c-25.3,7.4-51.6,11.3-78.5,11.3c-69,0-136.3-26-189.4-73.2c-2.7-2.4-13.4-6.3-19.1,0.3l-30.1,28.3   l5.7-40C42.2,293,36.3,255.6,36.3,255.6z"/><circle cx="398.8" cy="273.8" r="14.1"/></g></svg>
+    
+    <div class="wrapper">
+        <h2>LOCAL TAPAS</h2>
+        <p></p>
+        <ul class="plates">
+          <li>Loading Tapas...</li>
+        </ul>
+        <form class="add-items">
+          <input type="text" name="item" placeholder="Item Name" required>
+          <input type="submit" value="+ Add Item">
+        </form>
+    </div>
+
+    <script>
+        const addItems = document.querySelector('.add-items');
+        const itemsList = document.querySelector('.plates');
+        const items = JSON.parse(localStorage.getItem('items')) || [];
+
+        function addItem(e) 
+        {
+            e.preventDefault();
+            
+            const text = this.querySelector('[name=item]')
+            const item = {
+                text: text.value,
+                done: false
+            }
+
+            items.push(item);
+            localStorage.setItem('items', JSON.stringify(items));
+            populateList(itemsList);
+            this.reset();
+        }
+
+        function populateList(platesList)
+        {
+            let plates = JSON.parse(localStorage.getItem('items')) || [];
+            platesList.innerHTML = plates.map((plate,i) => {
+                        // <input tpye="checkbox" data-index=${i} id="item${i}" ${plate.done?'checked':''}/>
+                return `
+                    <li>
+                        <input type="checkbox" data-index=${i} id="item${i}" checked/>
+                        <label for="item${i}">${plate.text}</label>
+                    </li>
+                `;
+            }).join('');
+        }
+
+        addItems.addEventListener('submit', addItem);
+
+        populateList(itemsList);
+    </script>
+</body>
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day16/index.html b/JavaScript Challenges/Javascript 30/Day16/index.html
new file mode 100644
index 0000000..dd59ecd
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day16/index.html	
@@ -0,0 +1,67 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Day 16 - MouseMove</title>
+    <style>
+        html{
+            color: black;
+            font-family: sans-serif;
+        }
+        body{
+            margin: 0;
+        }
+        .hero{
+            min-height: 100vh;
+            display: flex;
+            justify-content: center;
+            align-items: center;
+            color: black;
+        }
+        h1{
+            /* transition: text-shadow 0.1s; */
+            text-shadow: 10px 10px 0 rgba(0, 0, 0, 1);
+        }
+    </style>
+</head>
+<body>
+    <div class="hero">
+        <h1 contenteditable>🔥WOAH!</h1>
+    </div>
+
+    <script>
+        let hero = document.querySelector('.hero');
+        let text = document.querySelector('h1');
+        const walk = 500;
+
+        function shadow(e)
+        {
+            // let width = hero.offsetWidth;
+            // let height = hero.offsetHeight;
+            const { offsetHeight: height, offsetWidth: width } = hero;
+
+            let { offsetX: x, offsetY: y } = e;
+
+            if(this !== e.target) //if mouse moves over child elements. we are doing this because when mouse moves over child element, then offsetx and offsety change
+            {
+                x = x + e.target.offsetLeft;
+                y = y + e.target.offsetTop;
+            }
+
+            let xWalk = Math.round(( x / width * walk ) - ( walk / 2 ));
+            //        (values from 0 to 1) * 100  -  50 . so we get values from -50 to 50. 
+            let yWalk = Math.round(( y / height * walk ) - ( walk / 2 ));
+
+            text.style.textShadow = `
+                ${xWalk}px ${yWalk}px 0 rgba(255, 0, 255, 0.7),
+                ${xWalk * -1}px ${yWalk}px 0 rgba(0, 255, 255, 0.7),
+                ${xWalk}px ${yWalk * -1}px 0 rgba(255, 255, 0, 0.7),
+                ${xWalk * -1}px ${yWalk * -1}px 0 rgba(0, 0, 0, 0.7)
+            `;
+        } 
+
+        hero.addEventListener('mousemove', shadow)
+    </script>
+</body>
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day17/index.html b/JavaScript Challenges/Javascript 30/Day17/index.html
new file mode 100644
index 0000000..2992df1
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day17/index.html	
@@ -0,0 +1,65 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Day - 17</title>
+    <style>
+        body {
+          margin: 0;
+          font-family: sans-serif;
+          background: url("https://source.unsplash.com/nDqA4d5NL0k/2000x2000");
+          background-size: cover;
+          display: flex;
+          align-items: center;
+          min-height: 100vh;
+        }
+    
+        #bands {
+          list-style: inside square;
+          font-size: 20px;
+          background: white;
+          width: 500px;
+          margin: auto;
+          padding: 0;
+          box-shadow: 0 0 0 20px rgba(0, 0, 0, 0.05);
+        }
+        
+        #bands li {
+          border-bottom: 1px solid #efefef;
+          padding: 20px;
+        }
+        
+        #bands li:last-child {
+          border-bottom: 0;
+        }
+    
+        a {
+          color: #ffc600;
+          text-decoration: none;
+        }
+    
+    </style>
+    
+</head>
+<body>
+    <ul id="bands"></ul>
+
+
+    <script>
+
+        const bands = ['The Plot in You', 'The Devil Wears Prada', 'Pierce the Veil', 'Norma Jean', 'The Bled', 'Say Anything', 'The Midway State', 'We Came as Romans', 'Counterparts', 'Oh, Sleeper', 'A Skylit Drive', 'Anywhere But Here', 'An Old Dog'];
+        
+        function strip(bandName)
+        {
+            // remove the articles at beginning i.e remobe a, an, the ubt takecare that an should not be removed from words like 'anything'.
+            return bandName.replace(/^(a | an | the)/i, '').trim();
+        }
+
+        const sortedBands = bands.sort( (a, b) => strip(a) > strip(b) ? 1 : -1 );
+
+        document.querySelector('#bands').innerHTML = sortedBands.map( band => `<li>${band}</li>`).join('');
+        
+    </script>
+</body>
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day18/index.html b/JavaScript Challenges/Javascript 30/Day18/index.html
new file mode 100644
index 0000000..35c8ccf
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day18/index.html	
@@ -0,0 +1,210 @@
+<!DOCTYPE html>
+<html lang="en">
+
+<head>
+    <meta charset="UTF-8">
+    <title>Videos</title>
+</head>
+
+<body>
+    <ul class="videos">
+        <li data-time="5:43">
+            Video 1
+        </li>
+        <li data-time="2:33">
+            Video 2
+        </li>
+        <li data-time="3:45">
+            Video 3
+        </li>
+        <li data-time="0:47">
+            Video 4
+        </li>
+        <li data-time="5:21">
+            Video 5
+        </li>
+        <li data-time="6:56">
+            Video 6
+        </li>
+        <li data-time="3:46">
+            Video 7
+        </li>
+        <li data-time="5:25">
+            Video 8
+        </li>
+        <li data-time="3:14">
+            Video 9
+        </li>
+        <li data-time="3:31">
+            Video 10
+        </li>
+        <li data-time="5:59">
+            Video 11
+        </li>
+        <li data-time="3:07">
+            Video 12
+        </li>
+        <li data-time="11:29">
+            Video 13
+        </li>
+        <li data-time="8:57">
+            Video 14
+        </li>
+        <li data-time="5:49">
+            Video 15
+        </li>
+        <li data-time="5:52">
+            Video 16
+        </li>
+        <li data-time="5:50">
+            Video 17
+        </li>
+        <li data-time="9:13">
+            Video 18
+        </li>
+        <li data-time="11:51">
+            Video 19
+        </li>
+        <li data-time="7:58">
+            Video 20
+        </li>
+        <li data-time="4:40">
+            Video 21
+        </li>
+        <li data-time="4:45">
+            Video 22
+        </li>
+        <li data-time="6:46">
+            Video 23
+        </li>
+        <li data-time="7:24">
+            Video 24
+        </li>
+        <li data-time="7:12">
+            Video 25
+        </li>
+        <li data-time="5:23">
+            Video 26
+        </li>
+        <li data-time="3:34">
+            Video 27
+        </li>
+        <li data-time="8:22">
+            Video 28
+        </li>
+        <li data-time="5:17">
+            Video 29
+        </li>
+        <li data-time="3:10">
+            Video 30
+        </li>
+        <li data-time="4:43">
+            Video 31
+        </li>
+        <li data-time="19:43">
+            Video 32
+        </li>
+        <li data-time="0:47">
+            Video 33
+        </li>
+        <li data-time="0:47">
+            Video 34
+        </li>
+        <li data-time="3:14">
+            Video 35
+        </li>
+        <li data-time="3:59">
+            Video 36
+        </li>
+        <li data-time="2:43">
+            Video 37
+        </li>
+        <li data-time="4:17">
+            Video 38
+        </li>
+        <li data-time="6:56">
+            Video 39
+        </li>
+        <li data-time="3:05">
+            Video 40
+        </li>
+        <li data-time="2:06">
+            Video 41
+        </li>
+        <li data-time="1:59">
+            Video 42
+        </li>
+        <li data-time="1:49">
+            Video 43
+        </li>
+        <li data-time="3:36">
+            Video 44
+        </li>
+        <li data-time="7:10">
+            Video 45
+        </li>
+        <li data-time="3:44">
+            Video 46
+        </li>
+        <li data-time="3:44">
+            Video 47
+        </li>
+        <li data-time="4:36">
+            Video 48
+        </li>
+        <li data-time="3:16">
+            Video 49
+        </li>
+        <li data-time="1:10">
+            Video 50
+        </li>
+        <li data-time="6:10">
+            Video 51
+        </li>
+        <li data-time="2:14">
+            Video 52
+        </li>
+        <li data-time="3:44">
+            Video 53
+        </li>
+        <li data-time="5:05">
+            Video 54
+        </li>
+        <li data-time="6:03">
+            Video 55
+        </li>
+        <li data-time="12:39">
+            Video 56
+        </li>
+        <li data-time="1:56">
+            Video 57
+        </li>
+        <li data-time="4:04">
+            Video 58
+        </li>
+    </ul>
+
+    <script>
+        const timeNodes = Array.from(document.querySelectorAll('[data-time'));
+
+        const seconds = timeNodes
+        .map( node => node.dataset.time )
+        .map( timeCode => {
+            const [mins, secs] = timeCode.split(':').map(parseFloat);
+
+            return ( mins * 60 ) + secs;
+        } )
+        .reduce( (total, vidTime) => total + vidTime )
+
+        let secondsLeft = seconds;
+        const hours = Math.floor( secondsLeft / 3600 ) ;
+        secondsLeft = secondsLeft % 3600 ;
+        const minutes = Math.floor( secondsLeft / 60 ) ;
+        secondsLeft = secondsLeft % 60 ;
+
+        console.log(`${hours} : ${minutes}: ${secondsLeft}`);
+
+    </script>
+</body>
+
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day19/index.html b/JavaScript Challenges/Javascript 30/Day19/index.html
new file mode 100644
index 0000000..852221e
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day19/index.html	
@@ -0,0 +1,47 @@
+<!DOCTYPE html>
+<html lang="en">
+
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Day 19</title>
+    <link rel="stylesheet" href="style.css">
+</head>
+
+<body>
+
+    <div class="photobooth">
+        
+        <div class="controls">
+            <button onClick="takePhoto()">Take Photo</button>
+            <div class="rgb">
+                <label for="rmin">Red Min:</label>
+                <input type="range" min=0 max=255 name="rmin">
+                <label for="rmax">Red Max:</label>
+                <input type="range" min=0 max=255 name="rmax">
+                <br>
+                <label for="gmin">Green Min:</label>
+                <input type="range" min=0 max=255 name="gmin">
+                <label for="gmax">Green Max:</label>
+                <input type="range" min=0 max=255 name="gmax">
+                <br>
+                <label for="bmin">Blue Min:</label>
+                <input type="range" min=0 max=255 name="bmin">
+                <label for="bmax">Blue Max:</label>
+                <input type="range" min=0 max=255 name="bmax">
+            </div>
+        </div>
+
+        <canvas class="photo"></canvas>
+
+        <video class="player"></video>
+        
+        
+    </div>
+    <div class="strip"></div>
+
+    <audio class="snap" src="./snap.mp3" hidden></audio>
+    <script src="scripts.js"></script>
+</body>
+
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day19/scripts.js b/JavaScript Challenges/Javascript 30/Day19/scripts.js
new file mode 100644
index 0000000..a80def4
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day19/scripts.js	
@@ -0,0 +1,99 @@
+let video = document.querySelector('.player');
+let canvas = document.querySelector('.photo');
+let ctx = canvas.getContext('2d');
+const strip = document.querySelector('.strip');
+const snap = document.querySelector('.snap');
+
+function getVideo() {
+    navigator.mediaDevices.getUserMedia({ video: true, audio: false })
+        .then(localMediaStream => {
+            // console.log(localMediaStream);
+            video.srcObject = localMediaStream;
+            video.play();
+        })
+        .catch(error => {
+            console.log("You have not allowed the camera.", error);
+        })
+}
+
+function paintToCanvas() {
+    const width = video.videoWidth;
+    const height = video.videoHeight;
+
+    canvas.width = width;
+    canvas.height = height;
+
+    return setInterval(() => {
+        ctx.drawImage(video, 0, 0, width, height);
+
+        let pixels = ctx.getImageData(0, 0, width, height);
+        // pixels = redEffect(pixels);
+        // pixels = rgbSplit(pixels);
+        pixels = greenScreen(pixels);
+
+        // ctx.globalAlpha = 0.1;      // ghosting effect
+        // ctx.putImageData(pixels, 0, 0);
+    }, 16);
+}
+
+function redEffect(pixels) {
+    for (let i = 0; i < pixels.data.length; i += 4) {
+        pixels.data[i] = pixels.data[i] + 100;     //red
+        pixels.data[i + 1] = pixels.data[i + 1] - 50;      //green
+        pixels.data[i + 2] = pixels.data[i + 2] * 0.5;     //blue
+    }
+    return pixels;
+}
+
+function rgbSplit(pixels) {
+    for (let i = 0; i < pixels.data.length; i += 4) {
+        pixels.data[i - 150] = pixels.data[i + 0];     //red
+        pixels.data[i + 100] = pixels.data[i + 1];     //green
+        pixels.data[i - 150] = pixels.data[i + 2];     //blue
+    }
+    return pixels;
+}
+
+function greenScreen(pixels) {
+    const levels = {};
+
+    document.querySelectorAll('.rgb input').forEach((input) => {
+        levels[input.name] = input.value;
+    });
+
+    for (i = 0; i < pixels.data.length; i = i + 4) {
+        red = pixels.data[i + 0];
+        green = pixels.data[i + 1];
+        blue = pixels.data[i + 2];
+        alpha = pixels.data[i + 3];
+
+        if (red >= levels.rmin
+            && green >= levels.gmin
+            && blue >= levels.bmin
+            && red <= levels.rmax
+            && green <= levels.gmax
+            && blue <= levels.bmax) {
+            // take it out!
+            pixels.data[i + 3] = 0;
+        }
+    }
+
+    return pixels;
+}
+
+function takePhoto() {
+    snap.currentTime = 0;
+    snap.play();
+
+    const data = canvas.toDataURL('image/jpeg');
+    const link = document.createElement(`a`);
+    link.href = data;
+    link.setAttribute('download', 'me');
+    // link.textContent = 'Download Image';
+    link.innerHTML = `<img src="${data}" alt="That Me!!">`;
+    strip.insertBefore(link, strip.firstChild);
+}
+
+getVideo();
+
+video.addEventListener('canplay', paintToCanvas);
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day19/snap.mp3 b/JavaScript Challenges/Javascript 30/Day19/snap.mp3
new file mode 100644
index 0000000..16a2888
Binary files /dev/null and b/JavaScript Challenges/Javascript 30/Day19/snap.mp3 differ
diff --git a/JavaScript Challenges/Javascript 30/Day19/style.css b/JavaScript Challenges/Javascript 30/Day19/style.css
new file mode 100644
index 0000000..454c59b
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day19/style.css	
@@ -0,0 +1,85 @@
+html {
+    box-sizing: border-box;
+    font-size: 10px;
+    background-color: #ffc600;
+}
+*,*::before,*::after{
+    box-sizing: inherit;
+}
+
+.photobooth{
+    background-color: white;
+    max-width: 150rem;
+    margin: 2rem auto;
+    border-radius: 2px;
+}
+.photobooth:after {
+    content: '';
+    display: block;
+    clear: both;
+}
+
+.controls{
+    position: absolute;
+    right: 0;
+    width: 80%;
+    height: 150px;
+}
+
+.controls button{
+    background-color: black;
+    border: 2px solid black;
+    color: white;
+    border-radius: 4px;
+    padding: 1rem;
+}
+
+.controls button:hover{
+    background-color: white;
+    color: black;
+}
+
+.controls .rgb{
+    display: inline-block;
+    margin: 1rem 15rem;
+    font-size: 16px;
+}
+
+.photo {
+    width: 95%;
+    height: 50vw;
+    float: left;
+    margin-top: 20rem;
+    margin-left: 3rem;
+    border-radius: 20px;
+}
+
+.player {
+    border-radius: 50%;
+    position: absolute;
+    top: 30px;
+    left: 20px;
+    width:200px;
+}
+
+.strip {
+    background-color: white;
+    width: 100%;
+    height: auto;
+    border-radius: 10px;
+    padding: 2rem;
+}
+
+.strip img {
+    width: 100px;
+    overflow-x: scroll;
+    padding: 0.8rem 0.8rem 2.5rem 0.8rem;
+    box-shadow: 0 0 3px rgba(0,0,0,0.2);
+    background: white;
+}
+
+.strip a:nth-child(5n+1) img { transform: rotate(10deg); }
+.strip a:nth-child(5n+2) img { transform: rotate(-2deg); }
+.strip a:nth-child(5n+3) img { transform: rotate(8deg); }
+.strip a:nth-child(5n+4) img { transform: rotate(-11deg); }
+.strip a:nth-child(5n+5) img { transform: rotate(12deg); }
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day20/index.html b/JavaScript Challenges/Javascript 30/Day20/index.html
new file mode 100644
index 0000000..17b6f3b
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day20/index.html	
@@ -0,0 +1,82 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Day 20 - Speech Detection</title>
+    <style>
+        body{
+            background-color: #ffc600;
+            font-family: 'helvetica neue';
+            font-weight: 200;
+            font-size: 20px;
+        }
+
+        .words{
+            max-width: 500px;
+            margin: 50px auto;
+            background-color: white;
+            border-radius: 5px;
+            box-shadow: 10px 10px 0 rgba(0, 0, 0, 0.1);
+            padding: 1rem 2rem 1rem 5rem;
+            background: -webkit-gradient(linear, 0 0, 0 100%, from(#d9eaf3), color-stop(4%, #fff)) 0 4px;
+            background-size: 100% 3rem;
+            position: relative;
+            line-height: 3rem;      
+        }
+
+        p {
+            margin: 0 0 3rem;
+        }
+
+        .words:before {
+            content: '';
+            position: absolute;
+            width: 4px;
+            top: 0;
+            left: 30px;
+            bottom: 0;
+            border: 1px solid;
+            border-color: transparent #efe4e4;
+        }
+    </style>
+</head>
+<body>
+    <div class="words" contenteditable="">
+    </div>
+
+    <script>
+        window.SpeechRecognition = window.SpeechRecognition || window.webkitSpeechRecognition;
+
+        const recognition = new SpeechRecognition();
+        recognition.interimResults = true;
+
+        let p = document.createElement('p');
+        const words = document.querySelector('.words');
+        words.appendChild(p);
+
+        recognition.addEventListener('result', e => {
+            const transcript = Array.from(e.results)
+                .map(result => result[0])
+                .map(result => result.transcript)
+                .join('')
+
+                p.textContent = transcript; 
+                if(e.results[0].isFinal)
+                {
+                    p = document.createElement('p');
+                    words.appendChild(p);
+                }
+
+                if(transcript.includes('weather'))
+                {
+                    console.log('getting the weather ...');
+                }
+        })
+
+        recognition.addEventListener('end', recognition.start);
+
+        recognition.start();
+    </script>
+</body>
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day21/index.html b/JavaScript Challenges/Javascript 30/Day21/index.html
new file mode 100644
index 0000000..12e6f1e
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day21/index.html	
@@ -0,0 +1,72 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Day 21 - Geolocation</title>
+    <style>
+        html {
+            font-size: 100px;
+        }
+        
+        body {
+            margin: 0;
+            font-family: sans-serif;
+            min-height: 100vh;
+            display: flex;
+            justify-content: center;
+            align-items: center;
+            flex-direction: column;
+            background:
+                radial-gradient(black 15%, transparent 16%) 0 0,
+                radial-gradient(black 15%, transparent 16%) 8px 8px,
+                radial-gradient(rgba(255,255,255,.1) 15%, transparent 20%) 0 1px,
+                radial-gradient(rgba(255,255,255,.1) 15%, transparent 20%) 8px 9px;
+            background-color: #282828;
+            background-size: 16px 16px;
+            background-attachment: fixed;
+        }
+        .arrow {
+            width: 250px;
+            overflow: hidden;
+            transition: all 0.2s;
+            transform: rotate(0deg);
+            display: inline-block;
+        }
+        h1 {
+            color: white;
+            font-weight: 100;
+            font-size: 60px;
+            display: flex;
+            align-items: center;
+        }
+
+        .units {
+            font-size: 15px;
+        }
+
+    </style>
+</head>
+<body>
+    <svg class="arrow" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" version="1.1" x="0px" y="0px" viewBox="0 0 64 64" enable-background="new 0 0 64 64" xml:space="preserve"><g><path fill="#ffffff" d="M32,1.824C15.361,1.824,1.825,15.361,1.825,32c0,16.639,13.537,30.176,30.175,30.176   S62.175,48.639,62.175,32C62.175,15.361,48.639,1.824,32,1.824z M29.715,3.988h1.12l2.333,3.807V3.988h1.069v5.701h-1.155   l-2.298-3.718v3.718h-1.069V3.988z M9.323,33.917H8.102l-1.136-4.262l-1.132,4.262H4.587l-1.361-5.701h1.178l0.859,3.916   l1.042-3.916h1.369l0.999,3.982l0.875-3.982h1.159L9.323,33.917z M33.995,59.828c-0.181,0.285-0.438,0.497-0.77,0.636   c-0.332,0.139-0.745,0.208-1.241,0.208c-0.721,0-1.274-0.167-1.661-0.5c-0.386-0.333-0.617-0.819-0.692-1.456l1.12-0.109   c0.067,0.376,0.204,0.652,0.41,0.828c0.206,0.176,0.484,0.264,0.834,0.264c0.371,0,0.65-0.078,0.838-0.235   c0.188-0.157,0.282-0.34,0.282-0.55c0-0.135-0.04-0.25-0.119-0.344c-0.079-0.095-0.217-0.177-0.414-0.247   c-0.135-0.047-0.442-0.13-0.922-0.249c-0.617-0.153-1.05-0.341-1.299-0.564c-0.35-0.314-0.525-0.696-0.525-1.147   c0-0.29,0.082-0.562,0.247-0.815c0.165-0.253,0.402-0.445,0.712-0.577c0.31-0.132,0.684-0.198,1.122-0.198   c0.716,0,1.254,0.157,1.616,0.471c0.362,0.314,0.552,0.733,0.57,1.256l-1.151,0.051c-0.049-0.293-0.155-0.504-0.317-0.632   c-0.162-0.128-0.405-0.193-0.729-0.193c-0.334,0-0.596,0.069-0.786,0.206c-0.122,0.088-0.183,0.206-0.183,0.354   c0,0.135,0.057,0.25,0.171,0.346c0.145,0.122,0.498,0.249,1.058,0.381c0.56,0.132,0.974,0.269,1.243,0.41   c0.268,0.141,0.478,0.334,0.63,0.58c0.152,0.245,0.227,0.548,0.227,0.908C34.267,59.237,34.176,59.543,33.995,59.828z M32,52.795   c-11.466,0-20.795-9.329-20.795-20.795c0-11.466,9.329-20.795,20.795-20.795S52.795,20.534,52.795,32   C52.795,43.466,43.466,52.795,32,52.795z M55.014,33.917v-5.701h4.227v0.965h-3.076v1.264h2.862v0.96h-2.862v1.552h3.185v0.961   H55.014z"/><g><path fill="#000000" d="M48.904,31.863c-4.074-1.358-8.148-2.717-12.226-4.066c-0.265-0.087-0.399-0.223-0.486-0.486    c-1.349-4.077-2.708-8.151-4.066-12.226c-0.029-0.087-0.074-0.169-0.132-0.3c-0.054,0.152-0.09,0.245-0.122,0.34    c-1.352,4.053-2.707,8.104-4.048,12.161c-0.096,0.292-0.246,0.428-0.532,0.522c-4.056,1.342-8.108,2.696-12.16,4.049    c-0.097,0.032-0.189,0.074-0.344,0.137c0.172,0.06,0.267,0.093,0.362,0.125c4.074,1.358,8.148,2.717,12.224,4.072    c0.204,0.068,0.337,0.158,0.412,0.386c1.243,3.757,2.498,7.511,3.75,11.265c0.144,0.432,0.291,0.862,0.463,1.373    c0.068-0.185,0.108-0.285,0.142-0.386c1.349-4.042,2.701-8.083,4.04-12.128c0.094-0.284,0.231-0.438,0.523-0.534    c4.056-1.341,8.108-2.696,12.161-4.048c0.099-0.033,0.195-0.076,0.347-0.137C49.067,31.925,48.987,31.891,48.904,31.863z     M37.475,32.038c-1.316,0.439-2.631,0.879-3.947,1.314c-0.095,0.031-0.139,0.081-0.17,0.173c-0.434,1.313-0.873,2.625-1.311,3.937    c-0.012,0.033-0.024,0.066-0.046,0.126c-0.056-0.166-0.104-0.306-0.15-0.446c-0.407-1.219-0.814-2.437-1.218-3.657    c-0.025-0.074-0.068-0.104-0.134-0.125c-1.323-0.44-2.646-0.881-3.968-1.322c-0.031-0.01-0.062-0.022-0.118-0.041    c0.05-0.02,0.081-0.034,0.112-0.045c1.315-0.439,2.631-0.879,3.947-1.314c0.093-0.03,0.142-0.075,0.173-0.17    c0.435-1.316,0.875-2.632,1.314-3.947c0.01-0.031,0.022-0.062,0.039-0.11c0.019,0.042,0.033,0.069,0.043,0.097    c0.441,1.323,0.882,2.645,1.321,3.969c0.028,0.085,0.072,0.129,0.158,0.158c1.324,0.438,2.646,0.879,3.969,1.32    c0.027,0.009,0.053,0.02,0.1,0.038C37.538,32.013,37.507,32.027,37.475,32.038z"/><path fill="#000000" d="M24.436,27.633c-1.069-2.137-2.119-4.237-3.216-6.43c2.189,1.094,4.292,2.145,6.433,3.216    c-0.359,0.713-0.706,1.404-1.057,2.091c-0.023,0.045-0.078,0.082-0.127,0.106C25.807,26.949,25.143,27.28,24.436,27.633z"/><path fill="#000000" d="M39.573,27.632c-0.696-0.348-1.351-0.673-2.002-1.005c-0.076-0.038-0.155-0.104-0.193-0.177    c-0.338-0.661-0.666-1.326-1.019-2.033c2.121-1.061,4.228-2.115,6.43-3.217C41.69,23.399,40.635,25.509,39.573,27.632z"/><path fill="#000000" d="M24.436,36.339c0.712,0.357,1.394,0.698,2.074,1.043c0.046,0.024,0.088,0.073,0.113,0.121    c0.339,0.671,0.674,1.345,1.028,2.051c-2.126,1.063-4.232,2.117-6.43,3.216C22.317,40.577,23.37,38.472,24.436,36.339z"/><path fill="#000000" d="M36.358,39.555c0.354-0.707,0.688-1.38,1.028-2.05c0.028-0.056,0.084-0.111,0.14-0.139    c0.67-0.339,1.343-0.674,2.047-1.026c1.066,2.131,2.118,4.235,3.215,6.43C40.601,41.676,38.503,40.628,36.358,39.555z"/></g></g></svg>
+
+    <h1 class="speed">
+        <span class="speed-value">0</span>
+        <span class="units">KM/H</span>
+    </h1>
+    
+    <script>
+        const arrow = document.querySelector('.arrow');
+        const speed = document.querySelector('.speed-value');
+
+        // navigator.geolocation.getCurrentPosition();
+        navigator.geolocation.watchPosition((data) => {
+            console.log(data);
+            speed.textContent = data.coords.speed || 0;
+            arrow.style.transform = `rotate(${data.coords.heading}deg)`;
+        }, (err) => {
+            console.log("Hey you should allow the location to access our services.");
+        });
+    </script>
+</body>
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day21/package-lock.json b/JavaScript Challenges/Javascript 30/Day21/package-lock.json
new file mode 100644
index 0000000..6784ba7
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day21/package-lock.json	
@@ -0,0 +1,1600 @@
+{
+  "name": "gum",
+  "version": "1.0.0",
+  "lockfileVersion": 1,
+  "requires": true,
+  "dependencies": {
+    "accepts": {
+      "version": "1.3.7",
+      "resolved": "https://registry.npmjs.org/accepts/-/accepts-1.3.7.tgz",
+      "integrity": "sha512-Il80Qs2WjYlJIBNzNkK6KYqlVMTbZLXgHx2oT0pU/fjRHyEp+PEfEPY0R3WCwAGVOtauxh1hOxNgIf5bv7dQpA==",
+      "requires": {
+        "mime-types": "~2.1.24",
+        "negotiator": "0.6.2"
+      }
+    },
+    "after": {
+      "version": "0.8.2",
+      "resolved": "https://registry.npmjs.org/after/-/after-0.8.2.tgz",
+      "integrity": "sha1-/ts5T58OAqqXaOcCvaI7UF+ufh8="
+    },
+    "ansi-regex": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-2.1.1.tgz",
+      "integrity": "sha1-w7M6te42DYbg5ijwRorn7yfWVN8="
+    },
+    "ansi-styles": {
+      "version": "2.2.1",
+      "resolved": "https://registry.npmjs.org/ansi-styles/-/ansi-styles-2.2.1.tgz",
+      "integrity": "sha1-tDLdM1i2NM914eRmQ2gkBTPB3b4="
+    },
+    "anymatch": {
+      "version": "3.1.1",
+      "resolved": "https://registry.npmjs.org/anymatch/-/anymatch-3.1.1.tgz",
+      "integrity": "sha512-mM8522psRCqzV+6LhomX5wgp25YVibjh8Wj23I5RPkPppSVSjyKD2A2mBJmWGa+KN7f2D6LNh9jkBCeyLktzjg==",
+      "requires": {
+        "normalize-path": "^3.0.0",
+        "picomatch": "^2.0.4"
+      }
+    },
+    "arraybuffer.slice": {
+      "version": "0.0.7",
+      "resolved": "https://registry.npmjs.org/arraybuffer.slice/-/arraybuffer.slice-0.0.7.tgz",
+      "integrity": "sha512-wGUIVQXuehL5TCqQun8OW81jGzAWycqzFF8lFp+GOM5BXLYj3bKNsYC4daB7n6XjCqxQA/qgTJ+8ANR3acjrog=="
+    },
+    "async": {
+      "version": "1.5.2",
+      "resolved": "https://registry.npmjs.org/async/-/async-1.5.2.tgz",
+      "integrity": "sha1-7GphrlZIDAw8skHJVhjiCJL5Zyo="
+    },
+    "async-each-series": {
+      "version": "0.1.1",
+      "resolved": "https://registry.npmjs.org/async-each-series/-/async-each-series-0.1.1.tgz",
+      "integrity": "sha1-dhfBkXQB/Yykooqtzj266Yr+tDI="
+    },
+    "async-limiter": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/async-limiter/-/async-limiter-1.0.1.tgz",
+      "integrity": "sha512-csOlWGAcRFJaI6m+F2WKdnMKr4HhdhFVBk0H/QbJFMCr+uO2kwohwXQPxw/9OCxp05r5ghVBFSyioixx3gfkNQ=="
+    },
+    "axios": {
+      "version": "0.19.0",
+      "resolved": "https://registry.npmjs.org/axios/-/axios-0.19.0.tgz",
+      "integrity": "sha512-1uvKqKQta3KBxIz14F2v06AEHZ/dIoeKfbTRkK1E5oqjDnuEerLmYTgJB5AiQZHJcljpg1TuRzdjDR06qNk0DQ==",
+      "requires": {
+        "follow-redirects": "1.5.10",
+        "is-buffer": "^2.0.2"
+      },
+      "dependencies": {
+        "follow-redirects": {
+          "version": "1.5.10",
+          "resolved": "https://registry.npmjs.org/follow-redirects/-/follow-redirects-1.5.10.tgz",
+          "integrity": "sha512-0V5l4Cizzvqt5D44aTXbFZz+FtyXV1vrDN6qrelxtfYQKW0KO0W2T/hkE8xvGa/540LkZlkaUjO4ailYTFtHVQ==",
+          "requires": {
+            "debug": "=3.1.0"
+          }
+        }
+      }
+    },
+    "backo2": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/backo2/-/backo2-1.0.2.tgz",
+      "integrity": "sha1-MasayLEpNjRj41s+u2n038+6eUc="
+    },
+    "balanced-match": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/balanced-match/-/balanced-match-1.0.0.tgz",
+      "integrity": "sha1-ibTRmasr7kneFk6gK4nORi1xt2c="
+    },
+    "base64-arraybuffer": {
+      "version": "0.1.4",
+      "resolved": "https://registry.npmjs.org/base64-arraybuffer/-/base64-arraybuffer-0.1.4.tgz",
+      "integrity": "sha1-mBjHngWbE1X5fgQooBfIOOkLqBI="
+    },
+    "base64id": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/base64id/-/base64id-1.0.0.tgz",
+      "integrity": "sha1-R2iMuZu2gE8OBtPnY7HDLlfY5rY="
+    },
+    "batch": {
+      "version": "0.6.1",
+      "resolved": "https://registry.npmjs.org/batch/-/batch-0.6.1.tgz",
+      "integrity": "sha1-3DQxT05nkxgJP8dgJyUl+UvyXBY="
+    },
+    "better-assert": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/better-assert/-/better-assert-1.0.2.tgz",
+      "integrity": "sha1-QIZrnhueC1W0gYlDEeaPr/rrxSI=",
+      "requires": {
+        "callsite": "1.0.0"
+      }
+    },
+    "binary-extensions": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/binary-extensions/-/binary-extensions-2.1.0.tgz",
+      "integrity": "sha512-1Yj8h9Q+QDF5FzhMs/c9+6UntbD5MkRfRwac8DoEm9ZfUBZ7tZ55YcGVAzEe4bXsdQHEk+s9S5wsOKVdZrw0tQ=="
+    },
+    "blob": {
+      "version": "0.0.5",
+      "resolved": "https://registry.npmjs.org/blob/-/blob-0.0.5.tgz",
+      "integrity": "sha512-gaqbzQPqOoamawKg0LGVd7SzLgXS+JH61oWprSLH+P+abTczqJbhTR8CmJ2u9/bUYNmHTGJx/UEmn6doAvvuig=="
+    },
+    "brace-expansion": {
+      "version": "1.1.11",
+      "resolved": "https://registry.npmjs.org/brace-expansion/-/brace-expansion-1.1.11.tgz",
+      "integrity": "sha512-iCuPHDFgrHX7H2vEI/5xpz07zSHB00TpugqhmYtVmMO6518mCuRMoOYFldEBl0g187ufozdaHgWKcYFb61qGiA==",
+      "requires": {
+        "balanced-match": "^1.0.0",
+        "concat-map": "0.0.1"
+      }
+    },
+    "braces": {
+      "version": "3.0.2",
+      "resolved": "https://registry.npmjs.org/braces/-/braces-3.0.2.tgz",
+      "integrity": "sha512-b8um+L1RzM3WDSzvhm6gIz1yfTbBt6YTlcEKAvsmqCZZFw46z626lVj9j1yEPW33H5H+lBQpZMP1k8l+78Ha0A==",
+      "requires": {
+        "fill-range": "^7.0.1"
+      }
+    },
+    "browser-sync": {
+      "version": "2.26.13",
+      "resolved": "https://registry.npmjs.org/browser-sync/-/browser-sync-2.26.13.tgz",
+      "integrity": "sha512-JPYLTngIzI+Dzx+StSSlMtF+Q9yjdh58HW6bMFqkFXuzQkJL8FCvp4lozlS6BbECZcsM2Gmlgp0uhEjvl18X4w==",
+      "requires": {
+        "browser-sync-client": "^2.26.13",
+        "browser-sync-ui": "^2.26.13",
+        "bs-recipes": "1.3.4",
+        "bs-snippet-injector": "^2.0.1",
+        "chokidar": "^3.4.1",
+        "connect": "3.6.6",
+        "connect-history-api-fallback": "^1",
+        "dev-ip": "^1.0.1",
+        "easy-extender": "^2.3.4",
+        "eazy-logger": "3.1.0",
+        "etag": "^1.8.1",
+        "fresh": "^0.5.2",
+        "fs-extra": "3.0.1",
+        "http-proxy": "^1.18.1",
+        "immutable": "^3",
+        "localtunnel": "^2.0.0",
+        "micromatch": "^4.0.2",
+        "opn": "5.3.0",
+        "portscanner": "2.1.1",
+        "qs": "6.2.3",
+        "raw-body": "^2.3.2",
+        "resp-modifier": "6.0.2",
+        "rx": "4.1.0",
+        "send": "0.16.2",
+        "serve-index": "1.9.1",
+        "serve-static": "1.13.2",
+        "server-destroy": "1.0.1",
+        "socket.io": "2.1.1",
+        "ua-parser-js": "^0.7.18",
+        "yargs": "^15.4.1"
+      }
+    },
+    "browser-sync-client": {
+      "version": "2.26.13",
+      "resolved": "https://registry.npmjs.org/browser-sync-client/-/browser-sync-client-2.26.13.tgz",
+      "integrity": "sha512-p2VbZoYrpuDhkreq+/Sv1MkToHklh7T1OaIntDwpG6Iy2q/XkBcgwPcWjX+WwRNiZjN8MEehxIjEUh12LweLmQ==",
+      "requires": {
+        "etag": "1.8.1",
+        "fresh": "0.5.2",
+        "mitt": "^1.1.3",
+        "rxjs": "^5.5.6"
+      }
+    },
+    "browser-sync-ui": {
+      "version": "2.26.13",
+      "resolved": "https://registry.npmjs.org/browser-sync-ui/-/browser-sync-ui-2.26.13.tgz",
+      "integrity": "sha512-6NJ/pCnhCnBMzaty1opWo7ipDmFAIk8U71JMQGKJxblCUaGfdsbF2shf6XNZSkXYia1yS0vwKu9LIOzpXqQZCA==",
+      "requires": {
+        "async-each-series": "0.1.1",
+        "connect-history-api-fallback": "^1",
+        "immutable": "^3",
+        "server-destroy": "1.0.1",
+        "socket.io-client": "^2.0.4",
+        "stream-throttle": "^0.1.3"
+      }
+    },
+    "bs-recipes": {
+      "version": "1.3.4",
+      "resolved": "https://registry.npmjs.org/bs-recipes/-/bs-recipes-1.3.4.tgz",
+      "integrity": "sha1-DS1NSKcYyMBEdp/cT4lZLci2lYU="
+    },
+    "bs-snippet-injector": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmjs.org/bs-snippet-injector/-/bs-snippet-injector-2.0.1.tgz",
+      "integrity": "sha1-YbU5PxH1JVntEgaTEANDtu2wTdU="
+    },
+    "bytes": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmjs.org/bytes/-/bytes-3.1.0.tgz",
+      "integrity": "sha512-zauLjrfCG+xvoyaqLoV8bLVXXNGC4JqlxFCutSDWA6fJrTo2ZuvLYTqZ7aHBLZSMOopbzwv8f+wZcVzfVTI2Dg=="
+    },
+    "callsite": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/callsite/-/callsite-1.0.0.tgz",
+      "integrity": "sha1-KAOY5dZkvXQDi28JBRU+borxvCA="
+    },
+    "camelcase": {
+      "version": "5.3.1",
+      "resolved": "https://registry.npmjs.org/camelcase/-/camelcase-5.3.1.tgz",
+      "integrity": "sha512-L28STB170nwWS63UjtlEOE3dldQApaJXZkOI1uMFfzf3rRuPegHaHesyee+YxQ+W6SvRDQV6UrdOdRiR153wJg=="
+    },
+    "chalk": {
+      "version": "1.1.3",
+      "resolved": "https://registry.npmjs.org/chalk/-/chalk-1.1.3.tgz",
+      "integrity": "sha1-qBFcVeSnAv5NFQq9OHKCKn4J/Jg=",
+      "requires": {
+        "ansi-styles": "^2.2.1",
+        "escape-string-regexp": "^1.0.2",
+        "has-ansi": "^2.0.0",
+        "strip-ansi": "^3.0.0",
+        "supports-color": "^2.0.0"
+      }
+    },
+    "chokidar": {
+      "version": "3.4.3",
+      "resolved": "https://registry.npmjs.org/chokidar/-/chokidar-3.4.3.tgz",
+      "integrity": "sha512-DtM3g7juCXQxFVSNPNByEC2+NImtBuxQQvWlHunpJIS5Ocr0lG306cC7FCi7cEA0fzmybPUIl4txBIobk1gGOQ==",
+      "requires": {
+        "anymatch": "~3.1.1",
+        "braces": "~3.0.2",
+        "fsevents": "~2.1.2",
+        "glob-parent": "~5.1.0",
+        "is-binary-path": "~2.1.0",
+        "is-glob": "~4.0.1",
+        "normalize-path": "~3.0.0",
+        "readdirp": "~3.5.0"
+      }
+    },
+    "cliui": {
+      "version": "5.0.0",
+      "resolved": "https://registry.npmjs.org/cliui/-/cliui-5.0.0.tgz",
+      "integrity": "sha512-PYeGSEmmHM6zvoef2w8TPzlrnNpXIjTipYK780YswmIP9vjxmd6Y2a3CB2Ks6/AU8NHjZugXvo8w3oWM2qnwXA==",
+      "requires": {
+        "string-width": "^3.1.0",
+        "strip-ansi": "^5.2.0",
+        "wrap-ansi": "^5.1.0"
+      },
+      "dependencies": {
+        "ansi-regex": {
+          "version": "4.1.0",
+          "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-4.1.0.tgz",
+          "integrity": "sha512-1apePfXM1UOSqw0o9IiFAovVz9M5S1Dg+4TrDwfMewQ6p/rmMueb7tWZjQ1rx4Loy1ArBggoqGpfqqdI4rondg=="
+        },
+        "strip-ansi": {
+          "version": "5.2.0",
+          "resolved": "https://registry.npmjs.org/strip-ansi/-/strip-ansi-5.2.0.tgz",
+          "integrity": "sha512-DuRs1gKbBqsMKIZlrffwlug8MHkcnpjs5VPmL1PAh+mA30U0DTotfDZ0d2UUsXpPmPmMMJ6W773MaA3J+lbiWA==",
+          "requires": {
+            "ansi-regex": "^4.1.0"
+          }
+        }
+      }
+    },
+    "color-convert": {
+      "version": "1.9.3",
+      "resolved": "https://registry.npmjs.org/color-convert/-/color-convert-1.9.3.tgz",
+      "integrity": "sha512-QfAUtd+vFdAtFQcC8CCyYt1fYWxSqAiK2cSD6zDB8N3cpsEBAvRxp9zOGg6G/SHHJYAT88/az/IuDGALsNVbGg==",
+      "requires": {
+        "color-name": "1.1.3"
+      }
+    },
+    "color-name": {
+      "version": "1.1.3",
+      "resolved": "https://registry.npmjs.org/color-name/-/color-name-1.1.3.tgz",
+      "integrity": "sha1-p9BVi9icQveV3UIyj3QIMcpTvCU="
+    },
+    "commander": {
+      "version": "2.20.3",
+      "resolved": "https://registry.npmjs.org/commander/-/commander-2.20.3.tgz",
+      "integrity": "sha512-GpVkmM8vF2vQUkj2LvZmD35JxeJOLCwJ9cUkugyk2nuhbv3+mJvpLYYt+0+USMxE+oj+ey/lJEnhZw75x/OMcQ=="
+    },
+    "component-bind": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/component-bind/-/component-bind-1.0.0.tgz",
+      "integrity": "sha1-AMYIq33Nk4l8AAllGx06jh5zu9E="
+    },
+    "component-emitter": {
+      "version": "1.3.0",
+      "resolved": "https://registry.npmjs.org/component-emitter/-/component-emitter-1.3.0.tgz",
+      "integrity": "sha512-Rd3se6QB+sO1TwqZjscQrurpEPIfO0/yYnSin6Q/rD3mOutHvUrCAhJub3r90uNb+SESBuE0QYoB90YdfatsRg=="
+    },
+    "component-inherit": {
+      "version": "0.0.3",
+      "resolved": "https://registry.npmjs.org/component-inherit/-/component-inherit-0.0.3.tgz",
+      "integrity": "sha1-ZF/ErfWLcrZJ1crmUTVhnbJv8UM="
+    },
+    "concat-map": {
+      "version": "0.0.1",
+      "resolved": "https://registry.npmjs.org/concat-map/-/concat-map-0.0.1.tgz",
+      "integrity": "sha1-2Klr13/Wjfd5OnMDajug1UBdR3s="
+    },
+    "connect": {
+      "version": "3.6.6",
+      "resolved": "https://registry.npmjs.org/connect/-/connect-3.6.6.tgz",
+      "integrity": "sha1-Ce/2xVr3I24TcTWnJXSFi2eG9SQ=",
+      "requires": {
+        "debug": "2.6.9",
+        "finalhandler": "1.1.0",
+        "parseurl": "~1.3.2",
+        "utils-merge": "1.0.1"
+      },
+      "dependencies": {
+        "debug": {
+          "version": "2.6.9",
+          "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
+          "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
+          "requires": {
+            "ms": "2.0.0"
+          }
+        }
+      }
+    },
+    "connect-history-api-fallback": {
+      "version": "1.6.0",
+      "resolved": "https://registry.npmjs.org/connect-history-api-fallback/-/connect-history-api-fallback-1.6.0.tgz",
+      "integrity": "sha512-e54B99q/OUoH64zYYRf3HBP5z24G38h5D3qXu23JGRoigpX5Ss4r9ZnDk3g0Z8uQC2x2lPaJ+UlWBc1ZWBWdLg=="
+    },
+    "cookie": {
+      "version": "0.3.1",
+      "resolved": "https://registry.npmjs.org/cookie/-/cookie-0.3.1.tgz",
+      "integrity": "sha1-5+Ch+e9DtMi6klxcWpboBtFoc7s="
+    },
+    "debug": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmjs.org/debug/-/debug-3.1.0.tgz",
+      "integrity": "sha512-OX8XqP7/1a9cqkxYw2yXss15f26NKWBpDXQd0/uK/KPqdQhxbPa994hnzjcE2VqQpDslf55723cKPUOGSmMY3g==",
+      "requires": {
+        "ms": "2.0.0"
+      }
+    },
+    "decamelize": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/decamelize/-/decamelize-1.2.0.tgz",
+      "integrity": "sha1-9lNNFRSCabIDUue+4m9QH5oZEpA="
+    },
+    "depd": {
+      "version": "1.1.2",
+      "resolved": "https://registry.npmjs.org/depd/-/depd-1.1.2.tgz",
+      "integrity": "sha1-m81S4UwJd2PnSbJ0xDRu0uVgtak="
+    },
+    "destroy": {
+      "version": "1.0.4",
+      "resolved": "https://registry.npmjs.org/destroy/-/destroy-1.0.4.tgz",
+      "integrity": "sha1-l4hXRCxEdJ5CBmE+N5RiBYJqvYA="
+    },
+    "dev-ip": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/dev-ip/-/dev-ip-1.0.1.tgz",
+      "integrity": "sha1-p2o+0YVb56ASu4rBbLgPPADcKPA="
+    },
+    "dlv": {
+      "version": "1.1.3",
+      "resolved": "https://registry.npmjs.org/dlv/-/dlv-1.1.3.tgz",
+      "integrity": "sha512-+HlytyjlPKnIG8XuRG8WvmBP8xs8P71y+SKKS6ZXWoEgLuePxtDoUEiH7WkdePWrQ5JBpE6aoVqfZfJUQkjXwA=="
+    },
+    "easy-extender": {
+      "version": "2.3.4",
+      "resolved": "https://registry.npmjs.org/easy-extender/-/easy-extender-2.3.4.tgz",
+      "integrity": "sha512-8cAwm6md1YTiPpOvDULYJL4ZS6WfM5/cTeVVh4JsvyYZAoqlRVUpHL9Gr5Fy7HA6xcSZicUia3DeAgO3Us8E+Q==",
+      "requires": {
+        "lodash": "^4.17.10"
+      }
+    },
+    "eazy-logger": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmjs.org/eazy-logger/-/eazy-logger-3.1.0.tgz",
+      "integrity": "sha512-/snsn2JqBtUSSstEl4R0RKjkisGHAhvYj89i7r3ytNUKW12y178KDZwXLXIgwDqLW6E/VRMT9qfld7wvFae8bQ==",
+      "requires": {
+        "tfunk": "^4.0.0"
+      }
+    },
+    "ee-first": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmjs.org/ee-first/-/ee-first-1.1.1.tgz",
+      "integrity": "sha1-WQxhFWsK4vTwJVcyoViyZrxWsh0="
+    },
+    "emoji-regex": {
+      "version": "7.0.3",
+      "resolved": "https://registry.npmjs.org/emoji-regex/-/emoji-regex-7.0.3.tgz",
+      "integrity": "sha512-CwBLREIQ7LvYFB0WyRvwhq5N5qPhc6PMjD6bYggFlI5YyDgl+0vxq5VHbMOFqLg7hfWzmu8T5Z1QofhmTIhItA=="
+    },
+    "encodeurl": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/encodeurl/-/encodeurl-1.0.2.tgz",
+      "integrity": "sha1-rT/0yG7C0CkyL1oCw6mmBslbP1k="
+    },
+    "engine.io": {
+      "version": "3.2.1",
+      "resolved": "https://registry.npmjs.org/engine.io/-/engine.io-3.2.1.tgz",
+      "integrity": "sha512-+VlKzHzMhaU+GsCIg4AoXF1UdDFjHHwMmMKqMJNDNLlUlejz58FCy4LBqB2YVJskHGYl06BatYWKP2TVdVXE5w==",
+      "requires": {
+        "accepts": "~1.3.4",
+        "base64id": "1.0.0",
+        "cookie": "0.3.1",
+        "debug": "~3.1.0",
+        "engine.io-parser": "~2.1.0",
+        "ws": "~3.3.1"
+      },
+      "dependencies": {
+        "base64-arraybuffer": {
+          "version": "0.1.5",
+          "resolved": "https://registry.npmjs.org/base64-arraybuffer/-/base64-arraybuffer-0.1.5.tgz",
+          "integrity": "sha1-c5JncZI7Whl0etZmqlzUv5xunOg="
+        },
+        "engine.io-parser": {
+          "version": "2.1.3",
+          "resolved": "https://registry.npmjs.org/engine.io-parser/-/engine.io-parser-2.1.3.tgz",
+          "integrity": "sha512-6HXPre2O4Houl7c4g7Ic/XzPnHBvaEmN90vtRO9uLmwtRqQmTOw0QMevL1TOfL2Cpu1VzsaTmMotQgMdkzGkVA==",
+          "requires": {
+            "after": "0.8.2",
+            "arraybuffer.slice": "~0.0.7",
+            "base64-arraybuffer": "0.1.5",
+            "blob": "0.0.5",
+            "has-binary2": "~1.0.2"
+          }
+        },
+        "ws": {
+          "version": "3.3.3",
+          "resolved": "https://registry.npmjs.org/ws/-/ws-3.3.3.tgz",
+          "integrity": "sha512-nnWLa/NwZSt4KQJu51MYlCcSQ5g7INpOrOMt4XV8j4dqTXdmlUmSHQ8/oLC069ckre0fRsgfvsKwbTdtKLCDkA==",
+          "requires": {
+            "async-limiter": "~1.0.0",
+            "safe-buffer": "~5.1.0",
+            "ultron": "~1.1.0"
+          }
+        }
+      }
+    },
+    "engine.io-client": {
+      "version": "3.4.4",
+      "resolved": "https://registry.npmjs.org/engine.io-client/-/engine.io-client-3.4.4.tgz",
+      "integrity": "sha512-iU4CRr38Fecj8HoZEnFtm2EiKGbYZcPn3cHxqNGl/tmdWRf60KhK+9vE0JeSjgnlS/0oynEfLgKbT9ALpim0sQ==",
+      "requires": {
+        "component-emitter": "~1.3.0",
+        "component-inherit": "0.0.3",
+        "debug": "~3.1.0",
+        "engine.io-parser": "~2.2.0",
+        "has-cors": "1.1.0",
+        "indexof": "0.0.1",
+        "parseqs": "0.0.6",
+        "parseuri": "0.0.6",
+        "ws": "~6.1.0",
+        "xmlhttprequest-ssl": "~1.5.4",
+        "yeast": "0.1.2"
+      }
+    },
+    "engine.io-parser": {
+      "version": "2.2.1",
+      "resolved": "https://registry.npmjs.org/engine.io-parser/-/engine.io-parser-2.2.1.tgz",
+      "integrity": "sha512-x+dN/fBH8Ro8TFwJ+rkB2AmuVw9Yu2mockR/p3W8f8YtExwFgDvBDi0GWyb4ZLkpahtDGZgtr3zLovanJghPqg==",
+      "requires": {
+        "after": "0.8.2",
+        "arraybuffer.slice": "~0.0.7",
+        "base64-arraybuffer": "0.1.4",
+        "blob": "0.0.5",
+        "has-binary2": "~1.0.2"
+      }
+    },
+    "escape-html": {
+      "version": "1.0.3",
+      "resolved": "https://registry.npmjs.org/escape-html/-/escape-html-1.0.3.tgz",
+      "integrity": "sha1-Aljq5NPQwJdN4cFpGI7wBR0dGYg="
+    },
+    "escape-string-regexp": {
+      "version": "1.0.5",
+      "resolved": "https://registry.npmjs.org/escape-string-regexp/-/escape-string-regexp-1.0.5.tgz",
+      "integrity": "sha1-G2HAViGQqN/2rjuyzwIAyhMLhtQ="
+    },
+    "etag": {
+      "version": "1.8.1",
+      "resolved": "https://registry.npmjs.org/etag/-/etag-1.8.1.tgz",
+      "integrity": "sha1-Qa4u62XvpiJorr/qg6x9eSmbCIc="
+    },
+    "eventemitter3": {
+      "version": "4.0.7",
+      "resolved": "https://registry.npmjs.org/eventemitter3/-/eventemitter3-4.0.7.tgz",
+      "integrity": "sha512-8guHBZCwKnFhYdHr2ysuRWErTwhoN2X8XELRlrRwpmfeY2jjuUN4taQMsULKUVo1K4DvZl+0pgfyoysHxvmvEw=="
+    },
+    "fill-range": {
+      "version": "7.0.1",
+      "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-7.0.1.tgz",
+      "integrity": "sha512-qOo9F+dMUmC2Lcb4BbVvnKJxTPjCm+RRpe4gDuGrzkL7mEVl/djYSu2OdQ2Pa302N4oqkSg9ir6jaLWJ2USVpQ==",
+      "requires": {
+        "to-regex-range": "^5.0.1"
+      }
+    },
+    "finalhandler": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmjs.org/finalhandler/-/finalhandler-1.1.0.tgz",
+      "integrity": "sha1-zgtoVbRYU+eRsvzGgARtiCU91/U=",
+      "requires": {
+        "debug": "2.6.9",
+        "encodeurl": "~1.0.1",
+        "escape-html": "~1.0.3",
+        "on-finished": "~2.3.0",
+        "parseurl": "~1.3.2",
+        "statuses": "~1.3.1",
+        "unpipe": "~1.0.0"
+      },
+      "dependencies": {
+        "debug": {
+          "version": "2.6.9",
+          "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
+          "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
+          "requires": {
+            "ms": "2.0.0"
+          }
+        }
+      }
+    },
+    "find-up": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/find-up/-/find-up-3.0.0.tgz",
+      "integrity": "sha512-1yD6RmLI1XBfxugvORwlck6f75tYL+iR0jqwsOrOxMZyGYqUuDhJ0l4AXdO1iX/FTs9cBAMEk1gWSEx1kSbylg==",
+      "requires": {
+        "locate-path": "^3.0.0"
+      }
+    },
+    "follow-redirects": {
+      "version": "1.13.0",
+      "resolved": "https://registry.npmjs.org/follow-redirects/-/follow-redirects-1.13.0.tgz",
+      "integrity": "sha512-aq6gF1BEKje4a9i9+5jimNFIpq4Q1WiwBToeRK5NvZBd/TRsmW8BsJfOEGkr76TbOyPVD3OVDN910EcUNtRYEA=="
+    },
+    "fresh": {
+      "version": "0.5.2",
+      "resolved": "https://registry.npmjs.org/fresh/-/fresh-0.5.2.tgz",
+      "integrity": "sha1-PYyt2Q2XZWn6g1qx+OSyOhBWBac="
+    },
+    "fs-extra": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmjs.org/fs-extra/-/fs-extra-3.0.1.tgz",
+      "integrity": "sha1-N5TzeMWLNC6n27sjCVEJxLO2IpE=",
+      "requires": {
+        "graceful-fs": "^4.1.2",
+        "jsonfile": "^3.0.0",
+        "universalify": "^0.1.0"
+      }
+    },
+    "fsevents": {
+      "version": "2.1.3",
+      "resolved": "https://registry.npmjs.org/fsevents/-/fsevents-2.1.3.tgz",
+      "integrity": "sha512-Auw9a4AxqWpa9GUfj370BMPzzyncfBABW8Mab7BGWBYDj4Isgq+cDKtx0i6u9jcX9pQDnswsaaOTgTmA5pEjuQ==",
+      "optional": true
+    },
+    "get-caller-file": {
+      "version": "2.0.5",
+      "resolved": "https://registry.npmjs.org/get-caller-file/-/get-caller-file-2.0.5.tgz",
+      "integrity": "sha512-DyFP3BM/3YHTQOCUL/w0OZHR0lpKeGrxotcHWcqNEdnltqFwXVfhEBQ94eIo34AfQpo0rGki4cyIiftY06h2Fg=="
+    },
+    "glob-parent": {
+      "version": "5.1.1",
+      "resolved": "https://registry.npmjs.org/glob-parent/-/glob-parent-5.1.1.tgz",
+      "integrity": "sha512-FnI+VGOpnlGHWZxthPGR+QhR78fuiK0sNLkHQv+bL9fQi57lNNdquIbna/WrfROrolq8GK5Ek6BiMwqL/voRYQ==",
+      "requires": {
+        "is-glob": "^4.0.1"
+      }
+    },
+    "graceful-fs": {
+      "version": "4.2.4",
+      "resolved": "https://registry.npmjs.org/graceful-fs/-/graceful-fs-4.2.4.tgz",
+      "integrity": "sha512-WjKPNJF79dtJAVniUlGGWHYGz2jWxT6VhN/4m1NdkbZ2nOsEF+cI1Edgql5zCRhs/VsQYRvrXctxktVXZUkixw=="
+    },
+    "has-ansi": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/has-ansi/-/has-ansi-2.0.0.tgz",
+      "integrity": "sha1-NPUEnOHs3ysGSa8+8k5F7TVBbZE=",
+      "requires": {
+        "ansi-regex": "^2.0.0"
+      }
+    },
+    "has-binary2": {
+      "version": "1.0.3",
+      "resolved": "https://registry.npmjs.org/has-binary2/-/has-binary2-1.0.3.tgz",
+      "integrity": "sha512-G1LWKhDSvhGeAQ8mPVQlqNcOB2sJdwATtZKl2pDKKHfpf/rYj24lkinxf69blJbnsvtqqNU+L3SL50vzZhXOnw==",
+      "requires": {
+        "isarray": "2.0.1"
+      }
+    },
+    "has-cors": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmjs.org/has-cors/-/has-cors-1.1.0.tgz",
+      "integrity": "sha1-XkdHk/fqmEPRu5nCPu9J/xJv/zk="
+    },
+    "http-errors": {
+      "version": "1.7.3",
+      "resolved": "https://registry.npmjs.org/http-errors/-/http-errors-1.7.3.tgz",
+      "integrity": "sha512-ZTTX0MWrsQ2ZAhA1cejAwDLycFsd7I7nVtnkT3Ol0aqodaKW+0CTZDQ1uBv5whptCnc8e8HeRRJxRs0kmm/Qfw==",
+      "requires": {
+        "depd": "~1.1.2",
+        "inherits": "2.0.4",
+        "setprototypeof": "1.1.1",
+        "statuses": ">= 1.5.0 < 2",
+        "toidentifier": "1.0.0"
+      },
+      "dependencies": {
+        "statuses": {
+          "version": "1.5.0",
+          "resolved": "https://registry.npmjs.org/statuses/-/statuses-1.5.0.tgz",
+          "integrity": "sha1-Fhx9rBd2Wf2YEfQ3cfqZOBR4Yow="
+        }
+      }
+    },
+    "http-proxy": {
+      "version": "1.18.1",
+      "resolved": "https://registry.npmjs.org/http-proxy/-/http-proxy-1.18.1.tgz",
+      "integrity": "sha512-7mz/721AbnJwIVbnaSv1Cz3Am0ZLT/UBwkC92VlxhXv/k/BBQfM2fXElQNC27BVGr0uwUpplYPQM9LnaBMR5NQ==",
+      "requires": {
+        "eventemitter3": "^4.0.0",
+        "follow-redirects": "^1.0.0",
+        "requires-port": "^1.0.0"
+      }
+    },
+    "iconv-lite": {
+      "version": "0.4.24",
+      "resolved": "https://registry.npmjs.org/iconv-lite/-/iconv-lite-0.4.24.tgz",
+      "integrity": "sha512-v3MXnZAcvnywkTUEZomIActle7RXXeedOR31wwl7VlyoXO4Qi9arvSenNQWne1TcRwhCL1HwLI21bEqdpj8/rA==",
+      "requires": {
+        "safer-buffer": ">= 2.1.2 < 3"
+      }
+    },
+    "immutable": {
+      "version": "3.8.2",
+      "resolved": "https://registry.npmjs.org/immutable/-/immutable-3.8.2.tgz",
+      "integrity": "sha1-wkOZUUVbs5kT2vKBN28VMOEErfM="
+    },
+    "indexof": {
+      "version": "0.0.1",
+      "resolved": "https://registry.npmjs.org/indexof/-/indexof-0.0.1.tgz",
+      "integrity": "sha1-gtwzbSMrkGIXnQWrMpOmYFn9Q10="
+    },
+    "inherits": {
+      "version": "2.0.4",
+      "resolved": "https://registry.npmjs.org/inherits/-/inherits-2.0.4.tgz",
+      "integrity": "sha512-k/vGaX4/Yla3WzyMCvTQOXYeIHvqOKtnqBduzTHpzpQZzAskKMhZ2K+EnBiSM9zGSoIFeMpXKxa4dYeZIQqewQ=="
+    },
+    "is-binary-path": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/is-binary-path/-/is-binary-path-2.1.0.tgz",
+      "integrity": "sha512-ZMERYes6pDydyuGidse7OsHxtbI7WVeUEozgR/g7rd0xUimYNlvZRE/K2MgZTjWy725IfelLeVcEM97mmtRGXw==",
+      "requires": {
+        "binary-extensions": "^2.0.0"
+      }
+    },
+    "is-buffer": {
+      "version": "2.0.5",
+      "resolved": "https://registry.npmjs.org/is-buffer/-/is-buffer-2.0.5.tgz",
+      "integrity": "sha512-i2R6zNFDwgEHJyQUtJEk0XFi1i0dPFn/oqjK3/vPCcDeJvW5NQ83V8QbicfF1SupOaB0h8ntgBC2YiE7dfyctQ=="
+    },
+    "is-extglob": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmjs.org/is-extglob/-/is-extglob-2.1.1.tgz",
+      "integrity": "sha1-qIwCU1eR8C7TfHahueqXc8gz+MI="
+    },
+    "is-fullwidth-code-point": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/is-fullwidth-code-point/-/is-fullwidth-code-point-2.0.0.tgz",
+      "integrity": "sha1-o7MKXE8ZkYMWeqq5O+764937ZU8="
+    },
+    "is-glob": {
+      "version": "4.0.1",
+      "resolved": "https://registry.npmjs.org/is-glob/-/is-glob-4.0.1.tgz",
+      "integrity": "sha512-5G0tKtBTFImOqDnLB2hG6Bp2qcKEFduo4tZu9MT/H6NQv/ghhy30o55ufafxJ/LdH79LLs2Kfrn85TLKyA7BUg==",
+      "requires": {
+        "is-extglob": "^2.1.1"
+      }
+    },
+    "is-number": {
+      "version": "7.0.0",
+      "resolved": "https://registry.npmjs.org/is-number/-/is-number-7.0.0.tgz",
+      "integrity": "sha512-41Cifkg6e8TylSpdtTpeLVMqvSBEVzTttHvERD741+pnZ8ANv0004MRL43QKPDlK9cGvNp6NZWZUBlbGXYxxng=="
+    },
+    "is-number-like": {
+      "version": "1.0.8",
+      "resolved": "https://registry.npmjs.org/is-number-like/-/is-number-like-1.0.8.tgz",
+      "integrity": "sha512-6rZi3ezCyFcn5L71ywzz2bS5b2Igl1En3eTlZlvKjpz1n3IZLAYMbKYAIQgFmEu0GENg92ziU/faEOA/aixjbA==",
+      "requires": {
+        "lodash.isfinite": "^3.3.2"
+      }
+    },
+    "is-wsl": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmjs.org/is-wsl/-/is-wsl-1.1.0.tgz",
+      "integrity": "sha1-HxbkqiKwTRM2tmGIpmrzxgDDpm0="
+    },
+    "isarray": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmjs.org/isarray/-/isarray-2.0.1.tgz",
+      "integrity": "sha1-o32U7ZzaLVmGXJ92/llu4fM4dB4="
+    },
+    "jsonfile": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmjs.org/jsonfile/-/jsonfile-3.0.1.tgz",
+      "integrity": "sha1-pezG9l9T9mLEQVx2daAzHQmS7GY=",
+      "requires": {
+        "graceful-fs": "^4.1.6"
+      }
+    },
+    "limiter": {
+      "version": "1.1.5",
+      "resolved": "https://registry.npmjs.org/limiter/-/limiter-1.1.5.tgz",
+      "integrity": "sha512-FWWMIEOxz3GwUI4Ts/IvgVy6LPvoMPgjMdQ185nN6psJyBJ4yOpzqm695/h5umdLJg2vW3GR5iG11MAkR2AzJA=="
+    },
+    "localtunnel": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/localtunnel/-/localtunnel-2.0.0.tgz",
+      "integrity": "sha512-g6E0aLgYYDvQDxIjIXkgJo2+pHj3sGg4Wz/XP3h2KtZnRsWPbOQY+hw1H8Z91jep998fkcVE9l+kghO+97vllg==",
+      "requires": {
+        "axios": "0.19.0",
+        "debug": "4.1.1",
+        "openurl": "1.1.1",
+        "yargs": "13.3.0"
+      },
+      "dependencies": {
+        "debug": {
+          "version": "4.1.1",
+          "resolved": "https://registry.npmjs.org/debug/-/debug-4.1.1.tgz",
+          "integrity": "sha512-pYAIzeRo8J6KPEaJ0VWOh5Pzkbw/RetuzehGM7QRRX5he4fPHx2rdKMB256ehJCkX+XRQm16eZLqLNS8RSZXZw==",
+          "requires": {
+            "ms": "^2.1.1"
+          }
+        },
+        "ms": {
+          "version": "2.1.2",
+          "resolved": "https://registry.npmjs.org/ms/-/ms-2.1.2.tgz",
+          "integrity": "sha512-sGkPx+VjMtmA6MX27oA4FBFELFCZZ4S4XqeGOXCv68tT+jb3vk/RyaKWP0PTKyWtmLSM0b+adUTEvbs1PEaH2w=="
+        },
+        "yargs": {
+          "version": "13.3.0",
+          "resolved": "https://registry.npmjs.org/yargs/-/yargs-13.3.0.tgz",
+          "integrity": "sha512-2eehun/8ALW8TLoIl7MVaRUrg+yCnenu8B4kBlRxj3GJGDKU1Og7sMXPNm1BYyM1DOJmTZ4YeN/Nwxv+8XJsUA==",
+          "requires": {
+            "cliui": "^5.0.0",
+            "find-up": "^3.0.0",
+            "get-caller-file": "^2.0.1",
+            "require-directory": "^2.1.1",
+            "require-main-filename": "^2.0.0",
+            "set-blocking": "^2.0.0",
+            "string-width": "^3.0.0",
+            "which-module": "^2.0.0",
+            "y18n": "^4.0.0",
+            "yargs-parser": "^13.1.1"
+          }
+        }
+      }
+    },
+    "locate-path": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/locate-path/-/locate-path-3.0.0.tgz",
+      "integrity": "sha512-7AO748wWnIhNqAuaty2ZWHkQHRSNfPVIsPIfwEOWO22AmaoVrWavlOcMR5nzTLNYvp36X220/maaRsrec1G65A==",
+      "requires": {
+        "p-locate": "^3.0.0",
+        "path-exists": "^3.0.0"
+      }
+    },
+    "lodash": {
+      "version": "4.17.20",
+      "resolved": "https://registry.npmjs.org/lodash/-/lodash-4.17.20.tgz",
+      "integrity": "sha512-PlhdFcillOINfeV7Ni6oF1TAEayyZBoZ8bcshTHqOYJYlrqzRK5hagpagky5o4HfCzzd1TRkXPMFq6cKk9rGmA=="
+    },
+    "lodash.isfinite": {
+      "version": "3.3.2",
+      "resolved": "https://registry.npmjs.org/lodash.isfinite/-/lodash.isfinite-3.3.2.tgz",
+      "integrity": "sha1-+4m2WpqAKBgz8LdHizpRBPiY67M="
+    },
+    "micromatch": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmjs.org/micromatch/-/micromatch-4.0.2.tgz",
+      "integrity": "sha512-y7FpHSbMUMoyPbYUSzO6PaZ6FyRnQOpHuKwbo1G+Knck95XVU4QAiKdGEnj5wwoS7PlOgthX/09u5iFJ+aYf5Q==",
+      "requires": {
+        "braces": "^3.0.1",
+        "picomatch": "^2.0.5"
+      }
+    },
+    "mime": {
+      "version": "1.4.1",
+      "resolved": "https://registry.npmjs.org/mime/-/mime-1.4.1.tgz",
+      "integrity": "sha512-KI1+qOZu5DcW6wayYHSzR/tXKCDC5Om4s1z2QJjDULzLcmf3DvzS7oluY4HCTrc+9FiKmWUgeNLg7W3uIQvxtQ=="
+    },
+    "mime-db": {
+      "version": "1.44.0",
+      "resolved": "https://registry.npmjs.org/mime-db/-/mime-db-1.44.0.tgz",
+      "integrity": "sha512-/NOTfLrsPBVeH7YtFPgsVWveuL+4SjjYxaQ1xtM1KMFj7HdxlBlxeyNLzhyJVx7r4rZGJAZ/6lkKCitSc/Nmpg=="
+    },
+    "mime-types": {
+      "version": "2.1.27",
+      "resolved": "https://registry.npmjs.org/mime-types/-/mime-types-2.1.27.tgz",
+      "integrity": "sha512-JIhqnCasI9yD+SsmkquHBxTSEuZdQX5BuQnS2Vc7puQQQ+8yiP5AY5uWhpdv4YL4VM5c6iliiYWPgJ/nJQLp7w==",
+      "requires": {
+        "mime-db": "1.44.0"
+      }
+    },
+    "minimatch": {
+      "version": "3.0.4",
+      "resolved": "https://registry.npmjs.org/minimatch/-/minimatch-3.0.4.tgz",
+      "integrity": "sha512-yJHVQEhyqPLUTgt9B83PXu6W3rx4MvvHvSUvToogpwoGDOUQ+yDrR0HRot+yOCdCO7u4hX3pWft6kWBBcqh0UA==",
+      "requires": {
+        "brace-expansion": "^1.1.7"
+      }
+    },
+    "mitt": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/mitt/-/mitt-1.2.0.tgz",
+      "integrity": "sha512-r6lj77KlwqLhIUku9UWYes7KJtsczvolZkzp8hbaDPPaE24OmWl5s539Mytlj22siEQKosZ26qCBgda2PKwoJw=="
+    },
+    "ms": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
+      "integrity": "sha1-VgiurfwAvmwpAd9fmGF4jeDVl8g="
+    },
+    "negotiator": {
+      "version": "0.6.2",
+      "resolved": "https://registry.npmjs.org/negotiator/-/negotiator-0.6.2.tgz",
+      "integrity": "sha512-hZXc7K2e+PgeI1eDBe/10Ard4ekbfrrqG8Ep+8Jmf4JID2bNg7NvCPOZN+kfF574pFQI7mum2AUqDidoKqcTOw=="
+    },
+    "normalize-path": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/normalize-path/-/normalize-path-3.0.0.tgz",
+      "integrity": "sha512-6eZs5Ls3WtCisHWp9S2GUy8dqkpGi4BVSz3GaqiE6ezub0512ESztXUwUB6C6IKbQkY2Pnb/mD4WYojCRwcwLA=="
+    },
+    "object-component": {
+      "version": "0.0.3",
+      "resolved": "https://registry.npmjs.org/object-component/-/object-component-0.0.3.tgz",
+      "integrity": "sha1-8MaapQ78lbhmwYb0AKM3acsvEpE="
+    },
+    "on-finished": {
+      "version": "2.3.0",
+      "resolved": "https://registry.npmjs.org/on-finished/-/on-finished-2.3.0.tgz",
+      "integrity": "sha1-IPEzZIGwg811M3mSoWlxqi2QaUc=",
+      "requires": {
+        "ee-first": "1.1.1"
+      }
+    },
+    "openurl": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmjs.org/openurl/-/openurl-1.1.1.tgz",
+      "integrity": "sha1-OHW0sO96UsFW8NtB1GCduw+Us4c="
+    },
+    "opn": {
+      "version": "5.3.0",
+      "resolved": "https://registry.npmjs.org/opn/-/opn-5.3.0.tgz",
+      "integrity": "sha512-bYJHo/LOmoTd+pfiYhfZDnf9zekVJrY+cnS2a5F2x+w5ppvTqObojTP7WiFG+kVZs9Inw+qQ/lw7TroWwhdd2g==",
+      "requires": {
+        "is-wsl": "^1.1.0"
+      }
+    },
+    "p-limit": {
+      "version": "2.3.0",
+      "resolved": "https://registry.npmjs.org/p-limit/-/p-limit-2.3.0.tgz",
+      "integrity": "sha512-//88mFWSJx8lxCzwdAABTJL2MyWB12+eIY7MDL2SqLmAkeKU9qxRvWuSyTjm3FUmpBEMuFfckAIqEaVGUDxb6w==",
+      "requires": {
+        "p-try": "^2.0.0"
+      }
+    },
+    "p-locate": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/p-locate/-/p-locate-3.0.0.tgz",
+      "integrity": "sha512-x+12w/To+4GFfgJhBEpiDcLozRJGegY+Ei7/z0tSLkMmxGZNybVMSfWj9aJn8Z5Fc7dBUNJOOVgPv2H7IwulSQ==",
+      "requires": {
+        "p-limit": "^2.0.0"
+      }
+    },
+    "p-try": {
+      "version": "2.2.0",
+      "resolved": "https://registry.npmjs.org/p-try/-/p-try-2.2.0.tgz",
+      "integrity": "sha512-R4nPAVTAU0B9D35/Gk3uJf/7XYbQcyohSKdvAxIRSNghFl4e71hVoGnBNQz9cWaXxO2I10KTC+3jMdvvoKw6dQ=="
+    },
+    "parseqs": {
+      "version": "0.0.6",
+      "resolved": "https://registry.npmjs.org/parseqs/-/parseqs-0.0.6.tgz",
+      "integrity": "sha512-jeAGzMDbfSHHA091hr0r31eYfTig+29g3GKKE/PPbEQ65X0lmMwlEoqmhzu0iztID5uJpZsFlUPDP8ThPL7M8w=="
+    },
+    "parseuri": {
+      "version": "0.0.6",
+      "resolved": "https://registry.npmjs.org/parseuri/-/parseuri-0.0.6.tgz",
+      "integrity": "sha512-AUjen8sAkGgao7UyCX6Ahv0gIK2fABKmYjvP4xmy5JaKvcbTRueIqIPHLAfq30xJddqSE033IOMUSOMCcK3Sow=="
+    },
+    "parseurl": {
+      "version": "1.3.3",
+      "resolved": "https://registry.npmjs.org/parseurl/-/parseurl-1.3.3.tgz",
+      "integrity": "sha512-CiyeOxFT/JZyN5m0z9PfXw4SCBJ6Sygz1Dpl0wqjlhDEGGBP1GnsUVEL0p63hoG1fcj3fHynXi9NYO4nWOL+qQ=="
+    },
+    "path-exists": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/path-exists/-/path-exists-3.0.0.tgz",
+      "integrity": "sha1-zg6+ql94yxiSXqfYENe1mwEP1RU="
+    },
+    "picomatch": {
+      "version": "2.2.2",
+      "resolved": "https://registry.npmjs.org/picomatch/-/picomatch-2.2.2.tgz",
+      "integrity": "sha512-q0M/9eZHzmr0AulXyPwNfZjtwZ/RBZlbN3K3CErVrk50T2ASYI7Bye0EvekFY3IP1Nt2DHu0re+V2ZHIpMkuWg=="
+    },
+    "portscanner": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmjs.org/portscanner/-/portscanner-2.1.1.tgz",
+      "integrity": "sha1-6rtAnk3iSVD1oqUW01rnaTQ/u5Y=",
+      "requires": {
+        "async": "1.5.2",
+        "is-number-like": "^1.0.3"
+      }
+    },
+    "qs": {
+      "version": "6.2.3",
+      "resolved": "https://registry.npmjs.org/qs/-/qs-6.2.3.tgz",
+      "integrity": "sha1-HPyyXBCpsrSDBT/zn138kjOQjP4="
+    },
+    "range-parser": {
+      "version": "1.2.1",
+      "resolved": "https://registry.npmjs.org/range-parser/-/range-parser-1.2.1.tgz",
+      "integrity": "sha512-Hrgsx+orqoygnmhFbKaHE6c296J+HTAQXoxEF6gNupROmmGJRoyzfG3ccAveqCBrwr/2yxQ5BVd/GTl5agOwSg=="
+    },
+    "raw-body": {
+      "version": "2.4.1",
+      "resolved": "https://registry.npmjs.org/raw-body/-/raw-body-2.4.1.tgz",
+      "integrity": "sha512-9WmIKF6mkvA0SLmA2Knm9+qj89e+j1zqgyn8aXGd7+nAduPoqgI9lO57SAZNn/Byzo5P7JhXTyg9PzaJbH73bA==",
+      "requires": {
+        "bytes": "3.1.0",
+        "http-errors": "1.7.3",
+        "iconv-lite": "0.4.24",
+        "unpipe": "1.0.0"
+      }
+    },
+    "readdirp": {
+      "version": "3.5.0",
+      "resolved": "https://registry.npmjs.org/readdirp/-/readdirp-3.5.0.tgz",
+      "integrity": "sha512-cMhu7c/8rdhkHXWsY+osBhfSy0JikwpHK/5+imo+LpeasTF8ouErHrlYkwT0++njiyuDvc7OFY5T3ukvZ8qmFQ==",
+      "requires": {
+        "picomatch": "^2.2.1"
+      }
+    },
+    "require-directory": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmjs.org/require-directory/-/require-directory-2.1.1.tgz",
+      "integrity": "sha1-jGStX9MNqxyXbiNE/+f3kqam30I="
+    },
+    "require-main-filename": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/require-main-filename/-/require-main-filename-2.0.0.tgz",
+      "integrity": "sha512-NKN5kMDylKuldxYLSUfrbo5Tuzh4hd+2E8NPPX02mZtn1VuREQToYe/ZdlJy+J3uCpfaiGF05e7B8W0iXbQHmg=="
+    },
+    "requires-port": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/requires-port/-/requires-port-1.0.0.tgz",
+      "integrity": "sha1-kl0mAdOaxIXgkc8NpcbmlNw9yv8="
+    },
+    "resp-modifier": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/resp-modifier/-/resp-modifier-6.0.2.tgz",
+      "integrity": "sha1-sSTeXE+6/LpUH0j/pzlw9KpFa08=",
+      "requires": {
+        "debug": "^2.2.0",
+        "minimatch": "^3.0.2"
+      },
+      "dependencies": {
+        "debug": {
+          "version": "2.6.9",
+          "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
+          "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
+          "requires": {
+            "ms": "2.0.0"
+          }
+        }
+      }
+    },
+    "rx": {
+      "version": "4.1.0",
+      "resolved": "https://registry.npmjs.org/rx/-/rx-4.1.0.tgz",
+      "integrity": "sha1-pfE/957zt0D+MKqAP7CfmIBdR4I="
+    },
+    "rxjs": {
+      "version": "5.5.12",
+      "resolved": "https://registry.npmjs.org/rxjs/-/rxjs-5.5.12.tgz",
+      "integrity": "sha512-xx2itnL5sBbqeeiVgNPVuQQ1nC8Jp2WfNJhXWHmElW9YmrpS9UVnNzhP3EH3HFqexO5Tlp8GhYY+WEcqcVMvGw==",
+      "requires": {
+        "symbol-observable": "1.0.1"
+      }
+    },
+    "safe-buffer": {
+      "version": "5.1.2",
+      "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.1.2.tgz",
+      "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g=="
+    },
+    "safer-buffer": {
+      "version": "2.1.2",
+      "resolved": "https://registry.npmjs.org/safer-buffer/-/safer-buffer-2.1.2.tgz",
+      "integrity": "sha512-YZo3K82SD7Riyi0E1EQPojLz7kpepnSQI9IyPbHHg1XXXevb5dJI7tpyN2ADxGcQbHG7vcyRHk0cbwqcQriUtg=="
+    },
+    "send": {
+      "version": "0.16.2",
+      "resolved": "https://registry.npmjs.org/send/-/send-0.16.2.tgz",
+      "integrity": "sha512-E64YFPUssFHEFBvpbbjr44NCLtI1AohxQ8ZSiJjQLskAdKuriYEP6VyGEsRDH8ScozGpkaX1BGvhanqCwkcEZw==",
+      "requires": {
+        "debug": "2.6.9",
+        "depd": "~1.1.2",
+        "destroy": "~1.0.4",
+        "encodeurl": "~1.0.2",
+        "escape-html": "~1.0.3",
+        "etag": "~1.8.1",
+        "fresh": "0.5.2",
+        "http-errors": "~1.6.2",
+        "mime": "1.4.1",
+        "ms": "2.0.0",
+        "on-finished": "~2.3.0",
+        "range-parser": "~1.2.0",
+        "statuses": "~1.4.0"
+      },
+      "dependencies": {
+        "debug": {
+          "version": "2.6.9",
+          "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
+          "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
+          "requires": {
+            "ms": "2.0.0"
+          }
+        },
+        "http-errors": {
+          "version": "1.6.3",
+          "resolved": "https://registry.npmjs.org/http-errors/-/http-errors-1.6.3.tgz",
+          "integrity": "sha1-i1VoC7S+KDoLW/TqLjhYC+HZMg0=",
+          "requires": {
+            "depd": "~1.1.2",
+            "inherits": "2.0.3",
+            "setprototypeof": "1.1.0",
+            "statuses": ">= 1.4.0 < 2"
+          }
+        },
+        "inherits": {
+          "version": "2.0.3",
+          "resolved": "https://registry.npmjs.org/inherits/-/inherits-2.0.3.tgz",
+          "integrity": "sha1-Yzwsg+PaQqUC9SRmAiSA9CCCYd4="
+        },
+        "setprototypeof": {
+          "version": "1.1.0",
+          "resolved": "https://registry.npmjs.org/setprototypeof/-/setprototypeof-1.1.0.tgz",
+          "integrity": "sha512-BvE/TwpZX4FXExxOxZyRGQQv651MSwmWKZGqvmPcRIjDqWub67kTKuIMx43cZZrS/cBBzwBcNDWoFxt2XEFIpQ=="
+        },
+        "statuses": {
+          "version": "1.4.0",
+          "resolved": "https://registry.npmjs.org/statuses/-/statuses-1.4.0.tgz",
+          "integrity": "sha512-zhSCtt8v2NDrRlPQpCNtw/heZLtfUDqxBM1udqikb/Hbk52LK4nQSwr10u77iopCW5LsyHpuXS0GnEc48mLeew=="
+        }
+      }
+    },
+    "serve-index": {
+      "version": "1.9.1",
+      "resolved": "https://registry.npmjs.org/serve-index/-/serve-index-1.9.1.tgz",
+      "integrity": "sha1-03aNabHn2C5c4FD/9bRTvqEqkjk=",
+      "requires": {
+        "accepts": "~1.3.4",
+        "batch": "0.6.1",
+        "debug": "2.6.9",
+        "escape-html": "~1.0.3",
+        "http-errors": "~1.6.2",
+        "mime-types": "~2.1.17",
+        "parseurl": "~1.3.2"
+      },
+      "dependencies": {
+        "debug": {
+          "version": "2.6.9",
+          "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
+          "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
+          "requires": {
+            "ms": "2.0.0"
+          }
+        },
+        "http-errors": {
+          "version": "1.6.3",
+          "resolved": "https://registry.npmjs.org/http-errors/-/http-errors-1.6.3.tgz",
+          "integrity": "sha1-i1VoC7S+KDoLW/TqLjhYC+HZMg0=",
+          "requires": {
+            "depd": "~1.1.2",
+            "inherits": "2.0.3",
+            "setprototypeof": "1.1.0",
+            "statuses": ">= 1.4.0 < 2"
+          }
+        },
+        "inherits": {
+          "version": "2.0.3",
+          "resolved": "https://registry.npmjs.org/inherits/-/inherits-2.0.3.tgz",
+          "integrity": "sha1-Yzwsg+PaQqUC9SRmAiSA9CCCYd4="
+        },
+        "setprototypeof": {
+          "version": "1.1.0",
+          "resolved": "https://registry.npmjs.org/setprototypeof/-/setprototypeof-1.1.0.tgz",
+          "integrity": "sha512-BvE/TwpZX4FXExxOxZyRGQQv651MSwmWKZGqvmPcRIjDqWub67kTKuIMx43cZZrS/cBBzwBcNDWoFxt2XEFIpQ=="
+        },
+        "statuses": {
+          "version": "1.5.0",
+          "resolved": "https://registry.npmjs.org/statuses/-/statuses-1.5.0.tgz",
+          "integrity": "sha1-Fhx9rBd2Wf2YEfQ3cfqZOBR4Yow="
+        }
+      }
+    },
+    "serve-static": {
+      "version": "1.13.2",
+      "resolved": "https://registry.npmjs.org/serve-static/-/serve-static-1.13.2.tgz",
+      "integrity": "sha512-p/tdJrO4U387R9oMjb1oj7qSMaMfmOyd4j9hOFoxZe2baQszgHcSWjuya/CiT5kgZZKRudHNOA0pYXOl8rQ5nw==",
+      "requires": {
+        "encodeurl": "~1.0.2",
+        "escape-html": "~1.0.3",
+        "parseurl": "~1.3.2",
+        "send": "0.16.2"
+      }
+    },
+    "server-destroy": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/server-destroy/-/server-destroy-1.0.1.tgz",
+      "integrity": "sha1-8Tv5KOQrnD55OD5hzDmYtdFObN0="
+    },
+    "set-blocking": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/set-blocking/-/set-blocking-2.0.0.tgz",
+      "integrity": "sha1-BF+XgtARrppoA93TgrJDkrPYkPc="
+    },
+    "setprototypeof": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmjs.org/setprototypeof/-/setprototypeof-1.1.1.tgz",
+      "integrity": "sha512-JvdAWfbXeIGaZ9cILp38HntZSFSo3mWg6xGcJJsd+d4aRMOqauag1C63dJfDw7OaMYwEbHMOxEZ1lqVRYP2OAw=="
+    },
+    "socket.io": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmjs.org/socket.io/-/socket.io-2.1.1.tgz",
+      "integrity": "sha512-rORqq9c+7W0DAK3cleWNSyfv/qKXV99hV4tZe+gGLfBECw3XEhBy7x85F3wypA9688LKjtwO9pX9L33/xQI8yA==",
+      "requires": {
+        "debug": "~3.1.0",
+        "engine.io": "~3.2.0",
+        "has-binary2": "~1.0.2",
+        "socket.io-adapter": "~1.1.0",
+        "socket.io-client": "2.1.1",
+        "socket.io-parser": "~3.2.0"
+      },
+      "dependencies": {
+        "base64-arraybuffer": {
+          "version": "0.1.5",
+          "resolved": "https://registry.npmjs.org/base64-arraybuffer/-/base64-arraybuffer-0.1.5.tgz",
+          "integrity": "sha1-c5JncZI7Whl0etZmqlzUv5xunOg="
+        },
+        "component-emitter": {
+          "version": "1.2.1",
+          "resolved": "https://registry.npmjs.org/component-emitter/-/component-emitter-1.2.1.tgz",
+          "integrity": "sha1-E3kY1teCg/ffemt8WmPhQOaUJeY="
+        },
+        "engine.io-client": {
+          "version": "3.2.1",
+          "resolved": "https://registry.npmjs.org/engine.io-client/-/engine.io-client-3.2.1.tgz",
+          "integrity": "sha512-y5AbkytWeM4jQr7m/koQLc5AxpRKC1hEVUb/s1FUAWEJq5AzJJ4NLvzuKPuxtDi5Mq755WuDvZ6Iv2rXj4PTzw==",
+          "requires": {
+            "component-emitter": "1.2.1",
+            "component-inherit": "0.0.3",
+            "debug": "~3.1.0",
+            "engine.io-parser": "~2.1.1",
+            "has-cors": "1.1.0",
+            "indexof": "0.0.1",
+            "parseqs": "0.0.5",
+            "parseuri": "0.0.5",
+            "ws": "~3.3.1",
+            "xmlhttprequest-ssl": "~1.5.4",
+            "yeast": "0.1.2"
+          }
+        },
+        "engine.io-parser": {
+          "version": "2.1.3",
+          "resolved": "https://registry.npmjs.org/engine.io-parser/-/engine.io-parser-2.1.3.tgz",
+          "integrity": "sha512-6HXPre2O4Houl7c4g7Ic/XzPnHBvaEmN90vtRO9uLmwtRqQmTOw0QMevL1TOfL2Cpu1VzsaTmMotQgMdkzGkVA==",
+          "requires": {
+            "after": "0.8.2",
+            "arraybuffer.slice": "~0.0.7",
+            "base64-arraybuffer": "0.1.5",
+            "blob": "0.0.5",
+            "has-binary2": "~1.0.2"
+          }
+        },
+        "parseqs": {
+          "version": "0.0.5",
+          "resolved": "https://registry.npmjs.org/parseqs/-/parseqs-0.0.5.tgz",
+          "integrity": "sha1-1SCKNzjkZ2bikbouoXNoSSGouJ0=",
+          "requires": {
+            "better-assert": "~1.0.0"
+          }
+        },
+        "parseuri": {
+          "version": "0.0.5",
+          "resolved": "https://registry.npmjs.org/parseuri/-/parseuri-0.0.5.tgz",
+          "integrity": "sha1-gCBKUNTbt3m/3G6+J3jZDkvOMgo=",
+          "requires": {
+            "better-assert": "~1.0.0"
+          }
+        },
+        "socket.io-client": {
+          "version": "2.1.1",
+          "resolved": "https://registry.npmjs.org/socket.io-client/-/socket.io-client-2.1.1.tgz",
+          "integrity": "sha512-jxnFyhAuFxYfjqIgduQlhzqTcOEQSn+OHKVfAxWaNWa7ecP7xSNk2Dx/3UEsDcY7NcFafxvNvKPmmO7HTwTxGQ==",
+          "requires": {
+            "backo2": "1.0.2",
+            "base64-arraybuffer": "0.1.5",
+            "component-bind": "1.0.0",
+            "component-emitter": "1.2.1",
+            "debug": "~3.1.0",
+            "engine.io-client": "~3.2.0",
+            "has-binary2": "~1.0.2",
+            "has-cors": "1.1.0",
+            "indexof": "0.0.1",
+            "object-component": "0.0.3",
+            "parseqs": "0.0.5",
+            "parseuri": "0.0.5",
+            "socket.io-parser": "~3.2.0",
+            "to-array": "0.1.4"
+          }
+        },
+        "socket.io-parser": {
+          "version": "3.2.0",
+          "resolved": "https://registry.npmjs.org/socket.io-parser/-/socket.io-parser-3.2.0.tgz",
+          "integrity": "sha512-FYiBx7rc/KORMJlgsXysflWx/RIvtqZbyGLlHZvjfmPTPeuD/I8MaW7cfFrj5tRltICJdgwflhfZ3NVVbVLFQA==",
+          "requires": {
+            "component-emitter": "1.2.1",
+            "debug": "~3.1.0",
+            "isarray": "2.0.1"
+          }
+        },
+        "ws": {
+          "version": "3.3.3",
+          "resolved": "https://registry.npmjs.org/ws/-/ws-3.3.3.tgz",
+          "integrity": "sha512-nnWLa/NwZSt4KQJu51MYlCcSQ5g7INpOrOMt4XV8j4dqTXdmlUmSHQ8/oLC069ckre0fRsgfvsKwbTdtKLCDkA==",
+          "requires": {
+            "async-limiter": "~1.0.0",
+            "safe-buffer": "~5.1.0",
+            "ultron": "~1.1.0"
+          }
+        }
+      }
+    },
+    "socket.io-adapter": {
+      "version": "1.1.2",
+      "resolved": "https://registry.npmjs.org/socket.io-adapter/-/socket.io-adapter-1.1.2.tgz",
+      "integrity": "sha512-WzZRUj1kUjrTIrUKpZLEzFZ1OLj5FwLlAFQs9kuZJzJi5DKdU7FsWc36SNmA8iDOtwBQyT8FkrriRM8vXLYz8g=="
+    },
+    "socket.io-client": {
+      "version": "2.3.1",
+      "resolved": "https://registry.npmjs.org/socket.io-client/-/socket.io-client-2.3.1.tgz",
+      "integrity": "sha512-YXmXn3pA8abPOY//JtYxou95Ihvzmg8U6kQyolArkIyLd0pgVhrfor/iMsox8cn07WCOOvvuJ6XKegzIucPutQ==",
+      "requires": {
+        "backo2": "1.0.2",
+        "component-bind": "1.0.0",
+        "component-emitter": "~1.3.0",
+        "debug": "~3.1.0",
+        "engine.io-client": "~3.4.0",
+        "has-binary2": "~1.0.2",
+        "indexof": "0.0.1",
+        "parseqs": "0.0.6",
+        "parseuri": "0.0.6",
+        "socket.io-parser": "~3.3.0",
+        "to-array": "0.1.4"
+      }
+    },
+    "socket.io-parser": {
+      "version": "3.3.1",
+      "resolved": "https://registry.npmjs.org/socket.io-parser/-/socket.io-parser-3.3.1.tgz",
+      "integrity": "sha512-1QLvVAe8dTz+mKmZ07Swxt+LAo4Y1ff50rlyoEx00TQmDFVQYPfcqGvIDJLGaBdhdNCecXtyKpD+EgKGcmmbuQ==",
+      "requires": {
+        "component-emitter": "~1.3.0",
+        "debug": "~3.1.0",
+        "isarray": "2.0.1"
+      }
+    },
+    "statuses": {
+      "version": "1.3.1",
+      "resolved": "https://registry.npmjs.org/statuses/-/statuses-1.3.1.tgz",
+      "integrity": "sha1-+vUbnrdKrvOzrPStX2Gr8ky3uT4="
+    },
+    "stream-throttle": {
+      "version": "0.1.3",
+      "resolved": "https://registry.npmjs.org/stream-throttle/-/stream-throttle-0.1.3.tgz",
+      "integrity": "sha1-rdV8jXzHOoFjDTHNVdOWHPr7qcM=",
+      "requires": {
+        "commander": "^2.2.0",
+        "limiter": "^1.0.5"
+      }
+    },
+    "string-width": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmjs.org/string-width/-/string-width-3.1.0.tgz",
+      "integrity": "sha512-vafcv6KjVZKSgz06oM/H6GDBrAtz8vdhQakGjFIvNrHA6y3HCF1CInLy+QLq8dTJPQ1b+KDUqDFctkdRW44e1w==",
+      "requires": {
+        "emoji-regex": "^7.0.1",
+        "is-fullwidth-code-point": "^2.0.0",
+        "strip-ansi": "^5.1.0"
+      },
+      "dependencies": {
+        "ansi-regex": {
+          "version": "4.1.0",
+          "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-4.1.0.tgz",
+          "integrity": "sha512-1apePfXM1UOSqw0o9IiFAovVz9M5S1Dg+4TrDwfMewQ6p/rmMueb7tWZjQ1rx4Loy1ArBggoqGpfqqdI4rondg=="
+        },
+        "strip-ansi": {
+          "version": "5.2.0",
+          "resolved": "https://registry.npmjs.org/strip-ansi/-/strip-ansi-5.2.0.tgz",
+          "integrity": "sha512-DuRs1gKbBqsMKIZlrffwlug8MHkcnpjs5VPmL1PAh+mA30U0DTotfDZ0d2UUsXpPmPmMMJ6W773MaA3J+lbiWA==",
+          "requires": {
+            "ansi-regex": "^4.1.0"
+          }
+        }
+      }
+    },
+    "strip-ansi": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmjs.org/strip-ansi/-/strip-ansi-3.0.1.tgz",
+      "integrity": "sha1-ajhfuIU9lS1f8F0Oiq+UJ43GPc8=",
+      "requires": {
+        "ansi-regex": "^2.0.0"
+      }
+    },
+    "supports-color": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/supports-color/-/supports-color-2.0.0.tgz",
+      "integrity": "sha1-U10EXOa2Nj+kARcIRimZXp3zJMc="
+    },
+    "symbol-observable": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/symbol-observable/-/symbol-observable-1.0.1.tgz",
+      "integrity": "sha1-g0D8RwLDEi310iKI+IKD9RPT/dQ="
+    },
+    "tfunk": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmjs.org/tfunk/-/tfunk-4.0.0.tgz",
+      "integrity": "sha512-eJQ0dGfDIzWNiFNYFVjJ+Ezl/GmwHaFTBTjrtqNPW0S7cuVDBrZrmzUz6VkMeCR4DZFqhd4YtLwsw3i2wYHswQ==",
+      "requires": {
+        "chalk": "^1.1.3",
+        "dlv": "^1.1.3"
+      }
+    },
+    "to-array": {
+      "version": "0.1.4",
+      "resolved": "https://registry.npmjs.org/to-array/-/to-array-0.1.4.tgz",
+      "integrity": "sha1-F+bBH3PdTz10zaek/zI46a2b+JA="
+    },
+    "to-regex-range": {
+      "version": "5.0.1",
+      "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-5.0.1.tgz",
+      "integrity": "sha512-65P7iz6X5yEr1cwcgvQxbbIw7Uk3gOy5dIdtZ4rDveLqhrdJP+Li/Hx6tyK0NEb+2GCyneCMJiGqrADCSNk8sQ==",
+      "requires": {
+        "is-number": "^7.0.0"
+      }
+    },
+    "toidentifier": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/toidentifier/-/toidentifier-1.0.0.tgz",
+      "integrity": "sha512-yaOH/Pk/VEhBWWTlhI+qXxDFXlejDGcQipMlyxda9nthulaxLZUNcUqFxokp0vcYnvteJln5FNQDRrxj3YcbVw=="
+    },
+    "ua-parser-js": {
+      "version": "0.7.22",
+      "resolved": "https://registry.npmjs.org/ua-parser-js/-/ua-parser-js-0.7.22.tgz",
+      "integrity": "sha512-YUxzMjJ5T71w6a8WWVcMGM6YWOTX27rCoIQgLXiWaxqXSx9D7DNjiGWn1aJIRSQ5qr0xuhra77bSIh6voR/46Q=="
+    },
+    "ultron": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmjs.org/ultron/-/ultron-1.1.1.tgz",
+      "integrity": "sha512-UIEXBNeYmKptWH6z8ZnqTeS8fV74zG0/eRU9VGkpzz+LIJNs8W/zM/L+7ctCkRrgbNnnR0xxw4bKOr0cW0N0Og=="
+    },
+    "universalify": {
+      "version": "0.1.2",
+      "resolved": "https://registry.npmjs.org/universalify/-/universalify-0.1.2.tgz",
+      "integrity": "sha512-rBJeI5CXAlmy1pV+617WB9J63U6XcazHHF2f2dbJix4XzpUF0RS3Zbj0FGIOCAva5P/d/GBOYaACQ1w+0azUkg=="
+    },
+    "unpipe": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/unpipe/-/unpipe-1.0.0.tgz",
+      "integrity": "sha1-sr9O6FFKrmFltIF4KdIbLvSZBOw="
+    },
+    "utils-merge": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/utils-merge/-/utils-merge-1.0.1.tgz",
+      "integrity": "sha1-n5VxD1CiZ5R7LMwSR0HBAoQn5xM="
+    },
+    "which-module": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/which-module/-/which-module-2.0.0.tgz",
+      "integrity": "sha1-2e8H3Od7mQK4o6j6SzHD4/fm6Ho="
+    },
+    "wrap-ansi": {
+      "version": "5.1.0",
+      "resolved": "https://registry.npmjs.org/wrap-ansi/-/wrap-ansi-5.1.0.tgz",
+      "integrity": "sha512-QC1/iN/2/RPVJ5jYK8BGttj5z83LmSKmvbvrXPNCLZSEb32KKVDJDl/MOt2N01qU2H/FkzEa9PKto1BqDjtd7Q==",
+      "requires": {
+        "ansi-styles": "^3.2.0",
+        "string-width": "^3.0.0",
+        "strip-ansi": "^5.0.0"
+      },
+      "dependencies": {
+        "ansi-regex": {
+          "version": "4.1.0",
+          "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-4.1.0.tgz",
+          "integrity": "sha512-1apePfXM1UOSqw0o9IiFAovVz9M5S1Dg+4TrDwfMewQ6p/rmMueb7tWZjQ1rx4Loy1ArBggoqGpfqqdI4rondg=="
+        },
+        "ansi-styles": {
+          "version": "3.2.1",
+          "resolved": "https://registry.npmjs.org/ansi-styles/-/ansi-styles-3.2.1.tgz",
+          "integrity": "sha512-VT0ZI6kZRdTh8YyJw3SMbYm/u+NqfsAxEpWO0Pf9sq8/e94WxxOpPKx9FR1FlyCtOVDNOQ+8ntlqFxiRc+r5qA==",
+          "requires": {
+            "color-convert": "^1.9.0"
+          }
+        },
+        "strip-ansi": {
+          "version": "5.2.0",
+          "resolved": "https://registry.npmjs.org/strip-ansi/-/strip-ansi-5.2.0.tgz",
+          "integrity": "sha512-DuRs1gKbBqsMKIZlrffwlug8MHkcnpjs5VPmL1PAh+mA30U0DTotfDZ0d2UUsXpPmPmMMJ6W773MaA3J+lbiWA==",
+          "requires": {
+            "ansi-regex": "^4.1.0"
+          }
+        }
+      }
+    },
+    "ws": {
+      "version": "6.1.4",
+      "resolved": "https://registry.npmjs.org/ws/-/ws-6.1.4.tgz",
+      "integrity": "sha512-eqZfL+NE/YQc1/ZynhojeV8q+H050oR8AZ2uIev7RU10svA9ZnJUddHcOUZTJLinZ9yEfdA2kSATS2qZK5fhJA==",
+      "requires": {
+        "async-limiter": "~1.0.0"
+      }
+    },
+    "xmlhttprequest-ssl": {
+      "version": "1.5.5",
+      "resolved": "https://registry.npmjs.org/xmlhttprequest-ssl/-/xmlhttprequest-ssl-1.5.5.tgz",
+      "integrity": "sha1-wodrBhaKrcQOV9l+gRkayPQ5iz4="
+    },
+    "y18n": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmjs.org/y18n/-/y18n-4.0.0.tgz",
+      "integrity": "sha512-r9S/ZyXu/Xu9q1tYlpsLIsa3EeLXXk0VwlxqTcFRfg9EhMW+17kbt9G0NrgCmhGb5vT2hyhJZLfDGx+7+5Uj/w=="
+    },
+    "yargs": {
+      "version": "15.4.1",
+      "resolved": "https://registry.npmjs.org/yargs/-/yargs-15.4.1.tgz",
+      "integrity": "sha512-aePbxDmcYW++PaqBsJ+HYUFwCdv4LVvdnhBy78E57PIor8/OVvhMrADFFEDh8DHDFRv/O9i3lPhsENjO7QX0+A==",
+      "requires": {
+        "cliui": "^6.0.0",
+        "decamelize": "^1.2.0",
+        "find-up": "^4.1.0",
+        "get-caller-file": "^2.0.1",
+        "require-directory": "^2.1.1",
+        "require-main-filename": "^2.0.0",
+        "set-blocking": "^2.0.0",
+        "string-width": "^4.2.0",
+        "which-module": "^2.0.0",
+        "y18n": "^4.0.0",
+        "yargs-parser": "^18.1.2"
+      },
+      "dependencies": {
+        "ansi-regex": {
+          "version": "5.0.0",
+          "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-5.0.0.tgz",
+          "integrity": "sha512-bY6fj56OUQ0hU1KjFNDQuJFezqKdrAyFdIevADiqrWHwSlbmBNMHp5ak2f40Pm8JTFyM2mqxkG6ngkHO11f/lg=="
+        },
+        "ansi-styles": {
+          "version": "4.3.0",
+          "resolved": "https://registry.npmjs.org/ansi-styles/-/ansi-styles-4.3.0.tgz",
+          "integrity": "sha512-zbB9rCJAT1rbjiVDb2hqKFHNYLxgtk8NURxZ3IZwD3F6NtxbXZQCnnSi1Lkx+IDohdPlFp222wVALIheZJQSEg==",
+          "requires": {
+            "color-convert": "^2.0.1"
+          }
+        },
+        "cliui": {
+          "version": "6.0.0",
+          "resolved": "https://registry.npmjs.org/cliui/-/cliui-6.0.0.tgz",
+          "integrity": "sha512-t6wbgtoCXvAzst7QgXxJYqPt0usEfbgQdftEPbLL/cvv6HPE5VgvqCuAIDR0NgU52ds6rFwqrgakNLrHEjCbrQ==",
+          "requires": {
+            "string-width": "^4.2.0",
+            "strip-ansi": "^6.0.0",
+            "wrap-ansi": "^6.2.0"
+          }
+        },
+        "color-convert": {
+          "version": "2.0.1",
+          "resolved": "https://registry.npmjs.org/color-convert/-/color-convert-2.0.1.tgz",
+          "integrity": "sha512-RRECPsj7iu/xb5oKYcsFHSppFNnsj/52OVTRKb4zP5onXwVF3zVmmToNcOfGC+CRDpfK/U584fMg38ZHCaElKQ==",
+          "requires": {
+            "color-name": "~1.1.4"
+          }
+        },
+        "color-name": {
+          "version": "1.1.4",
+          "resolved": "https://registry.npmjs.org/color-name/-/color-name-1.1.4.tgz",
+          "integrity": "sha512-dOy+3AuW3a2wNbZHIuMZpTcgjGuLU/uBL/ubcZF9OXbDo8ff4O8yVp5Bf0efS8uEoYo5q4Fx7dY9OgQGXgAsQA=="
+        },
+        "emoji-regex": {
+          "version": "8.0.0",
+          "resolved": "https://registry.npmjs.org/emoji-regex/-/emoji-regex-8.0.0.tgz",
+          "integrity": "sha512-MSjYzcWNOA0ewAHpz0MxpYFvwg6yjy1NG3xteoqz644VCo/RPgnr1/GGt+ic3iJTzQ8Eu3TdM14SawnVUmGE6A=="
+        },
+        "find-up": {
+          "version": "4.1.0",
+          "resolved": "https://registry.npmjs.org/find-up/-/find-up-4.1.0.tgz",
+          "integrity": "sha512-PpOwAdQ/YlXQ2vj8a3h8IipDuYRi3wceVQQGYWxNINccq40Anw7BlsEXCMbt1Zt+OLA6Fq9suIpIWD0OsnISlw==",
+          "requires": {
+            "locate-path": "^5.0.0",
+            "path-exists": "^4.0.0"
+          }
+        },
+        "is-fullwidth-code-point": {
+          "version": "3.0.0",
+          "resolved": "https://registry.npmjs.org/is-fullwidth-code-point/-/is-fullwidth-code-point-3.0.0.tgz",
+          "integrity": "sha512-zymm5+u+sCsSWyD9qNaejV3DFvhCKclKdizYaJUuHA83RLjb7nSuGnddCHGv0hk+KY7BMAlsWeK4Ueg6EV6XQg=="
+        },
+        "locate-path": {
+          "version": "5.0.0",
+          "resolved": "https://registry.npmjs.org/locate-path/-/locate-path-5.0.0.tgz",
+          "integrity": "sha512-t7hw9pI+WvuwNJXwk5zVHpyhIqzg2qTlklJOf0mVxGSbe3Fp2VieZcduNYjaLDoy6p9uGpQEGWG87WpMKlNq8g==",
+          "requires": {
+            "p-locate": "^4.1.0"
+          }
+        },
+        "p-locate": {
+          "version": "4.1.0",
+          "resolved": "https://registry.npmjs.org/p-locate/-/p-locate-4.1.0.tgz",
+          "integrity": "sha512-R79ZZ/0wAxKGu3oYMlz8jy/kbhsNrS7SKZ7PxEHBgJ5+F2mtFW2fK2cOtBh1cHYkQsbzFV7I+EoRKe6Yt0oK7A==",
+          "requires": {
+            "p-limit": "^2.2.0"
+          }
+        },
+        "path-exists": {
+          "version": "4.0.0",
+          "resolved": "https://registry.npmjs.org/path-exists/-/path-exists-4.0.0.tgz",
+          "integrity": "sha512-ak9Qy5Q7jYb2Wwcey5Fpvg2KoAc/ZIhLSLOSBmRmygPsGwkVVt0fZa0qrtMz+m6tJTAHfZQ8FnmB4MG4LWy7/w=="
+        },
+        "string-width": {
+          "version": "4.2.0",
+          "resolved": "https://registry.npmjs.org/string-width/-/string-width-4.2.0.tgz",
+          "integrity": "sha512-zUz5JD+tgqtuDjMhwIg5uFVV3dtqZ9yQJlZVfq4I01/K5Paj5UHj7VyrQOJvzawSVlKpObApbfD0Ed6yJc+1eg==",
+          "requires": {
+            "emoji-regex": "^8.0.0",
+            "is-fullwidth-code-point": "^3.0.0",
+            "strip-ansi": "^6.0.0"
+          }
+        },
+        "strip-ansi": {
+          "version": "6.0.0",
+          "resolved": "https://registry.npmjs.org/strip-ansi/-/strip-ansi-6.0.0.tgz",
+          "integrity": "sha512-AuvKTrTfQNYNIctbR1K/YGTR1756GycPsg7b9bdV9Duqur4gv6aKqHXah67Z8ImS7WEz5QVcOtlfW2rZEugt6w==",
+          "requires": {
+            "ansi-regex": "^5.0.0"
+          }
+        },
+        "wrap-ansi": {
+          "version": "6.2.0",
+          "resolved": "https://registry.npmjs.org/wrap-ansi/-/wrap-ansi-6.2.0.tgz",
+          "integrity": "sha512-r6lPcBGxZXlIcymEu7InxDMhdW0KDxpLgoFLcguasxCaJ/SOIZwINatK9KY/tf+ZrlywOKU0UDj3ATXUBfxJXA==",
+          "requires": {
+            "ansi-styles": "^4.0.0",
+            "string-width": "^4.1.0",
+            "strip-ansi": "^6.0.0"
+          }
+        },
+        "yargs-parser": {
+          "version": "18.1.3",
+          "resolved": "https://registry.npmjs.org/yargs-parser/-/yargs-parser-18.1.3.tgz",
+          "integrity": "sha512-o50j0JeToy/4K6OZcaQmW6lyXXKhq7csREXcDwk2omFPJEwUNOVtJKvmDr9EI1fAJZUyZcRF7kxGBWmRXudrCQ==",
+          "requires": {
+            "camelcase": "^5.0.0",
+            "decamelize": "^1.2.0"
+          }
+        }
+      }
+    },
+    "yargs-parser": {
+      "version": "13.1.2",
+      "resolved": "https://registry.npmjs.org/yargs-parser/-/yargs-parser-13.1.2.tgz",
+      "integrity": "sha512-3lbsNRf/j+A4QuSZfDRA7HRSfWrzO0YjqTJd5kjAq37Zep1CEgaYmrH9Q3GwPiB9cHyd1Y1UwggGhJGoxipbzg==",
+      "requires": {
+        "camelcase": "^5.0.0",
+        "decamelize": "^1.2.0"
+      }
+    },
+    "yeast": {
+      "version": "0.1.2",
+      "resolved": "https://registry.npmjs.org/yeast/-/yeast-0.1.2.tgz",
+      "integrity": "sha1-AI4G2AlDIMNy28L47XagymyKxBk="
+    }
+  }
+}
diff --git a/JavaScript Challenges/Javascript 30/Day21/package.json b/JavaScript Challenges/Javascript 30/Day21/package.json
new file mode 100644
index 0000000..98bc2b5
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day21/package.json	
@@ -0,0 +1,14 @@
+{
+  "name": "gum",
+  "version": "1.0.0",
+  "description": "",
+  "main": "scripts.js",
+  "scripts": {
+    "start": "browser-sync start --directory --server --files \"*.css, *.html, *.js\" --https"
+  },
+  "author": "",
+  "license": "ISC",
+  "dependencies": {
+    "browser-sync": "^2.26.13"
+  }
+}
diff --git a/JavaScript Challenges/Javascript 30/Day22/index.html b/JavaScript Challenges/Javascript 30/Day22/index.html
new file mode 100644
index 0000000..b2e6ff8
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day22/index.html	
@@ -0,0 +1,112 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Day 22</title>
+    <style>
+        html{
+            box-sizing: border-box;
+        }
+        *, *::after, *::before{
+            box-sizing: inherit;
+        }
+        body{
+            min-height: 100vh;
+            margin: 0;
+            font-family: sans-serif;
+            background:
+                linear-gradient(45deg, hsla(340, 100%, 55%, 1) 0%, hsla(340, 100%, 55%, 0) 70%),
+                linear-gradient(135deg, hsla(225, 95%, 50%, 1) 10%, hsla(225, 95%, 50%, 0) 80%),
+                linear-gradient(225deg, hsla(140, 90%, 50%, 1) 10%, hsla(140, 90%, 50%, 0) 80%),
+                linear-gradient(315deg, hsla(35, 95%, 55%, 1) 100%, hsla(35, 95%, 55%, 0) 70%);
+        }
+        .menu {
+            padding: 0;
+            display: flex;
+            list-style: none;
+            justify-content: center;
+            margin:100px 0;
+        }
+        .menu a {
+            display: inline-block;
+            padding: 5px;
+            margin: 0 20px;
+            color: black;
+        }
+        .wrapper {
+            margin: 0 auto;
+            max-width: 500px;
+            font-size: 20px;
+            line-height: 2;
+            position: relative;
+        }
+        a {
+            text-decoration: none;
+            color: black;
+            background: rgba(0,0,0,0.05);
+            border-radius: 20px;
+        }
+
+        .highlight {
+            width: 52.68px;
+            height: 28px;
+            transition: all 0.5s;
+            border-bottom: 2px solid white;
+            position: absolute;
+            top: 100px;
+            background: white;
+            left: 376px;
+            z-index: -1;
+            border-radius: 20px;
+            display: block;
+            box-shadow: 0 0 10px rgba(0,0,0,0.2);
+        }
+
+    </style>
+</head>
+<body>
+    <nav>
+        <ul class="menu">
+            <li><a href="">Home</a></li>
+            <li><a href="">Order Status</a></li>
+            <li><a href="">Tweets</a></li>
+            <li><a href="">Read Our History</a></li>
+            <li><a href="">Contact Us</a></li>
+        </ul>
+    </nav>
+
+    <div class="wrapper">
+        <p>Lorem ipsum dolor sit amet, <a href="">consectetur</a> adipisicing elit. Est <a href="">explicabo</a> unde natus necessitatibus esse obcaecati distinctio, aut itaque, qui vitae!</p>
+        <p>Aspernatur sapiente quae sint <a href="">soluta</a> modi, atque praesentium laborum pariatur earum <a href="">quaerat</a> cupiditate consequuntur facilis ullam dignissimos, aperiam quam veniam.</p>
+        <p>Cum ipsam quod, incidunt sit ex <a href="">tempore</a> placeat maxime <a href="">corrupti</a> possimus <a href="">veritatis</a> ipsum fugit recusandae est doloremque? Hic, <a href="">quibusdam</a>, nulla.</p>
+        <p>Esse quibusdam, ad, ducimus cupiditate <a href="">nulla</a>, quae magni odit <a href="">totam</a> ut consequatur eveniet sunt quam provident sapiente dicta neque quod.</p>
+        <p>Aliquam <a href="">dicta</a> sequi culpa fugiat <a href="">consequuntur</a> pariatur optio ad minima, maxime <a href="">odio</a>, distinctio magni impedit tempore enim repellendus <a href="">repudiandae</a> quas!</p>
+    </div>
+
+    <script>
+        const trigger = document.querySelectorAll('a');
+
+        const highlight = document.createElement('span');
+        highlight.classList.add('highlight')
+        document.body.append(highlight);
+
+        function highlightLink()
+        {
+            const linkCoords = this.getBoundingClientRect();
+            const coords = {
+                width : linkCoords.width,
+                height : linkCoords.height,
+                left : linkCoords.left + window.scrollX,
+                top : linkCoords.top + window.scrollY
+            }
+            highlight.style.width = `${coords.width}px`;
+            highlight.style.height = `${coords.height}px`;
+            highlight.style.left = `${coords.left}px`;
+            highlight.style.top = `${coords.top}px`;
+        }
+        
+        trigger.forEach(link => link.addEventListener('mouseenter', highlightLink));
+    </script>
+</body>
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day23/index.html b/JavaScript Challenges/Javascript 30/Day23/index.html
new file mode 100644
index 0000000..24c22cf
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day23/index.html	
@@ -0,0 +1,243 @@
+<!DOCTYPE html>
+<html lang="en">
+
+<head>
+    <meta charset="UTF-8" />
+    <meta name="viewport" content="width=device-width, initial-scale=1.0" />
+    <title>Day 23 - Text to Speech</title>
+    <style>
+        html {
+            font-size: 10px;
+            box-sizing: border-box;
+        }
+
+        *,
+        *:before,
+        *:after {
+            box-sizing: inherit;
+        }
+
+        body {
+            margin: 0;
+            padding: 0;
+            font-family: sans-serif;
+            background-color: #3bc1ac;
+            display: flex;
+            min-height: 100vh;
+            align-items: center;
+
+            background-image: radial-gradient(circle at 100% 150%,
+                    #3bc1ac 24%,
+                    #42d2bb 25%,
+                    #42d2bb 28%,
+                    #3bc1ac 29%,
+                    #3bc1ac 36%,
+                    #42d2bb 36%,
+                    #42d2bb 40%,
+                    transparent 40%,
+                    transparent),
+                radial-gradient(circle at 0 150%,
+                    #3bc1ac 24%,
+                    #42d2bb 25%,
+                    #42d2bb 28%,
+                    #3bc1ac 29%,
+                    #3bc1ac 36%,
+                    #42d2bb 36%,
+                    #42d2bb 40%,
+                    transparent 40%,
+                    transparent),
+                radial-gradient(circle at 50% 100%,
+                    #42d2bb 10%,
+                    #3bc1ac 11%,
+                    #3bc1ac 23%,
+                    #42d2bb 24%,
+                    #42d2bb 30%,
+                    #3bc1ac 31%,
+                    #3bc1ac 43%,
+                    #42d2bb 44%,
+                    #42d2bb 50%,
+                    #3bc1ac 51%,
+                    #3bc1ac 63%,
+                    #42d2bb 64%,
+                    #42d2bb 71%,
+                    transparent 71%,
+                    transparent),
+                radial-gradient(circle at 100% 50%,
+                    #42d2bb 5%,
+                    #3bc1ac 6%,
+                    #3bc1ac 15%,
+                    #42d2bb 16%,
+                    #42d2bb 20%,
+                    #3bc1ac 21%,
+                    #3bc1ac 30%,
+                    #42d2bb 31%,
+                    #42d2bb 35%,
+                    #3bc1ac 36%,
+                    #3bc1ac 45%,
+                    #42d2bb 46%,
+                    #42d2bb 49%,
+                    transparent 50%,
+                    transparent),
+                radial-gradient(circle at 0 50%,
+                    #42d2bb 5%,
+                    #3bc1ac 6%,
+                    #3bc1ac 15%,
+                    #42d2bb 16%,
+                    #42d2bb 20%,
+                    #3bc1ac 21%,
+                    #3bc1ac 30%,
+                    #42d2bb 31%,
+                    #42d2bb 35%,
+                    #3bc1ac 36%,
+                    #3bc1ac 45%,
+                    #42d2bb 46%,
+                    #42d2bb 49%,
+                    transparent 50%,
+                    transparent);
+            background-size: 100px 50px;
+        }
+
+        .voiceinator {
+            display: flex;
+            flex-direction: column;
+            padding: 2rem;
+            width: 50rem;
+            margin: 0 auto;
+            border-radius: 1rem;
+            background-color: white;
+            overflow: hidden;
+            z-index: 1;
+            box-shadow: 0 0 5px 5px rgba(0, 0, 0, 0.1);
+        }
+
+        h1 {
+            width: calc(100% + 4rem);
+            margin: -2rem 0 2rem -2rem;
+            padding: 0.5rem;
+            background: #ffc600;
+            border-bottom: 5px solid #f3c010;
+            text-align: center;
+            font-size: 4rem;
+            font-weight: 100;
+            font-family: "Pacifico", cursive;
+            text-shadow: 3px 3px 0 #f3c010;
+        }
+
+        .voiceinator input,
+        .voiceinator button,
+        .voiceinator select,
+        .voiceinator textarea {
+            width: 100%;
+            display: block;
+            margin: 10px 0;
+            padding: 10px;
+            border: 0;
+            font-size: 2rem;
+            background: #F7F7F7;
+            outline: 0;
+        }
+
+        textarea{
+            height: 20rem;
+        }
+
+        .voiceinator button {
+            background: #ffc600;
+            border: 0;
+            width: 49%;
+            float: left;
+            font-family: 'Pacifico', cursive;
+            margin-bottom: 0;
+            font-size: 2rem;
+            border-bottom: 5px solid #F3C010;
+            cursor: pointer;
+            position: relative;
+        }
+        
+        .voiceinator button:active {
+            top: 2px;
+        }
+
+        .voiceinator button:nth-of-type(1) {
+            margin-right: 2%;
+        }
+    </style>
+</head>
+
+<body>
+    <div class="voiceinator">
+        <h1>The Voiceinator 5000</h1>
+
+        <select name="voice" id="voices">
+            <option value="">Select A Voice</option>
+        </select>
+
+        <label for="rate">Rate:</label>
+        <input name="rate" type="range" min="0" max="3" value="1" step="0.1" />
+
+        <label for="pitch">Pitch:</label>
+        <input name="pitch" type="range" min="0" max="2" step="0.1" />
+
+        <textarea name="text">Hello! I love JavaScript 👍</textarea>
+        
+        <div>
+            <button id="stop">Stop!</button>
+            <button id="speak">Speak</button>
+        </div>
+    </div>
+
+    <script>
+        var synth = window.speechSynthesis;
+        // we will call speechSynthesis on this utterance
+        let msg = new SpeechSynthesisUtterance();
+        
+        
+        let voices = [];
+        let voicesDropdown = document.querySelector('[name="voice"]');
+        let options = document.querySelectorAll('[type="range"], [name="text"]');
+        const speakButton = document.querySelector('#speak');
+        const stopButton = document.querySelector('#stop');
+
+        msg.text = document.querySelector('[name="text"]').value;
+
+        function populateVoices()
+        {
+            voices = this.getVoices();
+            const voiceOptions = voices
+                // .filter(voice => voice.lang.includes('en'))
+                .map(voice => `<option value="${voice.name}">${voice.name}(${voice.lang})</option>`)
+                .join('');
+            voicesDropdown.innerHTML = voiceOptions;
+        }
+
+        function setVoice(){
+            msg.voice = voices.find(voice => voice.name === this.value);
+            toggle();
+        }
+
+        function toggle(startOver = true)
+        {
+            // stop everything thats going on at present
+            speechSynthesis.cancel();
+            if(startOver)
+            {
+                speechSynthesis.speak(msg);
+            }
+        }
+
+        function setOption()
+        {
+            msg[this.name] = this.value;
+            toggle();
+        }
+
+        // when speechSynthesis gets loaded, this event is called
+        speechSynthesis.addEventListener('voiceschanged', populateVoices)
+        voicesDropdown.addEventListener('change', setVoice)
+        options.forEach(option => option.addEventListener('change', setOption))
+        speakButton.addEventListener('click', toggle);
+        stopButton.addEventListener('click',() => toggle(false))
+    </script>
+</body>
+
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day24/index.html b/JavaScript Challenges/Javascript 30/Day24/index.html
new file mode 100644
index 0000000..6efbdcb
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day24/index.html	
@@ -0,0 +1,306 @@
+<!DOCTYPE html>
+<html lang="en">
+
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Day 24</title>
+    <style>
+        html {
+            box-sizing: border-box;
+            background: #eeeeee;
+            font-family: 'helvetica neue';
+            font-size: 20px;
+            font-weight: 200;
+        }
+
+        body {
+            margin: 0;
+        }
+
+        *,
+        *:before,
+        *:after {
+            box-sizing: inherit;
+        }
+        
+        .site-wrap {
+            max-width: 700px;
+            margin: 70px auto;
+            background: white;
+            padding: 40px;
+            text-align: justify;
+            box-shadow: 0 0 10px 5px rgba(0, 0, 0, 0.05);
+            transform: scale(0.98);
+            transition: transform 0.5s;
+        }
+        
+        header {
+            text-align: center;
+            height: 50vh;
+            background: url(https://source.unsplash.com/GKN6rpDr0EI/600x300) bottom center no-repeat;
+            background-size: cover;
+            display: flex;
+            align-items: center;
+            justify-content: center;
+        }
+
+        h1 {
+            color: white;
+            font-size: 7vw;
+            text-shadow: 3px 4px 0 rgba(0,0,0,0.2);
+        }
+
+        .fixed-nav nav{
+            position: fixed;
+            box-shadow: 0 5px 5px rgba(0, 0, 0, 0.2);
+        }
+
+        .fixed-nav .logo{
+            /* why did we use max width both the time in logo. because we can't animate width. to show the animation we have to use max-width */
+            max-width: 500px;
+        }
+
+        .fixed-nav .site-wrap{
+            transform: scale(1);
+        }
+
+        nav {
+            background: black;
+            top: 0;
+            width: 100%;
+            transition: all 0.5s;
+            position: relative;
+            z-index: 1;
+        }
+
+        nav ul {
+            margin: 0;
+            padding:0;
+            list-style: none;
+            display: flex;
+        }
+
+        nav li {
+            flex: 1;
+            text-align: center;
+            display: flex;
+            justify-content: center;
+            align-items: center;
+        }
+
+        li.logo {
+            max-width: 0;
+            overflow: hidden;
+            background: white;
+            transition: all .5s;
+            font-weight: 600;
+            font-size: 30px;
+        }
+
+        li.logo a {
+            color: black;
+        }
+
+        nav a {
+            text-decoration: none;
+            padding: 20px;
+            display: inline-block;
+            color: white;
+            transition: all 0.2s;
+            text-transform: uppercase;
+        }
+    </style>
+</head>
+
+<body>
+    <header>
+        <h1>A story about getting lost.</h1>
+    </header>
+
+    <nav id="main">
+        <ul>
+            <li class="logo"><a href="#">LOST.</a></li>
+            <li><a href="#">Home</a></li>
+            <li><a href="#">About</a></li>
+            <li><a href="#">Images</a></li>
+            <li><a href="#">Locations</a></li>
+            <li><a href="#">Maps</a></li>
+        </ul>
+    </nav>
+
+    <div class="site-wrap">
+
+        <p>Lorem ipsum dolor sit amet, consectetur adipisicing elit. Tempore tempora rerum, est autem cupiditate,
+            corporis a qui libero ipsum delectus quidem dolor at nulla, adipisci veniam in reiciendis aut asperiores
+            omnis blanditiis quod quas laborum nam! Fuga ad tempora in aspernatur pariatur fugit quibusdam dolores sunt
+            esse magni, ut, dignissimos.</p>
+        <p>Lorem ipsum dolor sit amet, consectetur adipisicing elit. Tempore tempora rerum, est autem cupiditate,
+            corporis a qui libero ipsum delectus quidem dolor at nulla, adipisci veniam in reiciendis aut asperiores
+            omnis blanditiis quod quas laborum nam! Fuga ad tempora in aspernatur pariatur fugit quibusdam dolores sunt
+            esse magni, ut, dignissimos.</p>
+        <p>Lorem ipsum dolor sit amet, consectetur adipisicing elit. Tempore tempora rerum, est autem cupiditate,
+            corporis a qui libero ipsum delectus quidem dolor at nulla, adipisci veniam in reiciendis aut asperiores
+            omnis blanditiis quod quas laborum nam! Fuga ad tempora in aspernatur pariatur fugit quibusdam dolores sunt
+            esse magni, ut, dignissimos.</p>
+        <p>Lorem ipsum dolor sit amet, consectetur adipisicing elit. Tempore tempora rerum, est autem cupiditate,
+            corporis a qui libero ipsum delectus quidem dolor at nulla, adipisci veniam in reiciendis aut asperiores
+            omnis blanditiis quod quas laborum nam! Fuga ad tempora in aspernatur pariatur fugit quibusdam dolores sunt
+            esse magni, ut, dignissimos.</p>
+        <p>Lorem ipsum dolor sit amet, consectetur adipisicing elit. Tempore tempora rerum, est autem cupiditate,
+            corporis a qui libero ipsum delectus quidem dolor at nulla, adipisci veniam in reiciendis aut asperiores
+            omnis blanditiis quod quas laborum nam! Fuga ad tempora in aspernatur pariatur fugit quibusdam dolores sunt
+            esse magni, ut, dignissimos.</p>
+        <p>Lorem ipsum dolor sit amet, consectetur adipisicing elit. Tempore tempora rerum, est autem cupiditate,
+            corporis a qui libero ipsum delectus quidem dolor at nulla, adipisci veniam in reiciendis aut asperiores
+            omnis blanditiis quod quas laborum nam! Fuga ad tempora in aspernatur pariatur fugit quibusdam dolores sunt
+            esse magni, ut, dignissimos.</p>
+        <p>Lorem ipsum dolor sit amet, consectetur adipisicing elit. Tempore tempora rerum, est autem cupiditate,
+            corporis a qui libero ipsum delectus quidem dolor at nulla, adipisci veniam in reiciendis aut asperiores
+            omnis blanditiis quod quas laborum nam! Fuga ad tempora in aspernatur pariatur fugit quibusdam dolores sunt
+            esse magni, ut, dignissimos.</p>
+        <p>Lorem ipsum dolor sit amet, consectetur adipisicing elit. Tempore tempora rerum, est autem cupiditate,
+            corporis a qui libero ipsum delectus quidem dolor at nulla, adipisci veniam in reiciendis aut asperiores
+            omnis blanditiis quod quas laborum nam! Fuga ad tempora in aspernatur pariatur fugit quibusdam dolores sunt
+            esse magni, ut, dignissimos.</p>
+        <p>Lorem ipsum dolor sit amet, consectetur adipisicing elit. Tempore tempora rerum, est autem cupiditate,
+            corporis a qui libero ipsum delectus quidem dolor at nulla, adipisci veniam in reiciendis aut asperiores
+            omnis blanditiis quod quas laborum nam! Fuga ad tempora in aspernatur pariatur fugit quibusdam dolores sunt
+            esse magni, ut, dignissimos.</p>
+        <p>Lorem ipsum dolor sit amet, consectetur adipisicing elit. Tempore tempora rerum, est autem cupiditate,
+            corporis a qui libero ipsum delectus quidem dolor at nulla, adipisci veniam in reiciendis aut asperiores
+            omnis blanditiis quod quas laborum nam! Fuga ad tempora in aspernatur pariatur fugit quibusdam dolores sunt
+            esse magni, ut, dignissimos.</p>
+
+        <img src="http://unsplash.it/400/400" class="align-left slide-in">
+
+        <p>Lorem ipsum dolor sit amet, consectetur adipisicing elit. Voluptates, deserunt facilis et iste corrupti omnis
+            tenetur est. Iste ut est dicta dolor itaque adipisci, dolorum minima, veritatis earum provident error
+            molestias. Ratione magni illo sint vel velit ut excepturi consectetur suscipit, earum modi accusamus
+            voluptatem nostrum, praesentium numquam, reiciendis voluptas sit id quisquam. Consequatur in quis
+            reprehenderit modi perspiciatis necessitatibus saepe, quidem, suscipit iure natus dignissimos ipsam,
+            eligendi deleniti accusantium, rerum quibusdam fugit perferendis et optio recusandae sed ratione. Culpa,
+            dolorum reprehenderit harum ab voluptas fuga, nisi eligendi natus maiores illum quas quos et aperiam aut
+            doloremque optio maxime fugiat doloribus. Eum dolorum expedita quam, nesciunt</p>
+
+        <img src="http://unsplash.it/400/400" class="align-right slide-in">
+        <p> at provident praesentium atque quas rerum optio dignissimos repudiandae ullam illum quibusdam. Vel ad error
+            quibusdam, illo ex totam placeat. Quos excepturi fuga, molestiae ea quisquam minus, ratione dicta
+            consectetur officia omnis, doloribus voluptatibus? Veniam ipsum veritatis architecto, provident quas
+            consequatur doloremque quam quidem earum expedita, ad delectus voluptatum, omnis praesentium nostrum qui
+            aspernatur ea eaque adipisci et cumque ab? Ea voluptatum dolore itaque odio. Eius minima distinctio harum,
+            officia ab nihil exercitationem. Tempora rem nemo nam temporibus molestias facilis minus ipsam quam
+            doloribus consequatur debitis nesciunt tempore officiis aperiam quisquam, molestiae voluptates cum, fuga
+            culpa. Distinctio accusamus quibusdam, tempore perspiciatis dolorum optio facere consequatur quidem ullam
+            beatae architecto, ipsam sequi officiis dignissimos amet impedit natus necessitatibus tenetur repellendus
+            dolor rem! Dicta dolorem, iure, facilis illo ex nihil ipsa amet officia, optio temporibus eum autem odit
+            repellendus nisi. Possimus modi, corrupti error debitis doloribus dicta libero earum, sequi porro ut
+            excepturi nostrum ea voluptatem nihil culpa? Ullam expedita eligendi obcaecati reiciendis velit provident
+            omnis quas qui in corrupti est dolore facere ad hic, animi soluta assumenda consequuntur reprehenderit!
+            Voluptate dolor nihil veniam laborum voluptas nisi pariatur sed optio accusantium quam consectetur,
+            corrupti, sequi et consequuntur, excepturi doloremque. Tempore quis velit corporis neque fugit non sequi
+            eaque rem hic. Facere, inventore, aspernatur. Accusantium modi atque, asperiores qui nobis soluta cumque
+            suscipit excepturi possimus doloremque odit saepe perferendis temporibus molestiae nostrum voluptatum quis
+            id sint quidem nesciunt culpa. Rerum labore dolor beatae blanditiis praesentium explicabo velit optio esse
+            aperiam similique, voluptatem cum, maiores ipsa tempore. Reiciendis sed culpa atque inventore, nam ullam
+            enim expedita consectetur id velit iusto alias vitae explicabo nemo neque odio reprehenderit soluta sint
+            eaque. Aperiam, qui ut tenetur, voluptate doloremque officiis dicta quaerat voluptatem rerum natus magni.
+            Eum amet autem dolor ullam.</p>
+
+
+        <p>Lorem ipsum dolor sit amet, consectetur adipisicing elit. Distinctio maiores adipisci quibusdam repudiandae
+            dolor vero placeat esse sit! Quibusdam saepe aperiam explicabo placeat optio, consequuntur nihil
+            voluptatibus expedita quia vero perferendis, deserunt et incidunt eveniet temporibus doloremque possimus
+            facilis. Possimus labore, officia dolore! Eaque ratione saepe, alias harum laboriosam deserunt laudantium
+            blanditiis eum explicabo placeat reiciendis labore iste sint. Consectetur expedita dignissimos, non quos
+            distinctio, eos rerum facilis eligendi. Asperiores laudantium, rerum ratione consequatur, culpa consectetur
+            possimus atque ab tempore illum non dolor nesciunt. Neque, rerum. A vel non incidunt, quod doloremque
+            dignissimos necessitatibus aliquid laboriosam architecto at cupiditate commodi expedita in, quae blanditiis.
+            Deserunt labore sequi, repellat laboriosam est, doloremque culpa reiciendis tempore excepturi. Enim nostrum
+            fugit itaque vel corporis ullam sed tenetur ipsa qui rem quam error sint, libero. Laboriosam rem, ratione.
+            Autem blanditiis laborum neque repudiandae quam, cumque, voluptate veritatis itaque, placeat veniam ad nisi.
+            Expedita, laborum reprehenderit ratione soluta velit natus, odit mollitia. Corporis rerum minima fugiat in
+            nostrum. Assumenda natus cupiditate hic quidem ex, quas, amet ipsum esse dolore facilis beatae maxime qui
+            inventore, iste? Maiores dignissimos dolore culpa debitis voluptatem harum, excepturi enim reiciendis,
+            tempora ab ipsam illum aspernatur quasi qui porro saepe iure sunt eligendi tenetur quaerat ducimus quas
+            sequi omnis aperiam suscipit! Molestiae obcaecati officiis quo, ratione eveniet, provident pariatur. Veniam
+            quasi expedita distinctio, itaque molestiae sequi, dolorum nisi repellendus quia facilis iusto dignissimos
+            nam? Tenetur fugit quos autem nihil, perspiciatis expedita enim tempore, alias ab maiores quis
+            necessitatibus distinctio molestias eum, quidem. Delectus impedit quidem laborum, fugit vel neque quo,
+            ipsam, quasi aspernatur quas odio nihil? Veniam amet reiciendis blanditiis quis reprehenderit repudiandae
+            neque, ab ducimus, odit excepturi voluptate saepe ipsam. Voluptatem eum error voluptas porro officiis, amet!
+            Molestias, fugit, ut! Tempore non magnam, amet, facere ducimus accusantium eos veritatis neque.</p>
+
+        <img src="http://unsplash.it/400/400" class="align-right slide-in">
+
+        <p>Lorem ipsum dolor sit amet, consectetur adipisicing elit. Distinctio maiores adipisci quibusdam repudiandae
+            dolor vero placeat esse sit! Quibusdam saepe aperiam explicabo placeat optio, consequuntur nihil
+            voluptatibus expedita quia vero perferendis, deserunt et incidunt eveniet temporibus doloremque possimus
+            facilis. Possimus labore, officia dolore! Eaque ratione saepe, alias harum laboriosam deserunt laudantium
+            blanditiis eum explicabo placeat reiciendis labore iste sint. Consectetur expedita dignissimos, non quos
+            distinctio, eos rerum facilis eligendi. Asperiores laudantium, rerum ratione consequatur, culpa consectetur
+            possimus atque ab tempore illum non dolor nesciunt. Neque, rerum. A vel non incidunt, quod doloremque
+            dignissimos necessitatibus aliquid laboriosam architecto at cupiditate commodi expedita in, quae blanditiis.
+            Deserunt labore sequi, repellat laboriosam est, doloremque culpa reiciendis tempore excepturi. Enim nostrum
+            fugit itaque vel corporis ullam sed tenetur ipsa qui rem quam error sint, libero. Laboriosam rem, ratione.
+            Autem blanditiis laborum neque repudiandae quam, cumque, voluptate veritatis itaque, placeat veniam ad nisi.
+            Expedita, laborum reprehenderit ratione soluta velit natus, odit mollitia. Corporis rerum minima fugiat in
+            nostrum. Assumenda natus cupiditate hic quidem ex, quas, amet ipsum esse dolore facilis beatae maxime qui
+            inventore, iste? Maiores dignissimos dolore culpa debitis voluptatem harum, excepturi enim reiciendis,
+            tempora ab ipsam illum aspernatur quasi qui porro saepe iure sunt eligendi tenetur quaerat ducimus quas
+            sequi omnis aperiam suscipit! Molestiae obcaecati officiis quo, ratione eveniet, provident pariatur. Veniam
+            quasi expedita distinctio, itaque molestiae sequi, dolorum nisi repellendus quia facilis iusto dignissimos
+            nam? Tenetur fugit quos autem nihil, perspiciatis expedita enim tempore, alias ab maiores quis
+            necessitatibus distinctio molestias eum, quidem. Delectus impedit quidem laborum, fugit vel neque quo,
+            ipsam, quasi aspernatur quas odio nihil? Veniam amet reiciendis blanditiis quis reprehenderit repudiandae
+            neque, ab ducimus, odit excepturi voluptate saepe ipsam. Voluptatem eum error voluptas porro officiis, amet!
+            Molestias, fugit, ut! Tempore non magnam, amet, facere ducimus accusantium eos veritatis neque.</p>
+        <p>Lorem ipsum dolor sit amet, consectetur adipisicing elit. Distinctio maiores adipisci quibusdam repudiandae
+            dolor vero placeat esse sit! Quibusdam saepe aperiam explicabo placeat optio, consequuntur nihil
+            voluptatibus expedita quia vero perferendis, deserunt et incidunt eveniet temporibus doloremque possimus
+            facilis. Possimus labore, officia dolore! Eaque ratione saepe, alias harum laboriosam deserunt laudantium
+            blanditiis eum explicabo placeat reiciendis labore iste sint. Consectetur expedita dignissimos, non quos
+            distinctio, eos rerum facilis eligendi. Asperiores laudantium, rerum ratione consequatur, culpa consectetur
+            possimus atque ab tempore illum non dolor nesciunt. Neque, rerum. A vel non incidunt, quod doloremque
+            dignissimos necessitatibus aliquid laboriosam architecto at cupiditate commodi expedita in, quae blanditiis.
+            Deserunt labore sequi, repellat laboriosam est, doloremque culpa reiciendis tempore excepturi. Enim nostrum
+            fugit itaque vel corporis ullam sed tenetur ipsa qui rem quam error sint, libero. Laboriosam rem, ratione.
+            Autem blanditiis laborum neque repudiandae quam, cumque, voluptate veritatis itaque, placeat veniam ad nisi.
+            Expedita, laborum reprehenderit ratione soluta velit natus, odit mollitia. Corporis rerum minima fugiat in
+            nostrum. Assumenda natus cupiditate hic quidem ex, quas, amet ipsum esse dolore facilis beatae maxime qui
+            inventore, iste? Maiores dignissimos dolore culpa debitis voluptatem harum, excepturi enim reiciendis,
+            tempora ab ipsam illum aspernatur quasi qui porro saepe iure sunt eligendi tenetur quaerat ducimus quas
+            sequi omnis aperiam suscipit! Molestiae obcaecati officiis quo, ratione eveniet, provident pariatur. Veniam
+            quasi expedita distinctio, itaque molestiae sequi, dolorum nisi repellendus quia facilis iusto dignissimos
+            nam? Tenetur fugit quos autem nihil, perspiciatis expedita enim tempore, alias ab maiores quis
+            necessitatibus distinctio molestias eum, quidem. Delectus impedit quidem laborum, fugit vel neque quo,
+            ipsam, quasi aspernatur quas odio nihil? Veniam amet reiciendis blanditiis quis reprehenderit repudiandae
+            neque, ab ducimus, odit excepturi voluptate saepe ipsam. Voluptatem eum error voluptas porro officiis, amet!
+            Molestias, fugit, ut! Tempore non magnam, amet, facere ducimus accusantium eos veritatis neque.</p>
+    </div>
+
+    <script>
+        let nav = document.querySelector('#main');
+        let topOfNav = nav.offsetTop;
+
+        function fixNav()
+        {
+            if(window.scrollY >= topOfNav)
+            {
+                //add the height of of nav because when its positoin becomes fixed, the space occupied by nav before suddenly gets cleared and the content below it jumps up. so to avoid that, we add padding to the body
+                document.body.style.paddingTop = nav.offsetHeight + 'px';   
+                document.body.classList.add('fixed-nav');
+            }
+            else
+            {
+                document.body.style.paddingTop = 0;
+                document.body.classList.remove('fixed-nav');
+            }
+        }
+
+        window.addEventListener('scroll', fixNav)
+    </script>
+
+</body>
+
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day25/index.html b/JavaScript Challenges/Javascript 30/Day25/index.html
new file mode 100644
index 0000000..75c0e40
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day25/index.html	
@@ -0,0 +1,80 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Day 25</title>
+    <style>
+        html{
+            box-sizing: border-box;
+        }
+        *, *::before,*::after{
+            box-sizing: inherit;
+        }
+        body{
+            margin: 0;
+        }
+        div{
+            width: 100%;
+            padding: 100px;
+        }
+        .one{
+            background-color: thistle;
+        }
+        .two{
+            background-color: mistyrose;
+        }
+        .three{
+            background-color: coral;
+        }
+    </style>
+</head>
+<body>
+    <div class="one">
+        <div class="two">
+            <div class="three"></div>
+        </div>
+    </div>
+
+    <script>
+        const divs = document.querySelectorAll('div');
+
+
+        // 1.event capture
+        function logText(e)
+        {
+            console.log(this.classList.value);
+        }
+
+        divs.forEach(div => div.addEventListener('click', logText, {capture: true}))
+        // normally capture is false by default and so when we click on the div.three, then we get three two and one printed in console
+        // but when we provide capture true then when we click div.three then we get one two and three printed in conosle.
+        // means first time we follow depth first method, while in the second time we follow capture first method. whichever thing is captured first while traversing the dom, it is printed unlike depth first
+        // by default browsers folow depth first method, i.e they go down to the smallest element and log it and then come on to their parent and so.
+
+        // 2.propogation
+        function logText2(e)
+        {
+            console.log(this.classList.value);
+            e.stopPropagation();
+            // this will stop the click events fired on its parents. means only will be logged on console and one and two will get canceled when clicked on div.three
+        }
+
+        divs.forEach(div => div.addEventListener('click', logText2))
+        
+
+        // 3.remove Event listener
+        function logText3()
+        {
+            console.log(this.classList.value);
+        }
+
+        divs.forEach(div => div.addEventListener('click', logText3, {
+            once: true
+        }))
+
+        // instead of using removeEventListener, we can just specify once: true and so the event listener will work only once.
+        
+    </script>
+</body>
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day26/index.html b/JavaScript Challenges/Javascript 30/Day26/index.html
new file mode 100644
index 0000000..2144782
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day26/index.html	
@@ -0,0 +1,278 @@
+<!DOCTYPE html>
+<html lang="en">
+
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Day 26</title>
+    <style>
+        html {
+            box-sizing: border-box;
+            font-family: "Arial Rounded MT Bold", "Helvetica Rounded", Arial, sans-serif;
+        }
+
+        *,
+        *:before,
+        *:after {
+            box-sizing: inherit;
+        }
+
+        body {
+            margin: 0;
+            min-height: 100vh;
+            background:
+                linear-gradient(45deg, hsla(340, 100%, 55%, 1) 0%, hsla(340, 100%, 55%, 0) 70%),
+                linear-gradient(135deg, hsla(225, 95%, 50%, 1) 10%, hsla(225, 95%, 50%, 0) 80%),
+                linear-gradient(225deg, hsla(140, 90%, 50%, 1) 10%, hsla(140, 90%, 50%, 0) 80%),
+                linear-gradient(315deg, hsla(35, 95%, 55%, 1) 100%, hsla(35, 95%, 55%, 0) 70%);
+        }
+
+        h2 {
+            margin-top: 0;
+            padding-top: .8em;
+        }
+
+        nav {
+            position: relative;
+            perspective: 600px;
+        }
+
+        .cool>li>a {
+            color: yellow;
+            text-decoration: none;
+            font-size: 20px;
+            background: rgba(0, 0, 0, 0.2);
+            padding: 10px 20px;
+            display: inline-block;
+            margin: 20px;
+            border-radius: 5px;
+        }
+
+        nav ul {
+            list-style: none;
+            margin: 0;
+            padding: 0;
+            display: flex;
+            justify-content: center;
+        }
+
+        .cool>li {
+            position: relative;
+            display: flex;
+            justify-content: center;
+        }
+
+        .dropdown {
+            opacity: 0;
+            position: absolute;
+            overflow: hidden;
+            padding: 20px;
+            top: -20px;
+            border-radius: 2px;
+            transition: all 0.5s;
+            transform: translateY(100px);
+            will-change: opacity;
+            display: none;
+        }
+
+        .trigger-enter .dropdown {
+            display: block;
+        }
+
+        .trigger-enter-active .dropdown {
+            opacity: 1;
+        }
+
+        .dropdownBackground {
+            width: 100px;
+            height: 100px;
+            position: absolute;
+            background: #fff;
+            border-radius: 4px;
+            box-shadow: 0 50px 100px rgba(50, 50, 93, .1), 0 15px 35px rgba(50, 50, 93, .15), 0 5px 15px rgba(0, 0, 0, .1);
+            transition: height 1s, width 1s, opacity 0.1s;
+            transform-origin: 50% 0;
+            display: flex;
+            justify-content: center;
+            opacity: 0;
+        }
+
+        .dropdownBackground.open{
+            opacity: 1;
+        }
+
+        .arrow {
+            position: absolute;
+            width: 20px;
+            height: 20px;
+            display: block;
+            background: white;
+            transform: translateY(-50%) rotate(45deg);
+        }
+
+        .bio {
+            min-width: 500px;
+            display: flex;
+            justify-content: center;
+            align-items: center;
+            line-height: 1.7;
+        }
+
+        .bio img {
+            float: left;
+            margin-right: 20px;
+        }
+
+        .courses {
+            min-width: 300px;
+        }
+
+        .courses li {
+            padding: 10px 0;
+            display: block;
+            border-bottom: 1px solid rgba(0, 0, 0, 0.2);
+        }
+
+        .dropdown a {
+            text-decoration: none;
+            color: #ffc600;
+        }
+
+        a.button {
+            background: black;
+            display: block;
+            padding: 10px;
+            color: white;
+            margin-bottom: 10px;
+        }
+
+        .button[href*=twitter] {
+            background: #019FE9;
+        }
+
+        .button[href*=facebook] {
+            background: #3B5998;
+        }
+
+        .button[href*=instagram] {
+            background: #f568ca;
+        }
+
+    </style>
+</head>
+
+<body>
+    <h2>Cool</h2>
+
+    <nav class="top">
+        <div class="dropdownBackground">
+            <span class="arrow"></span>
+        </div>
+
+        <ul class="cool">
+
+            <li>
+                <a href="#">About Me</a>
+                <div class="dropdown dropdown1">
+                    <div class="bio">
+                        <img src="logo.jpg">
+                        <p>I surely do love web development. I am a big fan of Javascript and React. Maybe in near
+                            future I will fall in love with Android development too!!</p>
+                    </div>
+                </div>
+            </li>
+
+            <li>
+                <a href="#">Courses</a>
+                <ul class="dropdown courses">
+                    <li>
+                        <span class="code">RFB</span>
+                        <a href="https://ReactForBeginners.com">React For Beginners</a>
+                    </li>
+                    <li>
+                        <span class="code">ES6</span>
+                        <a href="https://ES6.io">ES6 For Everyone</a>
+                    </li>
+                    <li>
+                        <span class="code">NODE</span>
+                        <a href="https://LearnNode.com">Learn Node</a>
+                    </li>
+                    <li>
+                        <span class="code">STPU</span>
+                        <a href="https://SublimeTextBook.com">Sublime Text Power User</a>
+                    </li>
+                    <li>
+                        <span class="code">WTF</span>
+                        <a href="http://Flexbox.io">What The Flexbox?!</a>
+                    </li>
+                    <li>
+                        <span class="code">GRID</span>
+                        <a href="https://CSSGrid.io">CSS Grid</a>
+                    </li>
+                    <li>
+                        <span class="code">LRX</span>
+                        <a href="http://LearnRedux.com">Learn Redux</a>
+                    </li>
+                    <li>
+                        <span class="code">CLPU</span>
+                        <a href="http://CommandLinePowerUser.com">Command Line Power User</a>
+                    </li>
+                    <li>
+                        <span class="code">MMD</span>
+                        <a href="http://MasteringMarkdown.com">Mastering Markdown</a>
+                    </li>
+                </ul>
+            </li>
+
+            <li>
+                <a href="#">Other Links</a>
+                <ul class="dropdown dropdown3">
+                    <li><a class="button" href="https://twitter.com/DhirajNarsingh1">Twitter</a></li>
+                    <li><a class="button" href="http://http://facebook.com/narsinghanidhiraj444">Facebook</a></li>
+                    <li><a class="button" href="http://https://www.instagram.com/narsinghanidhiraj/">Instagram</a></li>
+                    <li><a class="button" href="http://https://github.com/Dhiraj3118">Github</a></li>
+                </ul>
+            </li>
+
+        </ul>
+    </nav>
+
+    <script>
+        const triggers = document.querySelectorAll('.cool>li');
+        const bg = document.querySelector('.dropdownBackground');
+        const nav = document.querySelector('.top');
+
+        function handleEnter()
+        {
+            this.classList.add('trigger-enter');
+            setTimeout(() => this.classList.contains('trigger-enter') && this.classList.add('trigger-enter-active'), 150);
+            bg.classList.add('open');
+            const dropdown = this.querySelector('.dropdown');
+            const dropdownCoords = dropdown.getBoundingClientRect();
+            const navCoords = nav.getBoundingClientRect();  // we have to take nav coords because, dropdown coords are relative to its parent which is nav. so if there are something before nav then position of the white backgrounds may change
+            
+            const coords = {
+                height: dropdownCoords.height ,
+                width: dropdownCoords.width ,
+                top: dropdownCoords.top - navCoords.top,
+                left: dropdownCoords.left - navCoords.left
+            }
+            bg.style.width = coords.width + 'px';
+            bg.style.height = coords.height + 'px';
+            bg.style.top = coords.top + 'px';
+            bg.style.left = coords.left + 'px';
+        }
+        function handleLeave()
+        {
+            this.classList.remove('trigger-enter', 'trigger-enter-leave');
+            bg.classList.remove('open');    
+            bg.style.height = 0;        
+            bg.style.width = 0;        
+        }
+
+        triggers.forEach( trigger => trigger.addEventListener('mouseenter', handleEnter));
+        triggers.forEach( trigger => trigger.addEventListener('mouseleave', handleLeave));
+    </script>
+</body>
+
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day26/logo.jpg b/JavaScript Challenges/Javascript 30/Day26/logo.jpg
new file mode 100644
index 0000000..b6868b9
Binary files /dev/null and b/JavaScript Challenges/Javascript 30/Day26/logo.jpg differ
diff --git a/JavaScript Challenges/Javascript 30/Day27/index.html b/JavaScript Challenges/Javascript 30/Day27/index.html
new file mode 100644
index 0000000..b0ae46f
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day27/index.html	
@@ -0,0 +1,74 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Day 27</title>
+    <link rel="stylesheet" href="style.css"> 
+</head>
+<body>
+
+    <div class="items">
+        <div class="item item1"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item2"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item3"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item4"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item5"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item6"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item7"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item8"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item9"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item10"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item11"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item12"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item13"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item14"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item15"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item16"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item17"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item18"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item19"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item20"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item21"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item22"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item23"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item24"><img src="https://source.unsplash.com/random" draggable="false"></div>
+        <div class="item item25"><img src="https://source.unsplash.com/random" draggable="false"></div>
+    </div>
+
+    <script>
+        const slider = document.querySelector('.items');
+        let isDown = false; // bool for mouse down or not
+        let startX;         // x value where mouse is clicked
+        let scrollLeft;     // previous scrolled value
+        let images = document.querySelectorAll('img');
+
+        images.forEach(img => img.addEventListener('dragstart', (e) => {e.preventDefault()}))
+
+        slider.addEventListener('mousedown', (e) => {
+            isDown = true;
+            slider.classList.add('active');
+            startX = e.pageX - slider.offsetLeft;
+            scrollLeft = slider.scrollLeft;
+        });
+        slider.addEventListener('mouseleave', () => {
+            isDown = false;
+            slider.classList.remove('active');
+        });
+        slider.addEventListener('mouseup', () => {
+            isDown = false;
+            slider.classList.remove('active');
+        });
+        slider.addEventListener('mousemove', (e) => {
+            if(!isDown) return; // means run the function only when we click
+            e.preventDefault();
+
+            const x = e.pageX - slider.offsetLeft;
+            const walk = (x - startX) * 2;    // -ve for left, +ve for right
+            // * 2 to scroll with double speed
+            slider.scrollLeft = scrollLeft - walk;
+
+        });
+    </script>
+</body>
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day27/style.css b/JavaScript Challenges/Javascript 30/Day27/style.css
new file mode 100644
index 0000000..a47cdc8
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day27/style.css	
@@ -0,0 +1,77 @@
+html {
+    box-sizing: border-box;
+    background: url('https://source.unsplash.com/NFs6dRTBgaM/2000x2000') fixed;
+    background-size: cover;
+}
+  
+*, *:before, *:after {
+    box-sizing: inherit;
+}
+
+body {
+    min-height: 100vh;
+    display: flex;
+    justify-content: center;
+    align-items: center;
+    font-family: sans-serif;
+    font-size: 20px;
+    margin: 0;
+}
+
+.items {
+    height: 600px;
+    padding: 100px;
+    width: 100%;
+    border: 1px solid white;
+    overflow-x: scroll;
+    overflow-y: hidden;
+    white-space: nowrap;
+    user-select: none;
+    cursor: pointer;
+    transition: all 0.2s;
+    transform: scale(0.98);
+    will-change: transform;
+    position: relative;
+    background: rgba(255,255,255,0.1);
+    font-size: 0;
+    perspective: 500px;
+}
+  
+.items.active {
+    background: rgba(255,255,255,0.3);
+    cursor: grabbing;
+    cursor: -webkit-grabbing;
+    transform: scale(1);
+}
+
+.item {
+    width: 200px;
+    height: calc(100% - 40px);
+    display: inline-flex;
+    align-items: center;
+    justify-content: center;
+    font-size: 80px;
+    font-weight: 100;
+    color: rgba(0,0,0,0.15);
+    box-shadow: inset 0 0 0 10px rgba(0,0,0,0.15);
+    /* overflow: hidden; */
+}
+
+.item img{
+    width: 200px;
+    height: calc(100% - 40px);
+}
+
+.item:nth-child(9n+1) { background: dodgerblue;}
+.item:nth-child(9n+2) { background: goldenrod;}
+.item:nth-child(9n+3) { background: paleturquoise;}
+.item:nth-child(9n+4) { background: gold;}
+.item:nth-child(9n+5) { background: cadetblue;}
+.item:nth-child(9n+6) { background: tomato;}
+.item:nth-child(9n+7) { background: lightcoral;}
+.item:nth-child(9n+8) { background: darkslateblue;}
+.item:nth-child(9n+9) { background: rebeccapurple;}
+
+.item:nth-child(even) { transform: scaleX(1.31) rotateY(40deg); }
+.item:nth-child(odd) { transform: scaleX(1.31) rotateY(-40deg); }
+  
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day28/index.html b/JavaScript Challenges/Javascript 30/Day28/index.html
new file mode 100644
index 0000000..cd0dc65
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day28/index.html	
@@ -0,0 +1,89 @@
+<!DOCTYPE html>
+<html lang="en">
+
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Day 28</title>
+    <style>
+        body {
+            margin: 0;
+            display: flex;
+            justify-content: center;
+            align-items: center;
+            min-height: 100vh;
+            background: #4C4C4C url('https://unsplash.it/1500/900?image=1021');
+            background-size: cover;
+            font-family: sans-serif;
+        }
+
+        .wrapper {
+            width: 850px;
+            display: flex;
+        }
+
+        video {
+            box-shadow: 0 0 1px 3px rgba(0, 0, 0, 0.1);
+        }
+
+        .speed {
+            background: #efefef;
+            flex: 1;
+            display: flex;
+            align-items: flex-start;
+            margin: 10px;
+            border-radius: 50px;
+            box-shadow: 0 0 1px 3px rgba(0, 0, 0, 0.1);
+            overflow: hidden;
+        }
+
+        .speed-bar {
+            width: 100%;
+            background: linear-gradient(-170deg, #2376ae 0%, #c16ecf 100%);
+            text-shadow: 1px 1px 0 rgba(0, 0, 0, 0.2);
+            display: flex;
+            align-items: center;
+            justify-content: center;
+            padding: 2px;
+            color: white;
+            height: 16.3%;
+        }
+    </style>
+</head>
+
+<body>
+    <div class="wrapper">
+        <video class="flex" width="765" height="430" src="http://clips.vorwaerts-gmbh.de/VfE_html5.mp4" loop controls></video>
+        <div class="speed">
+            <div class="speed-bar">1x</div>
+        </div>
+    </div>
+
+    <script>
+        const speed = document.querySelector('.speed');
+        const bar = document.querySelector('.speed-bar');
+        const video = document.querySelector('.flex');
+        let clicked = false;
+
+        speed.addEventListener('mousemove', function(e){
+            if(clicked)
+            {
+                const y = e.layerY;
+                const percent = y / this.offsetHeight;
+                const min = 0.4;
+                const max = 4;
+                const height = Math.round(percent*100) + '%';
+                const playbackRate = percent * (max-min) + min ;
+
+                bar.textContent = playbackRate.toFixed(2) + 'x'; //tofixed for 2 decimals 
+                bar.style.height = height;
+                video.playbackRate = playbackRate;
+            }
+        })
+
+        speed.addEventListener('mousedown', () => clicked = true);
+        speed.addEventListener('mouseup', () => clicked = false);
+    </script>
+</body>
+
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day29/index.html b/JavaScript Challenges/Javascript 30/Day29/index.html
new file mode 100644
index 0000000..75be71c
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day29/index.html	
@@ -0,0 +1,31 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Day 29</title>
+    <link href='https://fonts.googleapis.com/css?family=Inconsolata' rel='stylesheet' type='text/css'>
+    <link rel="stylesheet" href="style.css">
+</head>
+<body>
+    <div class="timer">
+        <div class="timer__controls">
+          <button data-time="20" class="timer__button">20 Secs</button>
+          <button data-time="300" class="timer__button">Work 5</button>
+          <button data-time="900" class="timer__button">Quick 15</button>
+          <button data-time="1200" class="timer__button">Snack 20</button>
+          <button data-time="3600" class="timer__button">Lunch Break</button>
+          <form name="customForm" id="custom">
+            <input type="text" name="minutes" placeholder="Enter Minutes">
+          </form>
+        </div>
+        <div class="display">
+          <h1 class="display__time-left"></h1>
+          <p class="display__end-time"></p>
+        </div>
+    </div>
+    <button id="start-stop">Play/Pause</button>
+    
+    <script src="script.js"></script>
+</body>
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day29/script.js b/JavaScript Challenges/Javascript 30/Day29/script.js
new file mode 100644
index 0000000..001cf1b
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day29/script.js	
@@ -0,0 +1,80 @@
+let countdown;
+const timerDisplay = document.querySelector('.display__time-left');
+const endTime = document.querySelector('.display__end-time');
+const buttons = document.querySelectorAll('[data-time]');
+const playPause = document.querySelector('#start-stop');
+let secondsLeft;
+let timerStart = false;
+
+function timer(seconds)
+{
+    clearInterval(countdown);//clear all previous timers
+    timerStart = true;
+    const now = Date.now() ;    // milliseconds
+    const then = (seconds * 1000) + now ;
+
+    displayTimeLeft(seconds);
+    displayEndTime(then);
+
+    countdown = setInterval(()=>{
+        secondsLeft = Math.round((then - Date.now()) / 1000);
+        
+        if(secondsLeft < 0)
+        {
+            timerStart = false;
+            clearInterval(countdown);
+            return;
+        }
+        
+        displayTimeLeft(secondsLeft);
+
+    },1000)
+
+}
+
+function displayTimeLeft(seconds)
+{
+    const hours = Math.floor(seconds / 3600) ;
+    seconds = seconds % 3600;
+    const minutes = Math.floor(seconds / 60) ;
+    const remainerSeconds = seconds % 60;
+
+    const displayTime = `${hours<10&&hours>0?'0':''}${hours>0?hours+':':''}${minutes<10 ? '0' : ''}${minutes}:${remainerSeconds<10 ? '0' : ''}${remainerSeconds}`;
+    document.title = displayTime;
+    timerDisplay.textContent = displayTime;
+}
+
+function displayEndTime(timestamp)
+{
+    const end = new Date(timestamp);
+    const hours = end.getHours();
+    const minutes = end.getMinutes();
+    endTime.textContent = `Be back at ${hours > 12 ? hours-12 : hours}:${minutes<10 ? '0': ''}${minutes}`;
+}
+
+function startTimer()
+{
+    const seconds = parseInt(this.dataset.time);
+    timer(seconds);
+}
+
+buttons.forEach(button => button.addEventListener('click', startTimer) )
+document.customForm.addEventListener('submit', function(e){
+    e.preventDefault();
+    const mins = this.minutes.value;
+    timer(mins*60);
+    this.reset();
+})
+
+
+playPause.addEventListener('click', (e)=> {
+    if(timerStart)
+    {
+        clearInterval(countdown);
+        timerStart = false;
+    }
+    else
+    {
+        timer(secondsLeft)
+    }
+})
diff --git a/JavaScript Challenges/Javascript 30/Day29/style.css b/JavaScript Challenges/Javascript 30/Day29/style.css
new file mode 100644
index 0000000..45fc66c
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day29/style.css	
@@ -0,0 +1,84 @@
+html {
+    box-sizing: border-box;
+    font-size: 10px;
+    background: #8E24AA;
+    background: linear-gradient(45deg,  #42a5f5 0%,#478ed1 50%,#0d47a1 100%);
+}
+  
+*, *:before, *:after {
+    box-sizing: inherit;
+}
+  
+body {
+    margin: 0;
+    text-align: center;
+    font-family: 'Inconsolata', monospace;
+}
+
+.display__time-left {
+    font-weight: 100;
+    font-size: 20rem;
+    margin: 0;
+    color: white;
+    text-shadow: 4px 4px 0 rgba(0,0,0,0.05);
+}
+
+.timer {
+    display: flex;
+    min-height: 100vh;
+    flex-direction: column;
+}
+
+.timer__controls {
+    display: flex;
+}
+  
+.timer__controls > * {
+    flex: 1;
+}
+  
+.timer__controls form {
+    flex: 1;
+    display: flex;
+}
+
+.timer__controls input {
+    flex: 1;
+    border: 0;
+    padding: 2rem;
+}
+
+.timer__button {
+    background: none;
+    border: 0;
+    cursor: pointer;
+    color: white;
+    font-size: 2rem;
+    text-transform: uppercase;
+    background: rgba(0,0,0,0.1);
+    border-bottom: 3px solid rgba(0,0,0,0.2);
+    border-right: 1px solid rgba(0,0,0,0.2);
+    padding: 1rem;
+    font-family: 'Inconsolata', monospace;
+}
+
+.timer__button:hover,
+.timer__button:focus {
+  background: rgba(0,0,0,0.2);
+  outline: 0;
+}
+
+
+.display {
+    flex: 1;
+    display: flex;
+    flex-direction: column;
+    align-items: center;
+    justify-content: center;
+}
+
+
+.display__end-time {
+    font-size: 4rem;
+    color: white;
+}
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day30/dirt.svg b/JavaScript Challenges/Javascript 30/Day30/dirt.svg
new file mode 100644
index 0000000..8726a9e
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day30/dirt.svg	
@@ -0,0 +1,40 @@
+<?xml version="1.0" encoding="UTF-8" standalone="no"?>
+<svg width="376px" height="148px" viewBox="0 0 376 148" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:sketch="http://www.bohemiancoding.com/sketch/ns">
+    <!-- Generator: Sketch 3.5.2 (25235) - http://www.bohemiancoding.com/sketch -->
+    <title>dirt</title>
+    <desc>Created with Sketch.</desc>
+    <defs>
+        <linearGradient x1="-0.000697819315%" y1="-96.2978064%" x2="99.9993103%" y2="-96.2978064%" id="linearGradient-1">
+            <stop stop-color="#593D09" offset="0%"></stop>
+            <stop stop-color="#7F5200" offset="100%"></stop>
+        </linearGradient>
+        <linearGradient x1="-1.4005154e-14%" y1="-96.3645412%" x2="100%" y2="-96.3645412%" id="linearGradient-2">
+            <stop stop-color="#563B09" offset="0%"></stop>
+            <stop stop-color="#291D04" offset="100%"></stop>
+        </linearGradient>
+    </defs>
+    <g id="Page-1" stroke="none" stroke-width="1" fill="none" fill-rule="evenodd" sketch:type="MSPage">
+        <g id="dirt" sketch:type="MSLayerGroup" transform="translate(-0.003290, 0.157900)">
+            <path d="M273.22204,0.12979 C269.17521,0.12979 265.47478,1.40216 262.59704,3.53604 C260.26368,2.42498 257.58808,1.78604 254.75329,1.78604 C245.60046,1.78604 238.19079,8.36749 238.19079,16.47354 C238.19079,18.06197 238.47626,19.60338 239.00329,21.03604 C236.42118,23.62415 234.84704,26.99833 234.84704,30.72354 C234.84704,31.98341 235.04117,33.21298 235.37829,34.37979 C233.89426,34.80651 232.52069,35.40272 231.25329,36.16104 C228.78169,37.29173 226.64871,38.91508 225.09704,40.94229 C225.09404,40.94329 225.10004,40.97229 225.09704,40.97349 C223.55186,41.55256 222.09643,42.1943 220.72204,42.91099 C218.10363,36.84942 213.10613,32.45176 207.15954,31.41099 C204.08002,28.63211 200.25302,26.97349 196.06579,26.97349 C192.10795,26.97349 188.43094,28.43373 185.44079,30.94224 C182.6692,28.95256 179.4292,27.78599 175.94079,27.78599 C166.43761,27.78599 158.64584,36.31926 157.78454,47.19224 C156.09677,46.58848 154.29715,46.25474 152.44079,46.25474 C146.83626,46.25474 141.8198,49.22035 138.47204,53.87974 C137.54794,53.83394 136.6027,53.78604 135.65954,53.78604 C132.71907,53.78604 129.88544,54.01569 127.15954,54.44229 C124.00602,48.04064 118.10794,43.72354 111.34704,43.72354 C103.67616,43.72354 97.10914,49.27268 94.40954,57.12979 C91.53972,49.72729 85.20599,44.56729 77.81579,44.56729 C72.24102,44.56729 67.2571,47.51311 63.90954,52.12979 C61.7329,51.05546 59.35711,50.44229 56.84704,50.44229 C49.30923,50.44229 42.8183,55.80124 40.03454,63.44229 C37.33194,61.58838 34.20472,60.50479 30.84704,60.50479 C24.07391,60.50479 18.15254,64.83398 15.00329,71.25479 C13.69049,70.58094 12.21575,70.19229 10.69079,70.19229 C4.78227,70.19229 0.00329,75.79945 0.00329,82.72354 C0.00329,89.64763 4.78227,95.25479 10.69079,95.25479 C12.48413,95.25479 14.20622,94.76244 15.69079,93.84854 C15.75429,93.95873 15.84432,94.05232 15.90954,94.16104 C17.30969,98.18434 20.44324,101.15366 24.22204,101.81729 C26.27335,102.75278 28.5134,103.28604 30.84704,103.28604 C34.12752,103.28604 37.18678,102.24914 39.84704,100.47354 C41.13536,105.70231 45.25155,109.53604 50.12829,109.53604 C50.91096,109.53604 51.67499,109.44154 52.40954,109.25479 C54.72429,110.37383 57.29539,111.00479 60.00329,111.00479 C62.29555,111.00479 64.47958,110.53943 66.50329,109.72354 C68.38986,111.68849 70.87166,112.87979 73.59704,112.87979 C76.99275,112.87979 80.01222,111.02111 81.97204,108.12979 C86.37463,116.05092 98.08096,121.86783 112.12829,122.50479 C113.97346,126.27291 117.43641,128.81729 121.40954,128.81729 C124.97185,128.81729 128.12134,126.76768 130.06579,123.62979 C131.07757,124.7074 132.2129,125.74453 133.50329,126.69229 C134.33241,132.64927 138.74812,137.19229 144.06579,137.19229 C146.96106,137.19229 149.57721,135.85043 151.50329,133.66104 L151.78454,133.69224 C153.39561,138.22594 157.20724,141.41099 161.65954,141.41099 C162.9381,141.41099 164.17919,141.14308 165.31579,140.66099 C171.64937,145.0025 180.83141,147.72349 191.03454,147.72349 C204.56126,147.72349 216.24961,142.93352 221.94079,135.94224 C222.7167,135.90924 223.49229,135.85004 224.25329,135.78599 C226.39302,136.7038 228.76276,137.25474 231.28454,137.25474 C238.19783,137.25474 244.11164,133.39079 246.59704,127.91099 C247.01192,127.5897 247.39962,127.27824 247.78454,126.94224 C248.69116,127.08218 249.61544,127.19224 250.56579,127.19224 C252.00123,127.19224 253.39378,127.00474 254.72204,126.69224 C256.56721,130.46036 260.03016,133.00474 264.00329,133.00474 C268.32007,133.00474 272.03122,130.00682 273.72204,125.69224 C274.64775,125.8343 275.59422,125.91099 276.56579,125.91099 C279.72756,125.91099 282.67704,125.11543 285.19079,123.75474 C287.10382,125.8556 289.67468,127.12974 292.50329,127.12974 C297.04373,127.12974 300.91878,123.80682 302.47204,119.12974 C302.91852,119.17634 303.36001,119.22344 303.81579,119.22344 C304.939,119.22344 306.03653,119.06078 307.09704,118.78594 C308.87914,120.34158 311.07904,121.25469 313.47204,121.25469 C317.8823,121.25469 321.67881,118.12649 323.31579,113.66094 C325.82672,115.05604 328.78449,115.84844 331.94079,115.84844 C338.38171,115.84844 343.94799,112.51862 346.69079,107.62969 C348.60731,108.33508 350.71554,108.72344 352.90954,108.72344 C362.06237,108.72344 369.47204,101.96734 369.47204,93.62969 C369.47204,92.64206 369.35831,91.68941 369.15954,90.75469 C370.43518,88.6156 371.15954,86.17271 371.15954,83.56719 C371.15954,78.7006 368.61567,74.39046 364.69079,71.62969 C365.07188,70.35915 365.28454,69.01033 365.28454,67.62969 C365.28454,59.29204 357.84362,52.53594 348.69079,52.53594 C347.88115,52.53594 347.09437,52.62124 346.31579,52.72344 C346.63542,51.58534 346.81579,50.41789 346.81579,49.19219 C346.81579,41.08614 339.40612,34.50469 330.25329,34.50469 C329.98868,34.50469 329.73362,34.52509 329.47204,34.53589 C327.62377,30.78163 324.15508,28.25464 320.19079,28.25464 C318.64192,28.25464 317.17603,28.65444 315.84704,29.34839 C311.74446,22.31857 301.84768,17.00894 289.72204,15.59839 C289.73884,15.32744 289.78454,15.06056 289.78454,14.78589 C289.78454,6.67984 282.37487,0.12964 273.22204,0.12964 L273.22204,0.12979 Z M314.94079,54.81729 C315.55878,56.13513 316.40756,57.35135 317.40954,58.44229 C316.48971,58.32049 315.5424,58.23666 314.59704,58.16104 C314.84173,57.15766 314.94079,56.1355 314.94079,55.06729 C314.94079,54.98299 314.94279,54.90124 314.94079,54.81729 L314.94079,54.81729 Z M278.37829,57.78604 C279.60611,57.89362 280.86253,57.9478 282.12829,57.97354 C282.28858,58.67482 282.54698,59.34366 282.81579,60.00479 C281.38633,59.31247 279.8507,58.70948 278.25329,58.16104 C278.29269,58.03623 278.34249,57.91217 278.37829,57.78604 L278.37829,57.78604 Z" id="Shape" fill="url(#linearGradient-1)" sketch:type="MSShapeGroup"></path>
+            <path d="M273.64503,0.22809 C269.5982,0.22809 265.89777,1.50046 263.02003,3.63434 C260.68667,2.52328 258.01107,1.88434 255.17628,1.88434 C253.78009,1.88434 252.43998,2.06475 251.14503,2.35309 C254.0698,4.58063 256.82915,6.90943 259.36378,9.29059 C270.6632,10.53646 279.42628,19.54934 279.42628,30.50934 C279.42628,32.89847 279.0074,35.20768 278.23878,37.35309 C279.88367,42.36345 280.77003,47.51812 280.77003,52.79059 C280.77003,52.81059 280.77006,52.83209 280.77003,52.85309 C285.22073,56.75699 287.98878,62.30329 287.98878,68.47809 C287.98878,80.18299 277.98675,89.71329 265.58253,89.88439 C265.20478,90.32019 264.81687,90.76499 264.42628,91.19679 C265.39411,93.34099 265.92628,95.65299 265.92628,98.04059 C265.92628,109.85229 253.10638,119.41559 237.27003,119.41559 C235.86104,119.41559 234.46836,119.34329 233.11378,119.19679 C230.68336,129.53889 216.27148,137.47809 198.86378,137.47809 C192.78733,137.47809 187.07698,136.52189 182.11378,134.82179 C178.80444,138.62739 174.07047,141.40809 168.64503,142.54059 C174.7396,145.84619 182.71134,147.82179 191.45753,147.82179 C204.98425,147.82179 216.6726,143.03179 222.36378,136.04059 C223.13969,136.00759 223.91528,135.94869 224.67628,135.88439 C226.81601,136.80209 229.18575,137.35309 231.70753,137.35309 C238.62082,137.35309 244.53463,133.48919 247.02003,128.00939 C247.43491,127.68799 247.82261,127.37659 248.20753,127.04059 C249.11415,127.18049 250.03843,127.29059 250.98878,127.29059 C252.42422,127.29059 253.81677,127.10309 255.14503,126.79059 C256.9902,130.55869 260.45315,133.10309 264.42628,133.10309 C268.74306,133.10309 272.45421,130.10509 274.14503,125.79059 C275.07074,125.93259 276.01721,126.00939 276.98878,126.00939 C280.15055,126.00939 283.10003,125.21379 285.61378,123.85309 C287.52681,125.95389 290.09767,127.22809 292.92628,127.22809 C297.46672,127.22809 301.34177,123.90509 302.89503,119.22809 C303.34151,119.27509 303.783,119.32179 304.23878,119.32179 C305.36199,119.32179 306.45952,119.15919 307.52003,118.88439 C309.30213,120.43989 311.50203,121.35309 313.89503,121.35309 C318.30529,121.35309 322.1018,118.22479 323.73878,113.75939 C326.24971,115.15439 329.20748,115.94679 332.36378,115.94679 C338.8047,115.94679 344.37098,112.61699 347.11378,107.72809 C349.0303,108.43349 351.13853,108.82179 353.33253,108.82179 C362.48536,108.82179 369.89503,102.06579 369.89503,93.72809 C369.89503,92.74049 369.7813,91.78779 369.58253,90.85309 C370.85817,88.71399 371.58253,86.27109 371.58253,83.66559 C371.58253,78.79899 369.03866,74.48889 365.11378,71.72809 C365.49487,70.45759 365.70753,69.10879 365.70753,67.72809 C365.70753,59.39049 358.26661,52.63429 349.11378,52.63439 C348.30414,52.63439 347.51736,52.71939 346.73878,52.82179 C347.05841,51.68369 347.23878,50.51629 347.23878,49.29059 C347.23878,41.18455 339.82911,34.60309 330.67628,34.60309 C330.41167,34.60309 330.15661,34.62359 329.89503,34.63429 C328.04676,30.88003 324.57807,28.35304 320.61378,28.35304 C319.06491,28.35304 317.59902,28.75284 316.27003,29.44679 C312.16745,22.41697 302.27067,17.10734 290.14503,15.69679 C290.16183,15.42584 290.20753,15.15896 290.20753,14.88429 C290.20753,6.77824 282.79786,0.22804 273.64503,0.22804 L273.64503,0.22809 Z M315.36378,54.91559 C315.98177,56.23349 316.83055,57.44969 317.83253,58.54059 C316.9127,58.41879 315.96539,58.33489 315.02003,58.25939 C315.26472,57.25589 315.36378,56.23379 315.36378,55.16559 C315.36378,55.08159 315.36578,54.99959 315.36378,54.91559 L315.36378,54.91559 Z" id="Shape" fill="url(#linearGradient-2)" sketch:type="MSShapeGroup"></path>
+            <path d="M161.4201,114.54007 C162.87124,114.54007 164.22553,114.96155 165.37434,115.67303 L165.47434,115.67303 C169.49878,115.67303 172.7926,118.82961 172.99406,122.80399 C173.00106,122.93219 172.99406,123.06293 172.99406,123.19275 C172.99406,124.2817 172.75438,125.31326 172.33872,126.24729 C173.14032,127.44321 173.60497,128.87467 173.60497,130.42367 C173.60497,130.55349 173.61197,130.68423 173.60497,130.81243 C173.40351,134.78681 170.10969,137.94339 166.08525,137.94339 C165.68762,137.94339 165.30007,137.91359 164.91897,137.85449 C163.73875,138.62472 162.32424,139.07631 160.80923,139.07631 C159.34187,139.07631 157.96812,138.65873 156.81056,137.93225 C156.66333,137.94125 156.51576,137.94335 156.36626,137.94335 C152.212,137.94335 148.83543,134.57789 148.83543,130.42363 C148.83543,129.32939 149.08012,128.29387 149.50188,127.35798 C148.69815,126.16497 148.22453,124.74041 148.22453,123.1927 C148.22453,119.03844 151.6011,115.67298 155.75535,115.67298 C156.26247,115.67298 156.75465,115.72238 157.23264,115.81738 C158.43118,115.01102 159.86711,114.54002 161.42013,114.54002 L161.4201,114.54007 Z" id="Shape" stroke="#000000" stroke-width="1.06631" fill="#734B02" sketch:type="MSShapeGroup"></path>
+            <path d="M163.31979,116.94121 C164.77092,116.94121 166.12521,117.36269 167.27403,118.07417 L167.37403,118.07417 C171.39847,118.07417 174.69229,121.23075 174.89375,125.20513 C174.90075,125.33333 174.89375,125.46407 174.89375,125.59389 C174.89375,126.68284 174.65407,127.7144 174.23841,128.64842 C175.04001,129.84435 175.50466,131.27581 175.50466,132.82481 C175.50466,132.95463 175.51166,133.08537 175.50466,133.21357 C175.3032,137.18795 172.00938,140.34453 167.98494,140.34453 C167.58731,140.34453 167.19976,140.31463 166.81866,140.25563 C165.63844,141.02586 164.22393,141.47745 162.70892,141.47745 C161.24156,141.47745 159.86781,141.05987 158.71025,140.33338 C158.56302,140.34238 158.41545,140.34448 158.26595,140.34448 C154.11169,140.34448 150.73513,136.97903 150.73513,132.82476 C150.73513,131.73053 150.97981,130.69501 151.40157,129.75912 C150.59784,128.56611 150.12422,127.14155 150.12422,125.59384 C150.12422,121.43958 153.50079,118.07412 157.65504,118.07412 C158.16216,118.07412 158.65434,118.12352 159.13233,118.21851 C160.33087,117.41216 161.7668,116.94116 163.31983,116.94116 L163.31979,116.94121 Z" id="Shape" fill="#3B2906" sketch:type="MSShapeGroup"></path>
+            <path d="M244.52054,113.99717 C245.97168,113.99717 247.32597,114.41865 248.47478,115.13013 L248.57478,115.13013 C252.59922,115.13013 255.89304,118.28671 256.0945,122.26109 C256.1015,122.38929 256.0945,122.52003 256.0945,122.64985 C256.0945,123.7388 255.85482,124.77036 255.43916,125.70439 C256.24076,126.90031 256.70541,128.33177 256.70541,129.88077 C256.70541,130.01059 256.71241,130.14133 256.70541,130.26953 C256.50395,134.24391 253.21013,137.40049 249.18569,137.40049 C248.78806,137.40049 248.40051,137.37069 248.01941,137.31159 C246.83919,138.08182 245.42468,138.53341 243.90967,138.53341 C242.44231,138.53341 241.06856,138.11583 239.911,137.38935 C239.76377,137.39835 239.6162,137.40045 239.4667,137.40045 C235.31244,137.40045 231.93587,134.03499 231.93587,129.88073 C231.93587,128.78649 232.18056,127.75097 232.60232,126.81508 C231.79859,125.62207 231.32497,124.19751 231.32497,122.6498 C231.32497,118.49554 234.70154,115.13008 238.85579,115.13008 C239.36291,115.13008 239.85509,115.17948 240.33308,115.27448 C241.53162,114.46812 242.96755,113.99712 244.52057,113.99712 L244.52054,113.99717 Z" id="Shape" stroke="#000000" stroke-width="1.06631" fill="#734B02" sketch:type="MSShapeGroup"></path>
+            <path d="M246.42023,116.39831 C247.87136,116.39831 249.22565,116.81979 250.37447,117.53127 L250.47447,117.53127 C254.49891,117.53127 257.79273,120.68785 257.99419,124.66223 C258.00119,124.79043 257.99419,124.92117 257.99419,125.05099 C257.99419,126.13994 257.75451,127.1715 257.33885,128.10552 C258.14045,129.30145 258.6051,130.73291 258.6051,132.28191 C258.6051,132.41173 258.6121,132.54247 258.6051,132.67067 C258.40364,136.64505 255.10982,139.80163 251.08538,139.80163 C250.68775,139.80163 250.3002,139.77173 249.9191,139.71273 C248.73888,140.48296 247.32437,140.93455 245.80936,140.93455 C244.342,140.93455 242.96825,140.51697 241.81069,139.79048 C241.66346,139.79948 241.51589,139.80158 241.36639,139.80158 C237.21213,139.80158 233.83557,136.43613 233.83557,132.28186 C233.83557,131.18763 234.08025,130.15211 234.50201,129.21622 C233.69828,128.02321 233.22466,126.59865 233.22466,125.05094 C233.22466,120.89668 236.60123,117.53122 240.75548,117.53122 C241.2626,117.53122 241.75478,117.58062 242.23277,117.67561 C243.43131,116.86926 244.86724,116.39826 246.42027,116.39826 L246.42023,116.39831 Z" id="Shape" fill="#3B2906" sketch:type="MSShapeGroup"></path>
+            <path d="M353.45451,67.41239 C355.69323,67.41239 357.78253,68.06262 359.55483,69.16024 L359.7091,69.16024 C365.91771,69.16024 370.99918,74.02998 371.30998,80.16137 C371.32078,80.35915 371.30998,80.56084 371.30998,80.76112 C371.30998,82.44107 370.94022,84.03249 370.29897,85.47344 C371.53562,87.31842 372.25245,89.52677 372.25245,91.91646 C372.25245,92.11673 372.26325,92.31843 372.25245,92.51621 C371.94165,98.64759 366.86018,103.51733 360.65157,103.51733 C360.03813,103.51733 359.44025,103.47133 358.85232,103.38019 C357.03156,104.56844 354.84936,105.26512 352.51211,105.26512 C350.24837,105.26512 348.12905,104.62091 346.34325,103.50015 C346.11611,103.51405 345.88845,103.51725 345.65782,103.51725 C339.24893,103.51725 334.0398,98.32527 334.0398,91.91638 C334.0398,90.22826 334.41729,88.63074 335.06795,87.18691 C333.82801,85.34642 333.09735,83.14872 333.09735,80.76102 C333.09735,74.35213 338.30647,69.16014 344.71535,69.16014 C345.4977,69.16014 346.257,69.23634 346.9944,69.38291 C348.84343,68.13892 351.05867,67.4123 353.45456,67.4123 L353.45451,67.41239 Z" id="Shape" stroke="#000000" stroke-width="1.64503" fill="#734B02" sketch:type="MSShapeGroup"></path>
+            <path d="M356.38522,71.1167 C358.62392,71.1167 360.71322,71.76693 362.48553,72.86455 L362.6398,72.86455 C368.84842,72.86455 373.92988,77.73429 374.24068,83.86567 C374.25148,84.06345 374.24068,84.26515 374.24068,84.46542 C374.24068,86.14538 373.87092,87.73679 373.22967,89.17773 C374.46632,91.02272 375.18315,93.23108 375.18315,95.62076 C375.18315,95.82104 375.19395,96.02273 375.18315,96.22051 C374.87235,102.3519 369.79089,107.22164 363.58227,107.22164 C362.96884,107.22164 362.37095,107.17554 361.78302,107.08449 C359.96226,108.27275 357.78006,108.96943 355.44281,108.96943 C353.17908,108.96943 351.05975,108.32521 349.27395,107.20444 C349.04682,107.21834 348.81916,107.22154 348.58852,107.22154 C342.17963,107.22154 336.97052,102.02957 336.97052,95.62066 C336.97052,93.93257 337.34799,92.33504 337.99865,90.89122 C336.75872,89.05073 336.02805,86.85302 336.02805,84.46533 C336.02805,78.05644 341.23718,72.86445 347.64605,72.86445 C348.4284,72.86445 349.1877,72.94065 349.92511,73.0872 C351.77413,71.84323 353.98938,71.1166 356.38528,71.1166 L356.38522,71.1167 Z" id="Shape" fill="#3B2906" sketch:type="MSShapeGroup"></path>
+            <path d="M303.21273,46.93836 C304.75149,46.93836 306.18755,47.38529 307.40573,48.13973 L307.51177,48.13973 C311.7792,48.13973 315.27191,51.4869 315.48553,55.70126 C315.49253,55.83721 315.48553,55.97584 315.48553,56.1135 C315.48553,57.2682 315.23138,58.36205 314.79063,59.35247 C315.64063,60.6206 316.13333,62.1385 316.13333,63.78103 C316.13333,63.91868 316.14033,64.05732 316.13333,64.19326 C315.91971,68.40762 312.427,71.75479 308.15956,71.75479 C307.73792,71.75479 307.32697,71.72319 306.92287,71.66049 C305.67138,72.47722 304.17146,72.95608 302.56497,72.95608 C301.00901,72.95608 299.55231,72.51329 298.32486,71.74294 C298.16874,71.75294 298.01226,71.75474 297.85373,71.75474 C293.44864,71.75474 289.86819,68.18607 289.86819,63.78097 C289.86819,62.62066 290.12765,61.52262 290.57488,60.53021 C289.72261,59.26517 289.2204,57.7546 289.2204,56.11343 C289.2204,51.70833 292.80085,48.13966 297.20594,48.13966 C297.74368,48.13966 298.26558,48.19206 298.77242,48.29278 C300.04334,47.43773 301.56596,46.9383 303.21276,46.9383 L303.21273,46.93836 Z" id="Shape" stroke="#000000" stroke-width="1.1307" fill="#734B02" sketch:type="MSShapeGroup"></path>
+            <path d="M306.90452,51.1619 C308.44328,51.1619 309.87934,51.60883 311.09752,52.36327 L311.20356,52.36327 C315.471,52.36327 318.9637,55.71044 319.17733,59.92479 C319.18433,60.06074 319.17733,60.19937 319.17733,60.33703 C319.17733,61.49173 318.92318,62.58558 318.48242,63.576 C319.33242,64.84413 319.82513,66.36203 319.82513,68.00456 C319.82513,68.14222 319.83213,68.28085 319.82513,68.41679 C319.6115,72.63115 316.1188,75.97833 311.85136,75.97833 C311.42972,75.97833 311.01877,75.94663 310.61466,75.88403 C309.36317,76.70077 307.86326,77.17963 306.25677,77.17963 C304.70081,77.17963 303.24411,76.73683 302.01665,75.96648 C301.86054,75.97648 301.70406,75.97828 301.54553,75.97828 C297.14043,75.97828 293.55999,72.40962 293.55999,68.00451 C293.55999,66.84422 293.81944,65.74617 294.26667,64.75377 C293.41441,63.48872 292.91219,61.97815 292.91219,60.33699 C292.91219,55.93189 296.49264,52.36322 300.89773,52.36322 C301.43547,52.36322 301.95737,52.41562 302.46422,52.51632 C303.73513,51.66129 305.25776,51.16185 306.90457,51.16185 L306.90452,51.1619 Z" id="Shape" opacity="0.8025" fill="#3B2906" sketch:type="MSShapeGroup"></path>
+            <path d="M31.48996,80.44905 C32.9411,80.44905 34.29539,80.87053 35.4442,81.58201 L35.5442,81.58201 C39.56864,81.58201 42.86246,84.73859 43.06392,88.71297 C43.07092,88.84117 43.06392,88.97191 43.06392,89.10173 C43.06392,90.19068 42.82424,91.22224 42.40858,92.15627 C43.21018,93.35219 43.67483,94.78365 43.67483,96.33265 C43.67483,96.46247 43.68183,96.59321 43.67483,96.72141 C43.47337,100.69579 40.17955,103.85237 36.15511,103.85237 C35.75748,103.85237 35.36993,103.82257 34.98883,103.76347 C33.80861,104.5337 32.3941,104.98529 30.87909,104.98529 C29.41173,104.98529 28.03798,104.56771 26.88042,103.84123 C26.73319,103.85023 26.58562,103.85233 26.43612,103.85233 C22.28186,103.85233 18.90529,100.48687 18.90529,96.33261 C18.90529,95.23837 19.14998,94.20285 19.57174,93.26696 C18.76801,92.07395 18.29439,90.64939 18.29439,89.10168 C18.29439,84.94742 21.67096,81.58196 25.82521,81.58196 C26.33233,81.58196 26.82451,81.63136 27.3025,81.72636 C28.50104,80.92 29.93697,80.449 31.48999,80.449 L31.48996,80.44905 Z" id="Shape" stroke="#000000" stroke-width="1.06631" fill="#734B02" sketch:type="MSShapeGroup"></path>
+            <path d="M33.38965,82.85019 C34.84078,82.85019 36.19507,83.27167 37.34389,83.98315 L37.44389,83.98315 C41.46833,83.98315 44.76215,87.13973 44.96361,91.11411 C44.97061,91.24231 44.96361,91.37305 44.96361,91.50287 C44.96361,92.59182 44.72393,93.62338 44.30827,94.5574 C45.10987,95.75333 45.57452,97.18479 45.57452,98.73379 C45.57452,98.86361 45.58152,98.99435 45.57452,99.12255 C45.37306,103.09693 42.07924,106.25351 38.0548,106.25351 C37.65717,106.25351 37.26962,106.22361 36.88852,106.16461 C35.7083,106.93484 34.29379,107.38643 32.77878,107.38643 C31.31142,107.38643 29.93767,106.96885 28.78011,106.24236 C28.63288,106.25136 28.48531,106.25346 28.33581,106.25346 C24.18155,106.25346 20.80499,102.88801 20.80499,98.73374 C20.80499,97.63951 21.04967,96.60399 21.47143,95.6681 C20.6677,94.47509 20.19408,93.05053 20.19408,91.50282 C20.19408,87.34856 23.57065,83.9831 27.7249,83.9831 C28.23202,83.9831 28.7242,84.0325 29.20219,84.12749 C30.40073,83.32114 31.83666,82.85014 33.38969,82.85014 L33.38965,82.85019 Z" id="Shape" fill="#3B2906" sketch:type="MSShapeGroup"></path>
+            <path d="M108.65063,85.48126 C110.10177,85.48126 111.45606,85.90274 112.60487,86.61422 L112.70487,86.61422 C116.72931,86.61422 120.02313,89.7708 120.22459,93.74518 C120.23159,93.87338 120.22459,94.00412 120.22459,94.13394 C120.22459,95.22289 119.98491,96.25445 119.56925,97.18848 C120.37085,98.3844 120.8355,99.81586 120.8355,101.36486 C120.8355,101.49468 120.8425,101.62542 120.8355,101.75362 C120.63404,105.728 117.34022,108.88458 113.31578,108.88458 C112.91815,108.88458 112.5306,108.85478 112.1495,108.79568 C110.96928,109.56591 109.55477,110.0175 108.03976,110.0175 C106.5724,110.0175 105.19865,109.59992 104.04109,108.87344 C103.89386,108.88244 103.74629,108.88454 103.59679,108.88454 C99.44253,108.88454 96.06596,105.51908 96.06596,101.36482 C96.06596,100.27058 96.31065,99.23506 96.73241,98.29917 C95.92868,97.10616 95.45506,95.6816 95.45506,94.13389 C95.45506,89.97963 98.83163,86.61417 102.98588,86.61417 C103.493,86.61417 103.98518,86.66357 104.46317,86.75857 C105.66171,85.95221 107.09764,85.48121 108.65066,85.48121 L108.65063,85.48126 Z" id="Shape" stroke="#000000" stroke-width="1.06631" fill="#734B02" sketch:type="MSShapeGroup"></path>
+            <path d="M110.55032,87.8824 C112.00145,87.8824 113.35574,88.30388 114.50456,89.01536 L114.60456,89.01536 C118.629,89.01536 121.92282,92.17194 122.12428,96.14632 C122.13128,96.27452 122.12428,96.40526 122.12428,96.53508 C122.12428,97.62403 121.8846,98.65559 121.46894,99.58961 C122.27054,100.78554 122.73519,102.217 122.73519,103.766 C122.73519,103.89582 122.74219,104.02656 122.73519,104.15476 C122.53373,108.12914 119.23991,111.28572 115.21547,111.28572 C114.81784,111.28572 114.43029,111.25582 114.04919,111.19682 C112.86897,111.96705 111.45446,112.41864 109.93945,112.41864 C108.47209,112.41864 107.09834,112.00106 105.94078,111.27457 C105.79355,111.28357 105.64598,111.28567 105.49648,111.28567 C101.34222,111.28567 97.96566,107.92022 97.96566,103.76595 C97.96566,102.67172 98.21034,101.6362 98.6321,100.70031 C97.82837,99.5073 97.35475,98.08274 97.35475,96.53503 C97.35475,92.38077 100.73132,89.01531 104.88557,89.01531 C105.39269,89.01531 105.88487,89.06471 106.36286,89.1597 C107.5614,88.35335 108.99733,87.88235 110.55036,87.88235 L110.55032,87.8824 Z" id="Shape" fill-opacity="0.507" fill="#3B2906" sketch:type="MSShapeGroup"></path>
+            <path d="M273.04093,76.14619 C274.50392,76.14619 275.86926,76.41053 277.02744,76.85676 L277.12826,76.85676 C281.18554,76.85676 284.50624,78.8365 284.70934,81.32915 C284.71634,81.40955 284.70934,81.49155 284.70934,81.57297 C284.70934,82.25594 284.46771,82.90291 284.04866,83.48871 C284.8568,84.23877 285.32524,85.13655 285.32524,86.10805 C285.32524,86.18945 285.33224,86.27147 285.32524,86.35187 C285.12213,88.84452 281.80144,90.82426 277.74415,90.82426 C277.34328,90.82426 276.95257,90.80556 276.56836,90.76856 C275.37851,91.25163 273.95245,91.53486 272.42508,91.53486 C270.94575,91.53486 269.56079,91.27296 268.39378,90.81733 C268.24535,90.82333 268.09657,90.82433 267.94585,90.82433 C263.75769,90.82433 260.35357,88.71358 260.35357,86.10812 C260.35357,85.42183 260.60026,84.77238 261.02546,84.1854 C260.21517,83.43717 259.73768,82.54372 259.73768,81.57303 C259.73768,78.96756 263.14181,76.85681 267.32996,76.85681 C267.84122,76.85681 268.33741,76.88781 268.8193,76.94741 C270.02762,76.44168 271.47527,76.14628 273.04097,76.14628 L273.04093,76.14619 Z" id="Shape" stroke="#000000" stroke-width="0.8479" fill="#734B02" sketch:type="MSShapeGroup"></path>
+            <path d="M274.95613,77.65213 C276.4191,77.65213 277.78444,77.91648 278.94264,78.3627 L279.04345,78.3627 C283.10073,78.3627 286.42143,80.34244 286.62454,82.83509 C286.63154,82.91549 286.62454,82.99749 286.62454,83.07891 C286.62454,83.76188 286.3829,84.40885 285.96385,84.99465 C286.77199,85.74471 287.24043,86.6425 287.24043,87.614 C287.24043,87.6954 287.24743,87.77742 287.24043,87.85782 C287.03733,90.35047 283.71663,92.33021 279.65935,92.33021 C279.25847,92.33021 278.86776,92.31151 278.48355,92.27441 C277.2937,92.75749 275.86765,93.04071 274.34027,93.04071 C272.86094,93.04071 271.47598,92.77882 270.30897,92.32318 C270.16054,92.32918 270.01177,92.33018 269.86105,92.33018 C265.67288,92.33018 262.26877,90.21944 262.26877,87.61397 C262.26877,86.92769 262.51545,86.27823 262.94065,85.69126 C262.13036,84.94303 261.65288,84.04957 261.65288,83.07888 C261.65288,80.47342 265.057,78.36267 269.24515,78.36267 C269.75641,78.36267 270.2526,78.39367 270.7345,78.45327 C271.94282,77.94754 273.39046,77.65214 274.95617,77.65214 L274.95613,77.65213 Z" id="Shape" fill-opacity="0.507" fill="#3B2906" sketch:type="MSShapeGroup"></path>
+            <path d="M81.75258,45.99512 C83.21557,45.99512 84.58091,46.25946 85.73909,46.70569 L85.83991,46.70569 C89.89719,46.70569 93.21789,48.68543 93.42099,51.17808 C93.42799,51.25848 93.42099,51.34048 93.42099,51.4219 C93.42099,52.10487 93.17936,52.75184 92.76031,53.33764 C93.56845,54.0877 94.03689,54.98548 94.03689,55.95698 C94.03689,56.03838 94.04389,56.1204 94.03689,56.2008 C93.83378,58.69345 90.51309,60.67319 86.4558,60.67319 C86.05493,60.67319 85.66422,60.65449 85.28001,60.61749 C84.09016,61.10056 82.6641,61.38379 81.13673,61.38379 C79.6574,61.38379 78.27244,61.12189 77.10543,60.66626 C76.957,60.67226 76.80822,60.67326 76.6575,60.67326 C72.46934,60.67326 69.06522,58.56251 69.06522,55.95705 C69.06522,55.27076 69.31191,54.62131 69.73711,54.03433 C68.92682,53.2861 68.44933,52.39265 68.44933,51.42196 C68.44933,48.81649 71.85346,46.70574 76.04161,46.70574 C76.55287,46.70574 77.04906,46.73674 77.53095,46.79634 C78.73927,46.29061 80.18692,45.99521 81.75262,45.99521 L81.75258,45.99512 Z" id="Shape" stroke="#000000" stroke-width="0.8479" fill="#734B02" sketch:type="MSShapeGroup"></path>
+            <path d="M83.66778,47.50106 C85.13075,47.50106 86.49609,47.76541 87.65429,48.21163 L87.7551,48.21163 C91.81238,48.21163 95.13308,50.19137 95.33619,52.68402 C95.34319,52.76442 95.33619,52.84642 95.33619,52.92784 C95.33619,53.61081 95.09455,54.25778 94.6755,54.84358 C95.48364,55.59364 95.95208,56.49143 95.95208,57.46293 C95.95208,57.54433 95.95908,57.62635 95.95208,57.70675 C95.74898,60.1994 92.42828,62.17914 88.371,62.17914 C87.97012,62.17914 87.57941,62.16044 87.1952,62.12334 C86.00535,62.60642 84.5793,62.88964 83.05192,62.88964 C81.57259,62.88964 80.18763,62.62775 79.02062,62.17211 C78.87219,62.17811 78.72342,62.17911 78.5727,62.17911 C74.38453,62.17911 70.98042,60.06837 70.98042,57.4629 C70.98042,56.77662 71.2271,56.12716 71.6523,55.54019 C70.84201,54.79196 70.36453,53.8985 70.36453,52.92781 C70.36453,50.32235 73.76865,48.2116 77.9568,48.2116 C78.46806,48.2116 78.96425,48.2426 79.44615,48.3022 C80.65447,47.79647 82.10211,47.50107 83.66782,47.50107 L83.66778,47.50106 Z" id="Shape" fill-opacity="0.507" fill="#3B2906" sketch:type="MSShapeGroup"></path>
+            <path d="M206.58419,62.51323 C208.83828,62.51323 210.94191,62.92051 212.72637,63.60804 L212.88171,63.60804 C219.13293,63.60804 224.24927,66.65831 224.56219,70.49883 C224.57299,70.62271 224.56219,70.74905 224.56219,70.8745 C224.56219,71.92678 224.1899,72.92359 223.54425,73.82616 C224.78939,74.98181 225.51113,76.36505 225.51113,77.86188 C225.51113,77.9873 225.52193,78.11367 225.51113,78.23755 C225.19819,82.07808 220.08187,85.12835 213.83063,85.12835 C213.213,85.12835 212.61101,85.09955 212.01904,85.04255 C210.18579,85.78683 207.9886,86.22322 205.63532,86.22322 C203.35605,86.22322 201.22219,85.8197 199.42413,85.11769 C199.19544,85.12669 198.9662,85.12849 198.73398,85.12849 C192.28111,85.12849 187.03624,81.87637 187.03624,77.86203 C187.03624,76.80464 187.41633,75.804 188.07145,74.89962 C186.823,73.74679 186.08732,72.37021 186.08732,70.87463 C186.08732,66.86028 191.3322,63.60815 197.78506,63.60815 C198.57278,63.60815 199.33728,63.65595 200.07975,63.74775 C201.94145,62.96855 204.17191,62.51341 206.58425,62.51341 L206.58419,62.51323 Z" id="Shape" stroke="#000000" stroke-width="1.3064" fill="#734B02" sketch:type="MSShapeGroup"></path>
+            <path d="M209.53501,64.8335 C211.78907,64.8335 213.89271,65.24079 215.6772,65.9283 L215.83252,65.9283 C222.08374,65.9283 227.20008,68.97857 227.51302,72.8191 C227.52382,72.94297 227.51302,73.06932 227.51302,73.19476 C227.51302,74.24704 227.14071,75.24386 226.49507,76.14642 C227.7402,77.30207 228.46195,78.68533 228.46195,80.18216 C228.46195,80.30758 228.47275,80.43395 228.46195,80.55783 C228.14902,84.39836 223.03268,87.44863 216.78146,87.44863 C216.16381,87.44863 215.56183,87.41983 214.96986,87.36263 C213.13661,88.10693 210.93943,88.5433 208.58613,88.5433 C206.30687,88.5433 204.173,88.1398 202.37494,87.43777 C202.14625,87.44677 201.91703,87.44857 201.68481,87.44857 C195.23193,87.44857 189.98707,84.19646 189.98707,80.18211 C189.98707,79.12473 190.36714,78.12408 191.02226,77.21971 C189.77382,76.06688 189.03814,74.69029 189.03814,73.19471 C189.03814,69.18037 194.28301,65.92825 200.73587,65.92825 C201.52359,65.92825 202.28809,65.97605 203.03057,66.06784 C204.89228,65.28864 207.12272,64.8335 209.53508,64.8335 L209.53501,64.8335 Z" id="Shape" fill-opacity="0.507" fill="#3B2906" sketch:type="MSShapeGroup"></path>
+        </g>
+    </g>
+</svg>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day30/index.html b/JavaScript Challenges/Javascript 30/Day30/index.html
new file mode 100644
index 0000000..b1a3abd
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day30/index.html	
@@ -0,0 +1,90 @@
+<!DOCTYPE html>
+<html lang="en">
+
+<head>
+    <meta charset="UTF-8">
+    <title>Whack A Mole!</title>
+    <link href='https://fonts.googleapis.com/css?family=Amatic+SC:400,700' rel='stylesheet' type='text/css'>
+    <link rel="stylesheet" href="styles.css">
+</head>
+
+<body>
+
+    <h1>Whack-a-mole! <span class="score">0</span></h1>
+    <button class="start" onClick="startGame()">Start!</button>
+
+    <div class="game">
+        <div class="hole hole1">
+            <div class="mole"></div>
+        </div>
+        <div class="hole hole2">
+            <div class="mole"></div>
+        </div>
+        <div class="hole hole3">
+            <div class="mole"></div>
+        </div>
+        <div class="hole hole4">
+            <div class="mole"></div>
+        </div>
+        <div class="hole hole5">
+            <div class="mole"></div>
+        </div>
+        <div class="hole hole6">
+            <div class="mole"></div>
+        </div>
+    </div>
+
+    <script>
+        const holes = document.querySelectorAll('.hole');
+        const scoreBoard = document.querySelector('.score');
+        const moles = document.querySelectorAll('.mole');
+        let lastHole;
+        let timeUp = false;
+        let score = 0;
+
+        function randomTime(min, max) {
+            return Math.round(Math.random() * (max - min) + min);
+        }
+
+        function randomHole(holes) {
+            const idx = Math.floor(Math.random() * holes.length);
+            const hole = holes[idx];
+            if (hole === lastHole) {
+                console.log('Ah nah thats the same one bud');
+                return randomHole(holes);
+            }
+            lastHole = hole;
+            return hole;
+        }
+
+        function peep() {
+            const time = randomTime(500, 1000);
+            const hole = randomHole(holes);
+            hole.classList.add('up');
+            setTimeout(() => {
+                hole.classList.remove('up');
+                if (!timeUp) peep();
+            }, time);
+        }
+
+        function startGame() {
+            scoreBoard.textContent = 0;
+            timeUp = false;
+            score = 0;
+            peep();
+            setTimeout(() => timeUp = true, 10000)
+        }
+
+        function bonk(e) {
+            if (!e.isTrusted) return; // cheater!
+            score++;
+            this.parentNode.classList.remove('up');
+            scoreBoard.textContent = score;
+        }
+
+        moles.forEach(mole => mole.addEventListener('click', bonk));
+
+    </script>
+</body>
+
+</html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day30/mole.svg b/JavaScript Challenges/Javascript 30/Day30/mole.svg
new file mode 100644
index 0000000..73769a1
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day30/mole.svg	
@@ -0,0 +1,56 @@
+<?xml version="1.0" encoding="UTF-8" standalone="no"?>
+<svg width="197px" height="276px" viewBox="0 0 197 276" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:sketch="http://www.bohemiancoding.com/sketch/ns">
+    <!-- Generator: Sketch 3.5.2 (25235) - http://www.bohemiancoding.com/sketch -->
+    <title>mole</title>
+    <desc>Created with Sketch.</desc>
+    <defs>
+        <linearGradient x1="-2.91199922%" y1="1913.75172%" x2="102.930973%" y2="1913.75172%" id="linearGradient-1">
+            <stop stop-color="#F1AAC2" offset="0%"></stop>
+            <stop stop-color="#E5638F" offset="100%"></stop>
+        </linearGradient>
+        <linearGradient x1="102.911999%" y1="1911.46876%" x2="-2.9309731%" y2="1911.46876%" id="linearGradient-2">
+            <stop stop-color="#F1AAC2" offset="0%"></stop>
+            <stop stop-color="#E5638F" offset="100%"></stop>
+        </linearGradient>
+        <linearGradient x1="27.3602544%" y1="18.7873013%" x2="90.1838279%" y2="90.3397894%" id="linearGradient-3">
+            <stop stop-color="#FFCEAE" offset="0%"></stop>
+            <stop stop-color="#FFB280" offset="100%"></stop>
+        </linearGradient>
+        <linearGradient x1="-8.6108091%" y1="1770.32632%" x2="108.55641%" y2="1770.32632%" id="linearGradient-4">
+            <stop stop-color="#8A8A8A" offset="0%"></stop>
+            <stop stop-color="#F1F1F1" offset="28.57%"></stop>
+            <stop stop-color="#FFFFFF" offset="100%"></stop>
+        </linearGradient>
+        <linearGradient x1="-8.63327515%" y1="1772.18319%" x2="108.533944%" y2="1772.18319%" id="linearGradient-5">
+            <stop stop-color="#8A8A8A" offset="0%"></stop>
+            <stop stop-color="#F1F1F1" offset="28.57%"></stop>
+            <stop stop-color="#FFFFFF" offset="100%"></stop>
+        </linearGradient>
+    </defs>
+    <g id="Page-1" stroke="none" stroke-width="1" fill="none" fill-rule="evenodd" sketch:type="MSPage">
+        <g id="mole" sketch:type="MSLayerGroup" transform="translate(3.323440, 2.016670)">
+            <path d="M94.7684787,0.910105958 C94.5239962,0.910105958 94.1940256,0.947852969 93.9289099,0.95201723 L93.9289099,0.993928502 C79.3030178,1.16431394 43.7467171,4.25959571 30.6674046,36.1298807 C24.1485495,27.4651954 30.6620314,36.1325673 9.63620742,16.1901229 C9.63620742,16.1901229 -16.7438353,42.0376103 19.2492696,60.3934176 C31.7512543,176.386302 6.28102203,220.95906 80.2859177,219.36576 C84.5021111,219.274953 89.1307409,219.336208 93.9289099,219.449717 L94.0547781,219.449717 L96.2376568,219.491629 L96.2376568,219.407672 C101.040098,219.293893 105.661017,219.232813 109.880649,219.323715 C183.885545,220.917015 158.415312,176.344256 170.917297,60.351372 C206.910402,41.9955647 180.530359,16.1480773 180.530359,16.1480773 C159.504844,36.0907098 166.018017,27.4231498 159.499162,36.0878351 C145.978317,3.14166626 108.371615,0.909904462 94.7684115,0.909904462 L94.7684787,0.910105958 Z" id="Shape" stroke="#000000" stroke-width="5.81003068" fill="#333333" sketch:type="MSShapeGroup"></path>
+            <path d="M166.443818,194.154781 C166.443818,236.683432 135.246002,271.159715 96.7615554,271.159715 C58.2771084,271.159715 27.0792931,236.683432 27.0792931,194.154781 C27.0792931,151.62613 58.2771084,117.149835 96.7615554,117.149835 C135.246002,117.149835 166.443818,151.62613 166.443818,194.154781 L166.443818,194.154781 Z" id="Shape" stroke="#000000" stroke-width="2.70512659" fill="#93939F" sketch:type="MSShapeGroup"></path>
+            <path d="M95.720778,118.043863 C133.148484,119.3746 163.138149,153.305831 163.138149,194.990339 C163.138149,234.332088 136.441568,266.748468 101.975565,271.391095 C126.023595,264.677111 144.205873,233.2727 144.205873,195.536059 C144.205873,154.58258 122.802176,121.078159 95.720778,118.505626 L95.720778,118.043863 L95.720778,118.043863 Z" id="Shape" fill="#7F7F8D" sketch:type="MSShapeGroup"></path>
+            <path d="M95.5398476,116.904293 C58.1121414,118.23503 28.1224769,152.166261 28.1224769,193.850769 C28.1224769,233.192517 54.8190572,265.608898 89.2850604,270.251525 C65.2370307,263.537541 47.0547523,232.133129 47.0547523,194.396489 C47.0547523,153.44301 68.4584493,119.938589 95.5398476,117.366056 L95.5398476,116.904293 L95.5398476,116.904293 Z" id="Shape" fill="#C1C1C8" sketch:type="MSShapeGroup"></path>
+            <path d="M69.5126253,29.4483642 C52.237484,29.4483642 38.2082231,45.6680265 38.2082231,65.656439 C38.2082231,85.6448515 52.237484,101.862579 69.5126253,101.862579 C79.6646772,101.862579 88.6721483,96.2559124 94.3911563,87.5796074 C100.108217,96.2617155 109.136993,101.862579 119.294861,101.862579 C136.564186,101.862579 150.595394,85.6409962 150.595394,65.656439 C150.595394,45.6718818 136.564186,29.4483642 119.294861,29.4483642 C109.13894,29.4483642 100.108217,35.0531103 94.3911563,43.733284 C88.6721483,35.0589134 79.6627428,29.4483642 69.5126253,29.4483642 L69.5126253,29.4483642 Z" id="Shape" stroke="#000000" stroke-width="5.48446607" fill="#FFFFFF" sketch:type="MSShapeGroup"></path>
+            <path d="M134.866153,32.9480239 C135.248333,35.2457651 135.429769,37.6323269 135.429769,40.0584377 C135.429769,60.6988367 120.965564,77.4313722 103.129487,77.4313722 C92.6382583,77.4313722 83.2806574,71.6573401 77.3759681,62.6903072 C71.4692857,71.6513436 62.1943876,77.4313722 51.7091724,77.4313722 C46.5076649,77.4313722 41.5839535,76.0149912 37.2282434,73.4859699 C40.1013168,90.7328502 53.2226407,103.791887 68.9648914,103.791887 C79.450124,103.791887 88.7683665,97.9684967 94.6750489,89.0074603 C100.579738,97.9744932 109.893977,103.791887 120.385206,103.791887 C138.221284,103.791887 152.72885,87.0159898 152.72885,66.3755734 C152.72885,51.7496373 145.449755,39.0936293 134.866153,32.9480239 L134.866153,32.9480239 Z" id="Shape" opacity="0.3374" fill="#A5A5A5" sketch:type="MSShapeGroup"></path>
+            <g id="Group" transform="translate(73.930691, 58.411444)" sketch:type="MSShapeGroup">
+                <path d="M18.4817076,9.69500453 C18.4817076,14.6993776 14.4224328,18.7567157 9.41805973,18.7567157 C4.41368664,18.7567157 0.356348548,14.6993776 0.356348548,9.69500453 C0.356348548,4.68869476 4.41562332,0.631356667 9.41805973,0.631356667 C14.4243695,0.633293344 18.4817076,4.68869476 18.4817076,9.69500453 L18.4817076,9.69500453 Z" id="Shape" stroke="#000000" stroke-width="3.47633502" fill="#000000"></path>
+                <path d="M8.50007488,6.5207911 C8.50007488,7.81836462 7.44652265,8.86998017 6.14894914,8.86998017 C4.85137562,8.86998017 3.79976006,7.81836462 3.79976006,6.5207911 C3.79976006,5.22321758 4.85137562,4.16966535 6.14894914,4.16966535 C7.44652265,4.16966535 8.50007488,5.22321758 8.50007488,6.5207911 L8.50007488,6.5207911 Z" id="Shape" fill="#FFFFFF"></path>
+            </g>
+            <g id="Group" transform="translate(97.170814, 58.411444)" sketch:type="MSShapeGroup">
+                <path d="M18.1931427,9.69500453 C18.1931427,14.6993776 14.1358046,18.7567157 9.13143155,18.7567157 C4.12512178,18.7567157 0.0677836913,14.6993776 0.0677836913,9.69500453 C0.0677836913,4.68869476 4.12512178,0.631356667 9.13143155,0.631356667 C14.1377413,0.631356667 18.1931427,4.68869476 18.1931427,9.69500453 L18.1931427,9.69500453 Z" id="Shape" stroke="#000000" stroke-width="3.47633502" fill="#000000"></path>
+                <path d="M8.20957335,6.5207911 C8.20957335,7.81836462 7.1579578,8.86998017 5.86038428,8.86998017 C4.56281076,8.86998017 3.51119521,7.81836462 3.51119521,6.5207911 C3.51119521,5.22321758 4.56281076,4.16966535 5.86038428,4.16966535 C7.1579578,4.16966535 8.20957335,5.22321758 8.20957335,6.5207911 L8.20957335,6.5207911 Z" id="Shape" fill="#FFFFFF"></path>
+            </g>
+            <path d="M7.26303537,25.5937093 C7.26303537,25.5937093 -6.38209268,41.4090487 17.3373499,56.4045123 C21.1453382,52.7151651 21.6897952,52.0625716 26.1691699,48.5106988 L26.1691699,45.6561651 C20.7427079,42.6965039 23.2475378,38.825568 14.397919,27.8241815 L7.26303537,25.5937093 L7.26303537,25.5937093 Z" id="Shape" stroke="#000000" stroke-width="1.34331" fill="url(#linearGradient-1)" sketch:type="MSShapeGroup"></path>
+            <path d="M184.264197,26.2971067 C184.264197,26.2971067 197.909325,42.1124461 174.189882,57.1079097 C170.381894,53.4185625 169.837437,52.7659691 165.358062,49.2140962 L165.358062,46.3595625 C170.784524,43.3999013 168.279695,39.5289654 177.129313,28.5275789 L184.264197,26.2971067 L184.264197,26.2971067 Z" id="Shape" stroke="#000000" stroke-width="1.34331" fill="url(#linearGradient-2)" sketch:type="MSShapeGroup"></path>
+            <path d="M86.7076649,120.297145 C124.135371,121.627882 154.125036,155.559113 154.125036,197.243621 C154.125036,236.585369 127.428455,269.00175 92.9624521,273.644377 C117.010482,266.930393 135.19276,235.525981 135.19276,197.789341 C135.19276,156.835862 113.789063,123.33144 86.7076649,120.758908 L86.7076649,120.297145 L86.7076649,120.297145 Z" id="Shape" fill="#7F7F8D" sketch:type="MSShapeGroup"></path>
+            <path d="M95.0527365,91.068694 C83.50739,91.068694 73.5501718,96.7597745 68.9841268,104.958587 C58.4525361,108.211304 51.6890106,113.313585 51.6890106,119.038007 C51.6890106,120.61473 52.2350795,122.158046 53.2002343,123.613818 C52.4751962,125.302519 52.1087949,127.061799 52.1087949,128.866536 C52.1087949,141.909794 72.1077121,152.476646 96.7738524,152.476646 C121.439993,152.476646 141.43891,141.909794 141.43891,128.866536 C141.43891,126.790665 140.920849,124.773779 139.969665,122.855694 C140.639184,121.629789 141.019126,120.343906 141.019126,119.038007 C141.019126,112.770472 132.89832,107.260281 120.617605,104.092165 C115.850198,96.3580711 106.190294,91.068694 95.0527365,91.068694 L95.0527365,91.068694 Z" id="Shape" stroke="#000000" stroke-width="2.68662" fill="url(#linearGradient-3)" sketch:type="MSShapeGroup"></path>
+            <path d="M111.403264,98.953252 C111.403264,107.664402 104.341483,114.726183 95.6303329,114.726183 C86.9191825,114.726183 79.8574018,107.664402 79.8574018,98.953252 C79.8574018,90.2421016 86.9191825,83.1803075 95.6303329,83.1803075 C104.341483,83.1803075 111.403264,90.2420882 111.403264,98.953252 L111.403264,98.953252 Z" id="Shape" fill="#000000" sketch:type="MSShapeGroup"></path>
+            <path d="M76.4845116,132.95005 L94.3625841,132.95005 L94.3625841,160.192821 L76.4845116,160.192821 L76.4845116,132.95005 Z" id="Shape" stroke="#000000" stroke-width="3.04518974" fill="url(#linearGradient-4)" sketch:type="MSShapeGroup"></path>
+            <path d="M94.5812347,132.444187 L112.459307,132.444187 L112.459307,159.686957 L94.5812347,159.686957 L94.5812347,132.444187 Z" id="Shape" stroke="#000000" stroke-width="3.04518974" fill="url(#linearGradient-5)" sketch:type="MSShapeGroup"></path>
+            <path d="M59.5778941,123.739283 C85.550766,138.236405 109.839866,135.895782 132.809379,120.359367" id="Shape" stroke="#000000" stroke-width="5.37324" sketch:type="MSShapeGroup"></path>
+        </g>
+    </g>
+</svg>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/Day30/script.js b/JavaScript Challenges/Javascript 30/Day30/script.js
new file mode 100644
index 0000000..e69de29
diff --git a/JavaScript Challenges/Javascript 30/Day30/styles.css b/JavaScript Challenges/Javascript 30/Day30/styles.css
new file mode 100644
index 0000000..5e33ca3
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day30/styles.css	
@@ -0,0 +1,86 @@
+html {
+  box-sizing: border-box;
+  font-size: 10px;
+  background: #ffc600;
+}
+
+*,
+*:before,
+*:after {
+  box-sizing: inherit;
+}
+
+body {
+  padding: 0;
+  margin: 0;
+  font-family: cursive;
+}
+
+h1 {
+  text-align: center;
+  font-size: 10rem;
+  line-height: 1;
+  margin-bottom: 0;
+}
+
+.start{
+    padding: 1.5rem;
+    background: transparent;
+    border: 2px solid rgba(0, 0, 0, 0.5);
+    font-size: 2rem;
+    width: 10rem;
+    margin: 10px auto;
+    display: block;
+}
+
+.start:hover{
+    background-color: rgb(0, 0, 0);
+    color: #ffc600;
+}
+
+.score {
+  background: rgba(255, 255, 255, 0.2);
+  padding: 0 3rem;
+  line-height: 1;
+  border-radius: 1rem;
+}
+
+.game {
+  width: 600px;
+  height: 400px;
+  display: flex;
+  flex-wrap: wrap;
+  margin: 0 auto;
+}
+
+.hole {
+  flex: 1 0 33.33%;
+  overflow: hidden;
+  position: relative;
+}
+
+.hole:after {
+  display: block;
+  background: url(dirt.svg) bottom center no-repeat;
+  background-size: contain;
+  content: "";
+  width: 100%;
+  height: 70px;
+  position: absolute;
+  z-index: 2;
+  bottom: -30px;
+}
+
+.mole {
+  background: url("mole.svg") bottom center no-repeat;
+  background-size: 60%;
+  position: absolute;
+  top: 100%;
+  width: 100%;
+  height: 100%;
+  transition: all 0.4s;
+}
+
+.hole.up .mole {
+  top: 0;
+}
diff --git a/JavaScript Challenges/Javascript 30/Day31/index.html b/JavaScript Challenges/Javascript 30/Day31/index.html
new file mode 100644
index 0000000..a4cd55f
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/Day31/index.html	
@@ -0,0 +1,84 @@
+ <!DOCTYPE html>
+ <html lang="en">
+ <head>
+     <meta charset="UTF-8">
+     <meta name="viewport" content="width=device-width, initial-scale=1.0">
+     <title>Document</title>
+     <style>
+        input[type="text"]
+        {
+            width: 2rem;
+            height: 2rem;
+        }
+        input[type="submit"]
+        {
+            background-color: black;
+            color: white;
+            height: 2rem;
+            width: 15rem;
+            border: 2px solid black;
+        }
+        form{
+            width: 100%;
+            height: 100vh;
+            display: flex;
+            flex-direction: column;
+            align-items: center;
+            justify-content: center;
+        }
+        .inputs
+        {
+            margin: 1rem;
+        }
+        .box{
+            display: flex;
+            flex-direction: column;
+            align-items: center;
+            border: 2px dashed black;
+        }
+     </style>
+ </head>
+ <body>
+     <form name="verify">
+         <div class="box">
+            <div class="inputs">
+                <input type="text" name="n1" maxlength="1">
+                <input type="text" name="n2" maxlength="1">
+                <input type="text" name="n3" maxlength="1">
+                <input type="text" name="n4" maxlength="1">
+                <input type="text" name="n5" maxlength="1">
+                <input type="text" name="n6" maxlength="1">
+            </div>
+            <input type="submit" value="Verify">
+        </div>
+     </form>
+
+     <script>
+        const form = document.querySelector('[name="verify"]');
+        const inputs = document.querySelectorAll('.inputs input');
+
+        function handleInput(e){
+            // console.log(e.currentTarget);
+            const input = e.target;
+
+            if(input.nextElementSibling && input.value)
+            {   
+                input.nextElementSibling.focus();
+            }
+        }
+
+        function handlePaste(e){
+            const paste = e.clipboardData.getData('text');
+
+            inputs.forEach((input, i) => { 
+                input.value = paste[i] || '';
+            });
+        }
+
+        inputs[0].addEventListener('paste', handlePaste);
+
+        form.addEventListener('input', handleInput);
+        
+     </script>
+ </body>
+ </html>
\ No newline at end of file
diff --git a/JavaScript Challenges/Javascript 30/readme.md b/JavaScript Challenges/Javascript 30/readme.md
new file mode 100644
index 0000000..1e22f4a
--- /dev/null
+++ b/JavaScript Challenges/Javascript 30/readme.md	
@@ -0,0 +1,2 @@
+Complete code for JavaScript 30 Challenge. 
+Each day brings a new and intresting concept of JavaScript. 
diff --git a/NamasteJS/E01.md b/NamasteJS/E01 - How JavaScript Works & Execution Context.md
similarity index 100%
rename from NamasteJS/E01.md
rename to NamasteJS/E01 - How JavaScript Works & Execution Context.md
diff --git a/NamasteJS/E02.md b/NamasteJS/E02 - How is JavaScript Code executed & What is Call Stack.md
similarity index 98%
rename from NamasteJS/E02.md
rename to NamasteJS/E02 - How is JavaScript Code executed & What is Call Stack.md
index 2212bb4..3bbccd5 100644
--- a/NamasteJS/E02.md
+++ b/NamasteJS/E02 - How is JavaScript Code executed & What is Call Stack.md	
@@ -2,7 +2,7 @@
 
 Let us look at this code below.
 
-```
+```js
 var n=2;
 function square(num){
     var ans = num*num;
@@ -11,12 +11,11 @@ function square(num){
 
 var square2 = square(n);
 var square4 = square(4);
-
 ```
 
 When we run this code, a GLOBAL Execution context is created. It will have Memory and Code.
 
-It is created in two phases. 
+It is created in two phases.
 
 1. __First Phase(Memory Creation Phase)__: JS will allocate the memory to all variables and functions. Ex. in our code, it will reserve memory space for n.
 
diff --git a/NamasteJS/E03.md b/NamasteJS/E03 - Hoisting in JavaScript (variables & functions).md
similarity index 96%
rename from NamasteJS/E03.md
rename to NamasteJS/E03 - Hoisting in JavaScript (variables & functions).md
index 013ab38..7fdfe2f 100644
--- a/NamasteJS/E03.md
+++ b/NamasteJS/E03 - Hoisting in JavaScript (variables & functions).md	
@@ -2,18 +2,16 @@
 
 Let us understand the concept by the following examples.
 
-```
+```js
 // code example 1
 
 var x = 7;
-
 function getName(){
     console.log("Namaste JavaScript");
 }
 
 getName();
 console.log(x);
-
 ```
 
 Output:
@@ -22,26 +20,24 @@ Output:
 
 >  7
 
-```
+```js
 // code example 2
 
 getName();
 console.log(x);
 
 var x = 7;
-
 function getName(){
     console.log("Namaste JavaScript");
 }
-
 ```
 
- Output:
+Output:
 >  Namaste JavaScript
 
 >  undefined
 
-```
+```js
 // code example 3
 
 getName();
@@ -50,7 +46,6 @@ console.log(x);
 function getName(){
     console.log("Namaste JavaScript");
 }
-
 ```
 
 Output:
@@ -61,8 +56,7 @@ Output:
 
 __Hoisting__ is a concept which enables us to extract values of variables and functions even before defining them.
 
-```
-
+```js
 // code example 4
 
 function getName(){
@@ -70,8 +64,6 @@ function getName(){
 }
 
 console.log(getName)
-
-
 ```
 
 Output:
@@ -81,8 +73,7 @@ Output:
   }
 
 
-```
-
+```js
 // code example 5
 
 getName();
@@ -92,7 +83,6 @@ console.log(getName)
 function getName(){
     console.log("Namaste JavaScript");
 }
-
 ```
 
 Output:
@@ -104,7 +94,7 @@ Output:
       console.log("Namaste JavaScript);
   }
 
-```
+```js
 // code example 6
 
 console.log(getName)
@@ -116,7 +106,6 @@ var getName = function () {
 var getName = () => {
     console.log("Namaste JavaScript");
 }
-
 ```
 
 Output:
@@ -131,17 +120,3 @@ __REASON OF WEIRDNESS__
 * The answer lies in the Global Exection Context. In the memory phase, the variables will be initialized as *undefined* and functions will get the whole function code in their memory.
 
 * This is the reason why we are getting these outputs.
-
-
-
-
-
-
-
-
-
-
-
-
-
-
diff --git a/NamasteJS/E04.md b/NamasteJS/E04 - How functions work in JS & Variable Environment.md
similarity index 99%
rename from NamasteJS/E04.md
rename to NamasteJS/E04 - How functions work in JS & Variable Environment.md
index 718f32c..dd99469 100644
--- a/NamasteJS/E04.md
+++ b/NamasteJS/E04 - How functions work in JS & Variable Environment.md	
@@ -2,7 +2,7 @@
 
 Let us understand the execution of the functions in JS by the simple example.
 
-```
+```js
 // code example 
 
 var x=1;
@@ -19,7 +19,6 @@ function b(){
     var x=100;
     console.log(x);
 }
-
 ```
 
 Outputs:
diff --git a/NamasteJS/E05.md b/NamasteJS/E05 - SHORTEST JS Program - window & this keyword.md
similarity index 99%
rename from NamasteJS/E05.md
rename to NamasteJS/E05 - SHORTEST JS Program - window & this keyword.md
index ad88f59..f8e734f 100644
--- a/NamasteJS/E05.md
+++ b/NamasteJS/E05 - SHORTEST JS Program - window & this keyword.md	
@@ -24,8 +24,9 @@ __GLOBAL SPACE__
 
 * Whenever in a JS file, we create a global variable or a function, it gets attached with the *window* object and can be accessed through it.
 
-```
+```js
 // code example 1
+
 a=10;
 console.log(window.a);
 console.log(a);
diff --git a/NamasteJS/E06.md b/NamasteJS/E06 - undefined vs not defined in JS.md
similarity index 100%
rename from NamasteJS/E06.md
rename to NamasteJS/E06 - undefined vs not defined in JS.md
diff --git a/NamasteJS/E07.md b/NamasteJS/E07 - The Scope Chain, Scope & Lexical Environment.md
similarity index 99%
rename from NamasteJS/E07.md
rename to NamasteJS/E07 - The Scope Chain, Scope & Lexical Environment.md
index c9b4b6c..5bfff53 100644
--- a/NamasteJS/E07.md
+++ b/NamasteJS/E07 - The Scope Chain, Scope & Lexical Environment.md	
@@ -2,7 +2,7 @@
 
 Let us understand with the help of this code.
 
-```
+```js
 // code example 1
 
 function a(){
@@ -20,7 +20,7 @@ Output:
 
 > 10
 
-```
+```js
 // code example 2
 
 function a(){
@@ -95,18 +95,3 @@ Output:
 2. See example 2 for instance. 
 
     * The variable b is searched in GEC's local memory. And since it is not found, it goes to its parent lexical environment; but since its GEC, so it will be *null*. And thus, it throws error!
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
diff --git a/NamasteJS/E08.md b/NamasteJS/E08 - let & const in JS - Temporal Dead Zone.md
similarity index 98%
rename from NamasteJS/E08.md
rename to NamasteJS/E08 - let & const in JS - Temporal Dead Zone.md
index 89adc86..54a0a5a 100644
--- a/NamasteJS/E08.md
+++ b/NamasteJS/E08 - let & const in JS - Temporal Dead Zone.md	
@@ -2,17 +2,18 @@
 
 > let and const declarations are hoisted; but differently. 
 
-```
+```js
 // code example 1
 
+console.log(b);
 console.log(a);
 let a = 10;
 var b = 100;
-
 ```
 
 Output:
 
+> undefined
 > Uncaught ReferenceError: cannot access 'a' before initialization
 
 Technically, in JS if a is hoisted, then this error wasn't expected.
@@ -30,7 +31,7 @@ Technically, in JS if a is hoisted, then this error wasn't expected.
 * window.b, this.b will print the value of b. But window.a and this.a will show it undefined as we know that window and this refer to variables in Global memory. Since, a is stored in seperate space, it cannot be accessed.
 
 
-```
+```js
 // code example 2
 
 const b;
@@ -41,7 +42,7 @@ console.log(b);
 Outputs:
 > Uncaught SyntaxError: Missing initializer in const declaration
 
-```
+```js
 // code example 3
 
 const b=1000;
@@ -111,18 +112,3 @@ The Errors that occurs if no reference is available for access. Can occur when t
 * If not, use let.
 * Avoid var.
 * Declare all variables with let at the top to avoid errors to shrink temporal dead zone to zero.
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
diff --git a/NamasteJS/E09.md b/NamasteJS/E09 - BLOCK SCOPE & Shadowing in JS.md
similarity index 90%
rename from NamasteJS/E09.md
rename to NamasteJS/E09 - BLOCK SCOPE & Shadowing in JS.md
index 0d650f3..8bcee50 100644
--- a/NamasteJS/E09.md
+++ b/NamasteJS/E09 - BLOCK SCOPE & Shadowing in JS.md	
@@ -2,9 +2,9 @@
 
 ### __What is Block?__
 
-* Block is also known as *Compound Statement*. We use it group many JS statements together. We need to group them because we can group multiple statements at a place where JS expects only one statement. 
+* Block is also known as *Compound Statement*. We use it to group many JS statements together. We need to group them because we can group multiple statements at a place where JS expects only one statement. 
 
-```
+```js
 //code example 1
 
 if(true)some statement
@@ -12,7 +12,7 @@ if(true)some statement
 
 But if we want to write more statements to execute after if condition; then:
 
-```
+```js
 //code example 2
 
 if(true){
@@ -31,8 +31,7 @@ if(true){
 
 * What all variables and functions that can be accessed inside the block.
 
-```
-
+```js
 //code example 3
 
 {
@@ -62,7 +61,7 @@ Outputs:
 
 ### __What is SHADOWING in JS?__
 
-```
+```js
 //code example 4
 
 var a= 100;
@@ -84,7 +83,7 @@ Outputs:
 
 * So, a is reassigned to 10. Since both refers to same memory space i.e GLOBAL SPACE.
 
-```
+```js
 //code example 5
 
 let b = 100;
@@ -116,7 +115,7 @@ Outputs:
 
 ### __What is Illegal Shadowing?__
 
-```
+```js
 // code example 6
 
 let a = 20;
@@ -138,26 +137,11 @@ Outputs:
 
 * Since var is function scoped, it is not a problem with the code below.
 
-```
+```js
 // code example 6
 
 let a = 20;
 function x() {
     var a = 20;
 }
-
 ```
-
-
-
-
-
-
-
-
-
-
-
-
-
-
diff --git a/NamasteJS/E10 - Closures in JS.md b/NamasteJS/E10 - Closures in JS.md
new file mode 100644
index 0000000..e410bfb
--- /dev/null
+++ b/NamasteJS/E10 - Closures in JS.md	
@@ -0,0 +1,79 @@
+
+
+---
+
+# [Episode 10](https://www.youtube.com/watch?v=lW_erSjyMeM&list=PLlasXeu85E9cQ32gLCvAvr9vNaUccPVNP&index=12): Closures in JavaScript 🔥
+
+In JavaScript, closures are a powerful concept that combines a function with its lexical environment, enabling the function to retain access to variables from its parent scope even after the parent function has finished executing.
+
+## Understanding Closures
+
+Let's delve into a few examples to understand how closures work:
+
+**Example 1:**
+```js
+function x() {
+    var a = 7;
+    function y() {
+        console.log(a);
+    }
+    return y;
+}
+
+var z = x();
+console.log(z); // Output: f y(){ console.log(a); }
+z(); // Output: 7
+```
+
+In this example, the inner function `y` maintains a reference to the variable `a` from its lexical scope. Even though the outer function `x` has completed execution, `z` still prints `7` when invoked, demonstrating how the closure retains the environment.
+
+**Example 2:**
+```js
+function x() {
+    var a = 7;
+    function y() {
+        console.log(a);
+    }
+    a = 100;
+    return y;
+}
+
+var z = x();
+console.log(z); // Output: f y(){ console.log(a); }
+z(); // Output: 100
+```
+
+Here, even after the value of `a` is changed to `100`, the closure retains the updated value when invoked through `z()`.
+
+**Example 3:**
+```js
+function z() {
+    var b = 900;
+    function x() {
+        var a = 7;
+        function y() {
+            console.log(a, b);
+        }
+        return y;
+    }
+}
+
+var t = x();
+t(); // Output: 7 900
+```
+
+This example highlights how closures encapsulate the lexical environments of all parent levels.
+
+## Applications of Closures
+
+Closures find application in various programming scenarios:
+
+- **Module Design Pattern**: Closures help create private variables and methods in JavaScript, facilitating the module design pattern.
+- **Currying**: Closures enable the creation of curried functions, allowing the transformation of functions with multiple arguments into a sequence of functions with a single argument.
+- **Memoization**: Closures can be used to implement memoization, a technique that stores the results of expensive function calls and returns the cached result when the same inputs occur again.
+- **Asynchronous State Management**: Closures aid in maintaining state in asynchronous programming, enabling functions to access their lexical environment even after the parent function has completed execution.
+- **Timeouts and Iterators**: Closures are instrumental in scenarios such as managing timeouts and creating custom iterators.
+
+Understanding closures is crucial for harnessing the full power of JavaScript and developing efficient and robust applications.
+
+---
diff --git a/NamasteJS/E10.md b/NamasteJS/E10.md
deleted file mode 100644
index 25dc1b4..0000000
--- a/NamasteJS/E10.md
+++ /dev/null
@@ -1,100 +0,0 @@
-# [Episode 10](https://www.youtube.com/watch?v=lW_erSjyMeM&list=PLlasXeu85E9cQ32gLCvAvr9vNaUccPVNP&index=12): Closures in JS 🔥 
-
-* Closure: A function bind together with its lexical environment.
-
-Function along with its lexical scope forms a closure.
-
-Function bundled along with the environment.
-
-```
-Example 1
-
-function x(){
-    var a=7;
-    function y(){
-        console.log(a);
-    }
-    return y;
-}
-
-var z = x();
-console.log(z);
-z();
-```
-
-Output:
->f y(){
-    console.log(a);
-}
->7
-
-### Observation
-
-Function x() returns a `function y` which prints `variable a` on the console. Here, `a` is not in scope of y() and so the JS engine will search for `a` in its parent's lexical environment. Here, `a` is defined equal to `7`.  
-
-Here after the line `var z = x()` the function x is over and thus it is completely removed from the execution context.
-
-But now when we call `z()`, given that `x()` is completely gone from the context, what should it print?
-
-It prints `7`. This means that `x()` didn't return `function y` but a closure. Since closure is a `function` + `its lexical env`, when `z()` is called, it remembers its lexical environment and thus prints `7`.
-
-Thus, `Closure` is nothing but a function + lexical environment(it has reference of values of vars and funcs).
-
-```
-Example 2
-
-function x(){
-    var a=7;
-    function y(){
-        console.log(a);
-    }
-    a=100;
-    return y;
-}
-
-var z = x();
-console.log(z);
-z();
-```
-
-Output:
->f y(){
-    console.log(a);
-}
->100
-
-```
-Example 3
-function z(){
-    var b = 900;
-    function x(){
-        var a=7;
-        function y(){
-            console.log(a, b);
-        }
-        return y;
-    }
-}
-
-var t = x();
-t();
-```
-
-Output:
->7 900
-
-Above example shows that Closure bundles the lexical environment of all the parent levels.
-
-### Applications of Closures
-
-- Module Design Pattern
-- Currying
-- Functions like `once`
-- Memoize
-- Maintaining state in `async` world
-- Set timeout
-- Iterators etc.
-
-
-
-
diff --git a/NamasteJS/E11.md b/NamasteJS/E11 - setTimeout + Closures Interview Question.md
similarity index 98%
rename from NamasteJS/E11.md
rename to NamasteJS/E11 - setTimeout + Closures Interview Question.md
index 924c4c8..8e7d356 100644
--- a/NamasteJS/E11.md
+++ b/NamasteJS/E11 - setTimeout + Closures Interview Question.md	
@@ -2,7 +2,7 @@
 
 Let us understand by a simple example.
 
-``` 
+```js
 function x(){
     for(var i=0; i<=5; i++){
         setTimeout(function (){
@@ -13,6 +13,7 @@ function x(){
 }
 x();
 ```
+
 Expected:
 >Namaste JS
 > 1 (after 1s)
@@ -42,7 +43,7 @@ Here, all the `setTimeout`s are closures, and thus they have reference of lexica
 
 ### How to solve this?
 
-``` 
+```js
 function x(){
     for(let i=0; i<=5; i++){
         setTimeout(function (){
@@ -53,6 +54,7 @@ function x(){
 }
 x();
 ```
+
 Output:
 >Namaste JS
 > 1 (after 1s)
@@ -70,7 +72,7 @@ And so, in async queue, all `setTimeout` has unique value of `i` at a different
 
 ### How to solve this without using `let`?
 
-``` 
+```js
 function x(){
     for(var i=0; i<=5; i++){
         function close(x){
@@ -90,14 +92,3 @@ x();
 We enclose the `setTimeout` inside a `close()` function. And everytime in a loop, we call `close(i)` which passes a unique value of `i` to each time `setTimeout` is called as `x` is already inside the lexical environment.
 
 In this way the problem is tackled.
-
-
-
-
-
-
-
-
-
-
-
diff --git a/NamasteJS/E12.md b/NamasteJS/E12 - CRAZY JS INTERVIEW - ft. Closures.md
similarity index 94%
rename from NamasteJS/E12.md
rename to NamasteJS/E12 - CRAZY JS INTERVIEW - ft. Closures.md
index b9450b6..6ad55a4 100644
--- a/NamasteJS/E12.md
+++ b/NamasteJS/E12 - CRAZY JS INTERVIEW - ft. Closures.md	
@@ -2,8 +2,8 @@
 
 ### Examples to Demonstrate Closures in Interviews
 
-```
-Example 1
+```js
+// Example 1
 
 function outer(){
     var a=10;
@@ -22,14 +22,15 @@ Output:
 **Explanation**
 `outer()()` can be literally translated to:
 
-```
+```js
 var close = outer();
 close();
 ```
+
 Here `Closure` is the `inner` function + its `lexical env`.
 
-```
-Example 2
+```js
+// Example 2
 
 function outest(){
     var c = 20;
@@ -46,6 +47,7 @@ let a=100;
 var close = (outest())("helloworld);
 close();
 ```
+
 Output:
 >10 helloworld 20
 
@@ -53,13 +55,13 @@ Output:
 
 Data Hiding : Suppose if we have a variable and we want to have data privacy over it. So we can encapsulate that data so others cant access it.
 
-```
-Example 3
+```js
+// Example 3
 
 function counter(){
     var count = 0;
     return function incrementCounter(){
-        counter++;
+        count++;
         console.log(count)
     }
 }
@@ -69,12 +71,13 @@ console.log(counter1())
 var counter2 = counter();
 console.log(counter2())
 ```
+
 Output:
 >1
 >1
 
-```
-Example 3
+```js
+// Example 4
 
 function Counter(){
     var count = 0;
@@ -106,8 +109,8 @@ We make a constructor function that has two functions increment and decrement. S
 
 It is a type of Program in the JavaScript Engine/Browser which frees up the unutlilized memory. 
 
-```
-Example 4
+```js
+// Example 5
 
 function a(){
     var x=0;
@@ -121,8 +124,8 @@ If a closure is formed, then it cannot be freed up from the memory. Garbage coll
 
 ### Smart Memory Collections
 
-```
-Example 5
+```js
+// Example 6
 
 function a(){
     var x=0;
@@ -132,17 +135,5 @@ function a(){
     }
 }
 ```
-Smart Garbage collection is done by modern engines and browsers. Here z is not used in anywhere and closure is not formed with that variable. Hence, z is garbage collected.
-
-
-
-
-
-
-
-
-
-
-
-
 
+Smart Garbage collection is done by modern engines and browsers. Here z is not used in anywhere and closure is not formed with that variable. Hence, z is garbage collected.
diff --git a/NamasteJS/E13.md b/NamasteJS/E13 - FIRST CLASS FUNCTIONS - ft. Anonymous Functions.md
similarity index 97%
rename from NamasteJS/E13.md
rename to NamasteJS/E13 - FIRST CLASS FUNCTIONS - ft. Anonymous Functions.md
index 1216327..a71ec7f 100644
--- a/NamasteJS/E13.md
+++ b/NamasteJS/E13 - FIRST CLASS FUNCTIONS - ft. Anonymous Functions.md	
@@ -2,7 +2,7 @@
 
 ### Function Statement or Function Declaration
 
-```
+```js
 function a(){
     console.log("a")
 }
@@ -11,7 +11,7 @@ a();
 
 ### Function Expression
 
-```
+```js
 var b = function (){
     console.log("b");
 }
@@ -20,7 +20,7 @@ b();
 
 ### Anonymous Function
 
-```
+```js
 function () {
 
 }
@@ -31,13 +31,14 @@ It is unnamed function.
 
 ### Named Function Expression
 
-```
+```js
 var b = function xyz(){
     console.log(xyz);
 }
 
 b();
 ```
+
 We can also name functions in JS func expressions.
 
 ### Parameters vs. Arguments
@@ -49,4 +50,3 @@ Arguments: The variables, entities that we pass in a function call.
 ### First Class Functions
 
 Functions are first class citizens in JS. They can be passed as an argument, returned or stored as a value.
-
diff --git a/NamasteJS/E14.md b/NamasteJS/E14 - Callback Functions in JS ft. Event Listeners.md
similarity index 71%
rename from NamasteJS/E14.md
rename to NamasteJS/E14 - Callback Functions in JS ft. Event Listeners.md
index 4fb7fbb..de63149 100644
--- a/NamasteJS/E14.md
+++ b/NamasteJS/E14 - Callback Functions in JS ft. Event Listeners.md	
@@ -3,7 +3,7 @@
 
 ### Callback Function in JS
 
-```
+```js
 setTimeout(function (){
     console.log("timer");
 },5000);
@@ -18,11 +18,12 @@ x(function y(){
 ```
 
 Output:
->timer
 >x
->y
+>undefined
+>Timer
 
 **Explanation**
+Here y is never logged out...ur passing y as arg. in x but never using it
 
 Settimeout is an async function; it takes a function and executes after x miliseconds.
 
@@ -30,13 +31,13 @@ The JS thread continues to execute other code and the call stack is filled and e
 
 Once the call stack is empty, it checks if the async queue is filled; then it executes those functions in the queue.
 
-Thus output is x, y and then timer.
+Thus output is x, undefined and then timer.
 
 JS is single threaded synchronous language.
 
 ### Important Interview Question
 
-```
+```js
 function attachEventListeners(){
     let count=0;
     document.getElementById("clickMe").addEventListener("click", console.log("Button", ++count));
@@ -49,4 +50,14 @@ attachEventListeners();
 
 Event Listeners are memory-heavy. Thus we must use removeEventListeners.
 
+### Let us Understand callbacks in a more cleaner way with an example
 
+```js
+function add(a, b, callback){
+    console.log(`The Sum of ${a} and ${b} is ${a+b}`);
+    callback();
+}
+add(2, 3, function disp(){
+    console.log("Print the line after addition"):
+});    
+```
diff --git a/NamasteJS/E15.md b/NamasteJS/E15 - Asynchronous JavaScript & EVENT LOOP from scratch.md
similarity index 99%
rename from NamasteJS/E15.md
rename to NamasteJS/E15 - Asynchronous JavaScript & EVENT LOOP from scratch.md
index 6a16204..b56b70c 100644
--- a/NamasteJS/E15.md
+++ b/NamasteJS/E15 - Asynchronous JavaScript & EVENT LOOP from scratch.md	
@@ -15,7 +15,8 @@ All the web APIs etc. are pushed in this.
 Microtask Queue: This is of higher priority than the Callback Queue. It does same thing as Callback Queue. It contains the Callbacks relating to those of "Promises" and Mutations.
 
 Event Loop: It is a Gate keeper. It keeps check that:
-```
+
+```js
 if(Call Stack === Empty && Callback Queue !== Empty){
     x = Callback Queue.pop()
     Call Stack.push(x);
@@ -24,6 +25,3 @@ else{
     wait(till Call Stack is not empty)
 }
 ```
-
-
-
diff --git a/NamasteJS/E16.md b/NamasteJS/E16 - JS Engine EXPOSED - Google's V8 Architecture.md
similarity index 99%
rename from NamasteJS/E16.md
rename to NamasteJS/E16 - JS Engine EXPOSED - Google's V8 Architecture.md
index b62a348..a204766 100644
--- a/NamasteJS/E16.md
+++ b/NamasteJS/E16 - JS Engine EXPOSED - Google's V8 Architecture.md	
@@ -40,5 +40,3 @@ V8 compiler: TurboFan -> Creates Optimized Machine Code -> Byte code
 Compiler Optimizes and Interpreter executes.
 
 Garbage collector: Orinoco, Oilpan
-
-
diff --git a/NamasteJS/E17.md b/NamasteJS/E17 - TRUST ISSUES with setTimeout().md
similarity index 100%
rename from NamasteJS/E17.md
rename to NamasteJS/E17 - TRUST ISSUES with setTimeout().md
diff --git a/NamasteJS/README.md b/NamasteJS/README.md
new file mode 100644
index 0000000..cf35dee
--- /dev/null
+++ b/NamasteJS/README.md
@@ -0,0 +1,3 @@
+### __Resources📚__:
+
+* [NamasteJavaScript](https://www.youtube.com/playlist?list=PLlasXeu85E9cQ32gLCvAvr9vNaUccPVNP) by [Akshay Saini](https://www.linkedin.com/in/akshaymarch7/?originalSubdomain=in)
\ No newline at end of file
diff --git a/README.md b/README.md
index 4806f0c..55feb21 100644
--- a/README.md
+++ b/README.md
@@ -1,24 +1,39 @@
 # < JavaScriptONLY />👨‍💻 🙏
 
-### Its an attempt to provide high quality, well-written set of notes for anyone who wants to learn and refer JavaScript concepts in deep. 
+### Its an attempt to provide high quality, well-written set of notes and code-snippets for anyone who wants to learn and refer JavaScript concepts in deep.
+
+---
 
-----
 #### This repository will be your go-to place when you feel to write better and cleaner code for your project, want to debug without frustration and cursing JS or to praise the beauty of this language in real sense.
+
 ---
 
 > JavaScript is Beautiful ♥. But it takes the eyes of the coder to admire ~ *anonymous*✨
+
 ---
 
-### __Resources📚__:
+### **We love Contributions💖**:
 
-* [NamasteJavaScript](https://www.youtube.com/playlist?list=PLlasXeu85E9cQ32gLCvAvr9vNaUccPVNP) by [Akshay Saini](https://www.linkedin.com/in/akshaymarch7/?originalSubdomain=in)
----
-### __We love Contributions💖__:
-Feel free to create an issue about what topic you want to add explanations or code snippets that covers core JS concepts in a better and lucid way. Link a PR with it and we are ready to accept your contributions!
+Feel free to create an issue about what topic you want to add explanations or code snippets that covers core JS concepts in a better and lucid way. Link a PR with it and we are ready to accept your contributions! Refer [this](https://github.com/sohamsshah/JavaScriptONLY/blob/master/CONTRIBUTING.md) for more insights.
+
+### How can I contribute?
+
+- If you are into Data Structures and Algorithms ft. JavaScript, contribute by adding your favourite ones to [here](/DSA)
+- Following Striver's [SDE-Sheet](https://docs.google.com/document/d/1SM92efk8oDl8nyVw8NHPnbGexTS9W-1gmTEYfEurLWQ/edit)? We believe that it is a good resource to prepare for DSA rounds. Contribute your JS Solutions from the sheet [here](/SDE_Sheet)! 
+- If you are practicing JavaScript Interview Questions, share your approach and learnings [here](/InterviewQuestions)
+- Have got Code Snippets in JavaScript? Dump them in [here](/Snippets)
+- Love taking Notes? We are looking for contributions to [NamasteJS](/NamasteJS) and [EloquentJS](/EloquentJS) currently!
+- Into Documentation? Presently, a lot of code isn't well documented. We need to maintain a README.md for each sections! Help will be appreciated there.
+- Feel Free to Raise Issues and create PRs :)
 
 ---
+
 ### Contributors💻:
-* [sohamsshah](https://github.com/sohamsshah)
----
 
+As always, thanks to our amazing contributors who are making the world fall in love with JavaScript 💛!
 
+<a href="https://github.com/codesONLY/JavaScriptONLY/graphs/contributors">
+  <img src="https://contrib.rocks/image?repo=codesONLY/JavaScriptONLY" />
+</a>
+
+---
diff --git a/ReferenceBooks/Daniel_Parker-JavaScript_with_Promises-EN.pdf b/ReferenceBooks/Daniel_Parker-JavaScript_with_Promises-EN.pdf
new file mode 100644
index 0000000..51fc8ab
Binary files /dev/null and b/ReferenceBooks/Daniel_Parker-JavaScript_with_Promises-EN.pdf differ
diff --git a/ReferenceBooks/JavaScript-The-Definitive-Guide-Master-The-Worlds-Most-Used-Programming-Language-7th-Edition.pdf b/ReferenceBooks/JavaScript-The-Definitive-Guide-Master-The-Worlds-Most-Used-Programming-Language-7th-Edition.pdf
new file mode 100644
index 0000000..1ee9fdd
Binary files /dev/null and b/ReferenceBooks/JavaScript-The-Definitive-Guide-Master-The-Worlds-Most-Used-Programming-Language-7th-Edition.pdf differ
diff --git a/SDE_Sheet/IntersectionOfTwoLinkedLists.js b/SDE_Sheet/IntersectionOfTwoLinkedLists.js
new file mode 100644
index 0000000..898fd17
--- /dev/null
+++ b/SDE_Sheet/IntersectionOfTwoLinkedLists.js
@@ -0,0 +1,56 @@
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val) {
+ *     this.val = val;
+ *     this.next = null;
+ * }
+ */
+
+/**
+ * @param {ListNode} headA
+ * @param {ListNode} headB
+ * @return {ListNode}
+ */
+var getIntersectionNode = function(headA, headB) {
+    
+    let shortList
+    let longList
+    let sizeA = headA
+    let sizeB = headB
+    let lengthA = 0 
+    let lengthB = 0
+    while (sizeA!==null || sizeB!==null){
+        if(sizeA !== null) {
+            sizeA = sizeA.next
+            lengthA ++
+        }
+        if(sizeB !==null) {
+            sizeB = sizeB.next
+            lengthB ++
+        }
+    }
+    //starts the longest list index, to the starting point of short list
+    //the idea is that an intersection of a node will ALWAYS be at the end. 
+    //therefore, SAME SIZE lists will reach the intersection value at the same time
+    let sizeDiff = Math.abs(lengthA - lengthB)
+    
+    if(lengthB > lengthA) {
+        shortList = headA
+        longList = headB
+    } else {
+        shortList = headB
+        longList = headA  
+    }
+    
+    while(shortList.next !== null || longList.next !== null){
+        if(sizeDiff<1){
+          if(shortList === longList) return shortList
+          shortList = shortList.next
+        } 
+         longList = longList.next
+         sizeDiff--
+    }
+    //catch any 1 length lists
+    if(shortList === longList) return shortList
+    return shortList.next
+};
diff --git a/SDE_Sheet/LongestSubstringWithoutRepeatingCharacters.js b/SDE_Sheet/LongestSubstringWithoutRepeatingCharacters.js
new file mode 100644
index 0000000..fae2648
--- /dev/null
+++ b/SDE_Sheet/LongestSubstringWithoutRepeatingCharacters.js
@@ -0,0 +1,23 @@
+class Solution {
+    public int lengthOfLongestSubstring(String s) {
+         int maxl = 0;
+        Map<Character, Integer> charIdxMap = new HashMap<Character, Integer>(); //O(1) space
+        
+        char c;
+        int startIdx = 0;
+        int i;
+        for(i=0; i<s.length(); i++){ //O(N) time
+            c = s.charAt(i);
+            if(charIdxMap.getOrDefault(c, -1) >= startIdx){
+                maxl = Math.max(maxl, i-startIdx);
+                startIdx = charIdxMap.get(c) + 1;
+            }
+            
+            charIdxMap.put(c, i);
+        }
+        
+        maxl = Math.max(maxl, i-startIdx);
+        
+        return maxl;
+    }
+}
diff --git a/SDE_Sheet/MiddleOfTheLinkedList.js b/SDE_Sheet/MiddleOfTheLinkedList.js
new file mode 100644
index 0000000..d20f3a3
--- /dev/null
+++ b/SDE_Sheet/MiddleOfTheLinkedList.js
@@ -0,0 +1,22 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+class Solution {
+    public ListNode middleNode(ListNode head) {
+        ListNode slow = head;
+        ListNode fast = head;
+        
+        while(fast != null && fast.next != null){
+            fast = fast.next.next;
+            slow = slow.next;
+        }
+        return slow;
+    }
+}
diff --git a/SDE_Sheet/ReverseLinkedList.js b/SDE_Sheet/ReverseLinkedList.js
new file mode 100644
index 0000000..12ed87d
--- /dev/null
+++ b/SDE_Sheet/ReverseLinkedList.js
@@ -0,0 +1,29 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+class Solution {
+    public ListNode reverseList(ListNode head) {
+        Stack<ListNode> stack =new Stack<ListNode>();
+        while(head!=null)
+        {
+            stack.push(head);
+            head = head.next;
+        }
+        ListNode dummy = new ListNode(-1);
+        head=dummy;
+        while(!stack.isEmpty())
+        {
+            ListNode current= stack.pop();
+            head.next=new ListNode(current.val);
+            head=head.next;
+        }
+        return dummy.next;
+    }
+}
diff --git a/SDE_Sheet/findDuplicate.js b/SDE_Sheet/findDuplicate.js
new file mode 100644
index 0000000..572d581
--- /dev/null
+++ b/SDE_Sheet/findDuplicate.js
@@ -0,0 +1,21 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+ var findDuplicate = function(arr) {
+    var slow = arr[0]
+    var fast = arr[0]
+
+    do{
+      slow = arr[slow]
+      fast = arr[arr[fast]]
+    }while(slow !== fast)
+
+    fast = arr[0]
+    while(slow != fast){
+      fast = arr[fast]
+      slow = arr[slow]
+    }
+    return fast
+    
+};
\ No newline at end of file
diff --git a/SDE_Sheet/mergeIntervals.js b/SDE_Sheet/mergeIntervals.js
new file mode 100644
index 0000000..8b59100
--- /dev/null
+++ b/SDE_Sheet/mergeIntervals.js
@@ -0,0 +1,20 @@
+/**
+ * @param {number[][]} intervals
+ * @return {number[][]}
+ */
+ var merge = function(intervals) {
+    intervals.sort((a,b) => a[0]-b[0])
+     var res = []
+ 
+     var tempInterval = intervals[0]
+     for(let i=0; i < intervals.length; i++){
+       if(tempInterval[1] >= intervals[i][0]){
+         tempInterval[1] = Math.max(intervals[i][1], tempInterval[1])
+       } else{
+         res.push(tempInterval)
+         tempInterval = intervals[i]
+       }
+     }
+     res.push(tempInterval) 
+     return res  
+ };
\ No newline at end of file
diff --git a/SDE_Sheet/mergeTwoSortedArrays.js b/SDE_Sheet/mergeTwoSortedArrays.js
new file mode 100644
index 0000000..db537c6
--- /dev/null
+++ b/SDE_Sheet/mergeTwoSortedArrays.js
@@ -0,0 +1,23 @@
+class Solution {
+    
+    //Function to merge the arrays.
+    merge(arr1, arr2, n, m) {
+        function updateArr(arr){
+            for(let i = 1; i < arr.length; i++){
+                if(arr[i] < arr[i-1]){
+                    [arr[i], arr[i-1]] = [arr[i-1], arr[i]]
+                }
+            }
+            return arr
+        }
+        
+        
+        for(let i=0; i < arr1.length; i++){
+            if(arr1[i] > arr2[0]){
+                [arr1[i], arr2[0]] = [arr2[0], arr1[i]]
+                arr2 = updateArr(arr2);
+            }
+        }
+         
+    }
+}
\ No newline at end of file
diff --git a/SDE_Sheet/nextPermutation.js b/SDE_Sheet/nextPermutation.js
new file mode 100644
index 0000000..b54fc1d
--- /dev/null
+++ b/SDE_Sheet/nextPermutation.js
@@ -0,0 +1,33 @@
+/**
+ * @param {number[]} nums
+ * @return {void} Do not return anything, modify nums in-place instead.
+ */
+ var nextPermutation = function(nums) {
+    let index_1 = -1;
+    let index_2 = -1;
+    for(let i=nums.length-2; i>=0; i--){
+        if(nums[i] < nums[i+1]){
+            index_1 = i; 
+            break;
+        }   
+    }
+    for(let i=nums.length-1; i>=0; i--){
+        if(nums[i] > nums[index_1]){
+            index_2 = i;
+            break;
+        }
+    }
+    // swap
+    [nums[index_1], nums[index_2]] = [nums[index_2], nums[index_1]]
+    
+    // reverse the latter half
+    let x = index_1 + 1;
+    let y = nums.length - 1
+    
+    while (x < y){
+        [nums[x], nums[y]] = [nums[y], nums[x]]
+        x++;
+        y--;
+    } 
+    
+};
\ No newline at end of file
diff --git a/SDE_Sheet/pascalTriangle.js b/SDE_Sheet/pascalTriangle.js
new file mode 100644
index 0000000..1921e45
--- /dev/null
+++ b/SDE_Sheet/pascalTriangle.js
@@ -0,0 +1,28 @@
+/**
+ * @param {number} numRows
+ * @return {number[][]}
+ */
+ var generate = function(numRows) {
+    let firstCol = [1];
+    let secondCol = [1,1]
+
+    if(numRows === 1){
+        return [firstCol];
+    }
+    if(numRows === 2){
+        return [firstCol,secondCol]
+    }
+    
+    let res = [firstCol, secondCol];
+    
+    for(let i=0; i < numRows - 2; i++){
+        let temp = [...res].pop()
+        let col = []
+        for(let j=0; j < temp.length-1; j++){
+            col.push(temp[j]+temp[j+1]) 
+        }
+        res.push([1, ...col, 1])
+    }
+    return (res);
+    
+};
\ No newline at end of file
diff --git a/SDE_Sheet/setMatrixZeros.js b/SDE_Sheet/setMatrixZeros.js
new file mode 100644
index 0000000..0fa233a
--- /dev/null
+++ b/SDE_Sheet/setMatrixZeros.js
@@ -0,0 +1,33 @@
+/**
+ * @param {number[][]} matrix
+ * @return {void} Do not return anything, modify matrix in-place instead.
+ */
+ var setZeroes = function(matrix) {
+    let col0 = 1;
+    let rows = matrix.length;
+    let cols = matrix[0].length;
+    
+    for(let i=0; i < rows; i++){
+        if(matrix[i][0] === 0){
+            col0 = 0;
+        }
+        for(let j=1; j < cols; j++){
+            if(matrix[i][j] === 0){
+                matrix[i][0] = 0;
+                matrix[0][j] = 0;
+            }
+        }
+    }
+    
+    for(let i=rows-1; i >= 0; i--){
+        for(let j=cols-1; j>=1; j--){
+            if(matrix[i][0] === 0 || matrix[0][j] == 0){
+                matrix[i][j] = 0;
+            }
+        }
+        if(col0 === 0){
+            matrix[i][0] = 0;
+        }
+    }
+    
+};
\ No newline at end of file
diff --git a/SDE_Sheet/sortColors.js b/SDE_Sheet/sortColors.js
new file mode 100644
index 0000000..23f6fc7
--- /dev/null
+++ b/SDE_Sheet/sortColors.js
@@ -0,0 +1,23 @@
+/**
+ * @param {number[]} nums
+ * @return {void} Do not return anything, modify nums in-place instead.
+ */
+ var sortColors = function(nums) {
+    low = 0;
+    mid = 0;
+    high = nums.length -1
+    
+    while(mid <= high){
+        if(nums[mid] === 0){
+            [nums[mid], nums[low]] = [nums[low], nums[mid]]
+            mid++
+            low++
+        } else if(nums[mid] === 1){
+            mid++
+        } else if(nums[mid] === 2){
+            [nums[mid], nums[high]] = [nums[high], nums[mid]]
+            high--    
+        }
+    }
+    
+};
\ No newline at end of file
diff --git a/SDE_Sheet/stocksBuyAndSell.js b/SDE_Sheet/stocksBuyAndSell.js
new file mode 100644
index 0000000..eb13ce1
--- /dev/null
+++ b/SDE_Sheet/stocksBuyAndSell.js
@@ -0,0 +1,16 @@
+/**
+ * @param {number[]} prices
+ * @return {number}
+ */
+ var maxProfit = function(prices) {
+    let maxProfit = 0;
+    let minPrice = Number.POSITIVE_INFINITY;
+    for(let x in prices){
+        minPrice = Math.min(minPrice, prices[x]);
+        maxProfit = Math.max(maxProfit, prices[x] - minPrice);
+    }
+    
+    
+    return maxProfit
+    
+};
\ No newline at end of file
diff --git a/SDE_Sheet/twoSum.js b/SDE_Sheet/twoSum.js
new file mode 100644
index 0000000..11b4c71
--- /dev/null
+++ b/SDE_Sheet/twoSum.js
@@ -0,0 +1,22 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number[]}
+ */
+/* A brute-force approach. Traverse the nums array via two pointers i and j and return
+ indexes stored in an array if the total matches the target*/
+var twoSum = function (nums, target) {
+  let targetResult = [];
+  // traverse the array via two pointers
+  for (let i = 0; i < nums.length; i++) {
+    for (let j = i + 1; j < nums.length; j++) {
+      // check if the sum of two numbers is equal to the target
+      if (nums[i] + nums[j] === target) {
+        targetResult.push(i);
+        targetResult.push(j);
+      }
+    }
+  }
+  // return the array with indexes
+  return targetResult;
+};
\ No newline at end of file
diff --git a/Snippets/Arrays/arraySubset.js b/Snippets/Arrays/arraySubset.js
new file mode 100644
index 0000000..5523e39
--- /dev/null
+++ b/Snippets/Arrays/arraySubset.js
@@ -0,0 +1,25 @@
+const arr1 = [2, 3, 4, 5, 6, 88, 9];
+const arr2 = [3, 3, 3, 5, 100];
+
+function isSubset(arr1, arr2) {
+  const arr1Set = [];
+  const arr2Set = [];
+
+  arr1.forEach((item) => {
+    if (!arr1Set.includes(item)) {
+      arr1Set.push(item);
+    }
+  });
+  arr2.forEach((item) => {
+    if (!arr2Set.includes(item)) {
+      arr2Set.push(item);
+    }
+  });
+
+  const res = arr1Set.reduce((previousValue, currentValue) => {
+    return previousValue + +arr2Set.includes(currentValue);
+  }, 0);
+  return res === arr2Set.length;
+}
+
+console.log(isSubset(arr1, arr2));
diff --git a/Snippets/Arrays/atPolyfill.js b/Snippets/Arrays/atPolyfill.js
new file mode 100644
index 0000000..3853401
--- /dev/null
+++ b/Snippets/Arrays/atPolyfill.js
@@ -0,0 +1,10 @@
+Array.prototype.myAt = myAt;
+
+function myAt(index) {
+  if (index >= 0) {
+    return this[index];
+  }
+  return this[this.length - -index];
+}
+
+console.log([1, 2, 3].myAt(-4));
diff --git a/Snippets/Arrays/checkItemPresentInArray.js b/Snippets/Arrays/checkItemPresentInArray.js
new file mode 100644
index 0000000..fa16a88
--- /dev/null
+++ b/Snippets/Arrays/checkItemPresentInArray.js
@@ -0,0 +1,27 @@
+/*
+ * Problem: Checks whether the dish you wish to eat is available in the menu
+ */
+
+let polarBearMenu = [
+  "Chocolate Fudge",
+  "Death by chocolate",
+  "Gudbud",
+  "Fruit zest",
+];
+
+let isYourDishAvailable = false;
+let itemYouWishToEat = "Gudbud";
+
+for (let itemNumber = 0; itemNumber < polarBearMenu.length; itemNumber++) {
+  if (polarBearMenu[itemNumber] === itemYouWishToEat) {
+    console.log("Yay " + itemYouWishToEat + " is there in the menu");
+    isYourDishAvailable = true;
+    break;
+  } else {
+    isYourDishAvailable = false;
+  }
+}
+
+if (!isYourDishAvailable) {
+  console.log("Oops! " + itemYouWishToEat + " is not available. Try searching at a different place.");
+}
diff --git a/Snippets/Arrays/checkItemPresentInArrayUsingMethod.js b/Snippets/Arrays/checkItemPresentInArrayUsingMethod.js
new file mode 100644
index 0000000..e88329a
--- /dev/null
+++ b/Snippets/Arrays/checkItemPresentInArrayUsingMethod.js
@@ -0,0 +1,18 @@
+/**
+ * Problem: Checks whether pizza is available in the menu
+ */
+
+let polarBearMenu = [
+  "Chocolate Fudge",
+  "Death by chocolate",
+  "Gudbud",
+  "Fruit zest",
+];
+
+let itemYouWishToEat = "Gudbud";
+
+if (polarBearMenu.includes(itemYouWishToEat)) {
+	console.log(itemYouWishToEat + " is present in the menu ");
+} else {
+	console.log(itemYouWishToEat + " is not present in the menu");
+}
\ No newline at end of file
diff --git a/Snippets/Arrays/checkPositionOfElementInArray.js b/Snippets/Arrays/checkPositionOfElementInArray.js
new file mode 100644
index 0000000..0553384
--- /dev/null
+++ b/Snippets/Arrays/checkPositionOfElementInArray.js
@@ -0,0 +1,7 @@
+/**
+ * Check the position of IPL teams in 2021
+ */
+
+let iplTeams = ["CSK", "KKR", "DC", "RCB", "MI", "PBKS", "RR", "SRH"];
+let iplTeamPositionYouWantToKnow = "MI";
+console.log(iplTeams.indexOf(iplTeamPositionYouWantToKnow) + 1);
diff --git a/Snippets/Arrays/convertArrayToString.js b/Snippets/Arrays/convertArrayToString.js
new file mode 100644
index 0000000..9852912
--- /dev/null
+++ b/Snippets/Arrays/convertArrayToString.js
@@ -0,0 +1,12 @@
+/**
+ * Convert given array to string
+ */
+
+const numbers = [1, 2, 3, 4, 5];
+console.log(Array.isArray(numbers)); // true since numbers is an array
+console.log(numbers.join(",")); // 1,2,3,4,5
+console.log(typeof numbers.join(",")); // string
+
+const names = ["Javascript", "Python", "PHP"];
+console.log(names.join(",")); // 'Javascript', 'Python', 'PHP'
+
diff --git a/Snippets/Arrays/filterPolyfill.js b/Snippets/Arrays/filterPolyfill.js
new file mode 100644
index 0000000..d70c249
--- /dev/null
+++ b/Snippets/Arrays/filterPolyfill.js
@@ -0,0 +1,14 @@
+Array.prototype.myFilter = myFilter;
+
+function myFilter(cb) {
+  const filteredArr = [];
+  this.forEach((item) => {
+    if (cb(item)) {
+      filteredArr.push(item);
+    }
+  });
+  return filteredArr;
+}
+
+const arr = [1, 2, 3, 4];
+console.log(arr.myFilter((item) => item !== 2));
diff --git a/Snippets/Arrays/flattenADeeplyNestedArray.js b/Snippets/Arrays/flattenADeeplyNestedArray.js
new file mode 100644
index 0000000..379f66c
--- /dev/null
+++ b/Snippets/Arrays/flattenADeeplyNestedArray.js
@@ -0,0 +1,27 @@
+function flattenArray(arr, n = Infinity) {
+  let res = [];
+  for (i in arr) {
+    if (n !== 0 && Array.isArray(arr[i])) {
+      res.push(...flattenArray(arr[i], n - 1));
+    } else {
+      res.push(arr[i]);
+    }
+  }
+  return res;
+}
+let input = [
+  1,
+  2,
+  3,
+  [4],
+  [5, 6, [7], [8, [9, [10]]]],
+  11,
+  12,
+  13,
+  [14, [[[[[15, [16]]]]]]],
+  17,
+  18,
+  [19, [20, [21, [22, [23, [24, [[[[[25]]]]]]]]]]],
+];
+
+console.log(flattenArray(input, 2));
diff --git a/Snippets/Arrays/groupBy.js b/Snippets/Arrays/groupBy.js
new file mode 100644
index 0000000..d4d0731
--- /dev/null
+++ b/Snippets/Arrays/groupBy.js
@@ -0,0 +1,125 @@
+const arr = [6.1, 2.4, 2.7, 6.8];
+
+function groupBy(arr, property) {
+  const groupByString = (arr, query) => {
+    let res = {};
+
+    arr.forEach((item, index) => {
+      const queryList = query.split(".");
+
+      let currKey;
+      let currItem = item;
+      let count = 0;
+      for (let i = 0; i < queryList.length; i++) {
+        currKey = queryList[i];
+        if (!currItem[currKey]) {
+          break;
+        } else {
+          count += 1;
+          currItem = currItem[currKey];
+        }
+      }
+
+      if (count !== queryList.length) {
+        currItem = undefined;
+      }
+      if (!res[currItem]) {
+        res[currItem] = [item];
+      } else {
+        res[currItem].push(item);
+      }
+    });
+    return res;
+  };
+  const groupByCallback = (arr, cb) => {
+    let res = {};
+    arr.forEach((item) => {
+      const ans = cb.call(null, item);
+
+      if (Object.keys(res).includes(ans.toString())) {
+        res[ans].push(item);
+      } else {
+        res[ans] = [item];
+      }
+    });
+    return res;
+  };
+
+  let res;
+  switch (typeof property) {
+    case "function":
+      res = groupByCallback(arr, property);
+      break;
+    case "string":
+      res = groupByString(arr, property);
+      break;
+    default:
+      return new Error("Invalid Property Type");
+  }
+
+  return res;
+}
+
+// groupBy(arr, Math.floor);
+console.log(groupBy(arr, Math.ceil));
+console.log(groupBy([6.1, 4.2, 6.3], Math.floor));
+console.log(groupBy(["one", "two", "three"], "length"));
+console.log(
+  groupBy(
+    [{ a: { b: { c: 1 } } }, { a: { b: { c: 1 } } }, { a: { b: { c: 2 } } }],
+    "b.a.c"
+  )
+);
+
+console.log(
+  groupBy(
+    [{ a: { b: { c: 1 } } }, { a: { b: { c: 1 } } }, { a: { b: { c: 2 } } }],
+    "a.b.c"
+  )
+);
+
+// alternate solution
+function groupByAlternative(collection, property) {
+  const output = {};
+
+  if (!collection || typeof collection !== "object") {
+    return output;
+  }
+
+  const isPropertyFunction = typeof property === "function";
+  const isPropertyPath = typeof property === "string";
+
+  for (const value of Object.values(collection)) {
+    let current = undefined;
+
+    if (isPropertyFunction) {
+      current = property(value);
+    } else if (isPropertyPath) {
+      // a.b.c -> [a, b, c];
+      const path = property.split(".");
+      let i;
+      let currentKey;
+      let currentItem = value; // { a: { b: { c: 1 } } }
+
+      for (i = 0; i < path.length; i++) {
+        // [a, b, c] -> currentKey: path[0] -> a
+        // [a, b, c] -> currentKey: path[1] -> b
+        // [a, b, c] -> currentKey: path[2] -> c
+        currentKey = path[i];
+
+        if (!currentItem[currentKey]) {
+          currentItem = undefined;
+          break;
+        }
+        currentItem = currentItem[currentKey];
+      }
+
+      current = currentItem;
+    }
+
+    output[current] = output[current] || [];
+    output[current].push(value);
+  }
+
+  return output;
+}
diff --git a/Snippets/Arrays/mapPolyfill.js b/Snippets/Arrays/mapPolyfill.js
new file mode 100644
index 0000000..4caf00c
--- /dev/null
+++ b/Snippets/Arrays/mapPolyfill.js
@@ -0,0 +1,12 @@
+Array.prototype.myMap = myMap;
+
+function myMap(cb) {
+  const newArr = [];
+  for (let i = 0; i < this.length; i++) {
+    newArr.push(cb(this[i]));
+  }
+  return newArr;
+}
+const arr = [1, 2, 3, 4, 5];
+
+console.log(arr.myMap((item) => item + 2));
diff --git a/Snippets/Arrays/pushPolyfill.js b/Snippets/Arrays/pushPolyfill.js
new file mode 100644
index 0000000..ce9c9e2
--- /dev/null
+++ b/Snippets/Arrays/pushPolyfill.js
@@ -0,0 +1,9 @@
+Array.prototype.myPush = myPush;
+
+function myPush(item) {
+  this[this.length] = item;
+  return this;
+}
+const arr = [1, 2, 3];
+arr.myPush(2).push(2); // chaining possible
+console.log(arr);
diff --git a/Snippets/Arrays/reducePolyfill.js b/Snippets/Arrays/reducePolyfill.js
new file mode 100644
index 0000000..ede890b
--- /dev/null
+++ b/Snippets/Arrays/reducePolyfill.js
@@ -0,0 +1,17 @@
+Array.prototype.myReduce = myReduce;
+
+function myReduce(cb, initialValue = this[0]) {
+  let result = initialValue;
+  this.forEach((item) => {
+    result = cb(result, item);
+  });
+  return result;
+}
+
+const array1 = [1, 2, 3, 4];
+const sumWithInitial = array1.myReduce(
+  (previousValue, currentValue) => previousValue + currentValue,
+  0
+);
+
+console.log(sumWithInitial);
diff --git a/Snippets/Arrays/removeDuplicates.js b/Snippets/Arrays/removeDuplicates.js
new file mode 100644
index 0000000..a493295
--- /dev/null
+++ b/Snippets/Arrays/removeDuplicates.js
@@ -0,0 +1,16 @@
+const arr = [1, 2, 2, 3];
+
+const updatedArrWithSet = [...new Set(arr)];
+
+const updatedArrWithFilter = arr.filter((c, index) => {
+  return index !== arr.indexOf(c);
+});
+
+const updatedArrWithIncludes = [];
+arr.forEach((c) => {
+  if (!updatedArrWithIncludes.includes(c)) {
+    updatedArrWithIncludes.push(c);
+  }
+});
+
+console.log(updatedArrWithIncludes);
diff --git a/Snippets/Arrays/unshiftPolyfill.js b/Snippets/Arrays/unshiftPolyfill.js
new file mode 100644
index 0000000..dfa1f65
--- /dev/null
+++ b/Snippets/Arrays/unshiftPolyfill.js
@@ -0,0 +1,19 @@
+Array.prototype.myUnshift = myUnshift;
+
+function myUnshift(item) {
+  let prevItem = item;
+  const originalLength = this.length;
+  for (let i = 0; i <= originalLength; i++) {
+    let temp = this[i];
+    this[i] = prevItem;
+    prevItem = temp;
+  }
+  return this;
+}
+
+const arr = [1, 2, 3, 4];
+arr
+  .myUnshift(2)
+  .myUnshift(100)
+  .myUnshift(() => console.log("WOW"));
+console.log(arr);
diff --git a/Snippets/Closures/armyOfFunctions.js b/Snippets/Closures/armyOfFunctions.js
new file mode 100644
index 0000000..9157e9a
--- /dev/null
+++ b/Snippets/Closures/armyOfFunctions.js
@@ -0,0 +1,23 @@
+function makeArmy() {
+  let shooters = [];
+
+  let i = 0;
+  while (i < 10) {
+    // we can use for loop with let i to avoid the problem
+    let a = i; // avoid the closure problem of referencing same variable
+    let shooter = function () {
+      // create a shooter function,
+      console.log(a); // that should show its number
+    };
+    shooters.push(shooter); // and add it to the array
+    i++;
+  }
+
+  // ...and return the array of shooters
+  return shooters;
+}
+
+let army = makeArmy();
+
+army[1]();
+army[9]();
diff --git a/Snippets/Closures/filterThroughFunction.js b/Snippets/Closures/filterThroughFunction.js
new file mode 100644
index 0000000..00a02c4
--- /dev/null
+++ b/Snippets/Closures/filterThroughFunction.js
@@ -0,0 +1,18 @@
+const inBetween = (left, right) => {
+  return function (x) {
+    return x >= left && x <= right;
+  };
+};
+
+const inArray = (arr) => {
+  return function (x) {
+    return arr.includes(x);
+  };
+};
+
+let arr = [1, 2, 3, 4, 5, 6, 7];
+
+console.log(arr.filter(inBetween(3, 6)));
+// or console.log(arr.filter((item) => inBetween(3, 6)(item)));
+
+console.log(arr.filter(inArray([1, 2, 10])));
diff --git a/Snippets/Closures/makeCounter.js b/Snippets/Closures/makeCounter.js
new file mode 100644
index 0000000..1ae6657
--- /dev/null
+++ b/Snippets/Closures/makeCounter.js
@@ -0,0 +1,17 @@
+function makeCounter() {
+  let count = 0;
+
+  return function () {
+    return ++count;
+  };
+}
+
+let counter = makeCounter();
+
+counter();
+counter();
+counter();
+
+const count = counter();
+
+console.log(count);
diff --git a/Snippets/Closures/sortByFields.js b/Snippets/Closures/sortByFields.js
new file mode 100644
index 0000000..f299a4c
--- /dev/null
+++ b/Snippets/Closures/sortByFields.js
@@ -0,0 +1,18 @@
+let users = [
+  { name: "John", age: 20, surname: "Johnson" },
+  { name: "Pete", age: 18, surname: "Peterson" },
+  { name: "Ann", age: 19, surname: "Hathaway" },
+];
+
+// Normal Approach will be
+//users.sort((a, b) => (a.name > b.name ? 1 : -1));
+//users.sort((a, b) => (a.age > b.age ? 1 : -1));
+
+// cleaner way
+const byField = (fieldName) => {
+  return function (x, y) {
+    return x[fieldName] > y[fieldName] ? 1 : -1;
+  };
+};
+
+console.log(users.sort(byField("age")));
diff --git a/Snippets/Currying/advancedCurryImplementation.js b/Snippets/Currying/advancedCurryImplementation.js
new file mode 100644
index 0000000..a8debcf
--- /dev/null
+++ b/Snippets/Currying/advancedCurryImplementation.js
@@ -0,0 +1,33 @@
+function sum(a, b, c) {
+  return a + b + c;
+}
+
+// function curry(fn) {
+//   return function curried(...args) {
+//     if (args.length >= fn.length) {
+//       return fn.apply(this, args);
+//     } else {
+//       return function (...args2) {
+//         return curried.apply(this, args.concat(args2));
+//       };
+//     }
+//   };
+// }
+
+function curry(func) {
+  return function curried(...args) {
+    if (args.length >= func.length) {
+      return func.apply(this, args);
+    } else {
+      return function (...args2) {
+        return curried.apply(this, args.concat(args2));
+      };
+    }
+  };
+}
+
+let curriedSum = curry(sum);
+
+console.log(curriedSum(1, 2, 3)); // 6, still callable normally
+console.log(curriedSum(1)(2, 3)); // 6, currying of 1st arg
+console.log(curriedSum(1)(2)(3));
diff --git a/Snippets/Currying/sumOfNNumbers.js b/Snippets/Currying/sumOfNNumbers.js
new file mode 100644
index 0000000..bdf2008
--- /dev/null
+++ b/Snippets/Currying/sumOfNNumbers.js
@@ -0,0 +1,11 @@
+let sum = function (a) {
+  return function (b) {
+    if (b) {
+      return sum(a + b);
+    }
+    return a;
+  };
+};
+
+const total = sum(1)(2)(3)();
+console.log(total);
diff --git a/Snippets/DataTypes/methodsOfPrimitives.js b/Snippets/DataTypes/methodsOfPrimitives.js
new file mode 100644
index 0000000..e69de29
diff --git a/Snippets/Functional_Programming/arrayLength.js b/Snippets/FunctionalProgramming/General/arrayLength.js
similarity index 88%
rename from Snippets/Functional_Programming/arrayLength.js
rename to Snippets/FunctionalProgramming/General/arrayLength.js
index bc17b1a..b1fd1e6 100644
--- a/Snippets/Functional_Programming/arrayLength.js
+++ b/Snippets/FunctionalProgramming/General/arrayLength.js
@@ -1,3 +1,5 @@
+// finds array length
+
 function arrayLength(arr){
     let len = 0;
     while(arr[len] !== undefined){
diff --git a/Snippets/Functional_Programming/charAt.js b/Snippets/FunctionalProgramming/General/charAt.js
similarity index 100%
rename from Snippets/Functional_Programming/charAt.js
rename to Snippets/FunctionalProgramming/General/charAt.js
diff --git a/Snippets/Functional_Programming/findMax.js b/Snippets/FunctionalProgramming/General/findMax.js
similarity index 100%
rename from Snippets/Functional_Programming/findMax.js
rename to Snippets/FunctionalProgramming/General/findMax.js
diff --git a/Snippets/Functional_Programming/findMin.js b/Snippets/FunctionalProgramming/General/findMin.js
similarity index 100%
rename from Snippets/Functional_Programming/findMin.js
rename to Snippets/FunctionalProgramming/General/findMin.js
diff --git a/Snippets/Functional_Programming/hexagonArea.js b/Snippets/FunctionalProgramming/General/hexagonArea.js
similarity index 100%
rename from Snippets/Functional_Programming/hexagonArea.js
rename to Snippets/FunctionalProgramming/General/hexagonArea.js
diff --git a/Snippets/Functional_Programming/indexOf.js b/Snippets/FunctionalProgramming/General/indexOf.js
similarity index 100%
rename from Snippets/Functional_Programming/indexOf.js
rename to Snippets/FunctionalProgramming/General/indexOf.js
diff --git a/Snippets/Functional_Programming/mergeArray.js b/Snippets/FunctionalProgramming/General/mergeArray.js
similarity index 100%
rename from Snippets/Functional_Programming/mergeArray.js
rename to Snippets/FunctionalProgramming/General/mergeArray.js
diff --git a/Snippets/Functional_Programming/minDate.js b/Snippets/FunctionalProgramming/General/minDate.js
similarity index 100%
rename from Snippets/Functional_Programming/minDate.js
rename to Snippets/FunctionalProgramming/General/minDate.js
diff --git a/Snippets/Functional_Programming/power.js b/Snippets/FunctionalProgramming/General/power.js
similarity index 100%
rename from Snippets/Functional_Programming/power.js
rename to Snippets/FunctionalProgramming/General/power.js
diff --git a/Snippets/Functional_Programming/replace.js b/Snippets/FunctionalProgramming/General/replace.js
similarity index 100%
rename from Snippets/Functional_Programming/replace.js
rename to Snippets/FunctionalProgramming/General/replace.js
diff --git a/Snippets/Functional_Programming/reverseWords.js b/Snippets/FunctionalProgramming/General/reverseWords.js
similarity index 100%
rename from Snippets/Functional_Programming/reverseWords.js
rename to Snippets/FunctionalProgramming/General/reverseWords.js
diff --git a/Snippets/Functional_Programming/secretCode.js b/Snippets/FunctionalProgramming/General/secretCode.js
similarity index 100%
rename from Snippets/Functional_Programming/secretCode.js
rename to Snippets/FunctionalProgramming/General/secretCode.js
diff --git a/Snippets/Functional_Programming/toSentenceCase.js b/Snippets/FunctionalProgramming/General/toSentenceCase.js
similarity index 100%
rename from Snippets/Functional_Programming/toSentenceCase.js
rename to Snippets/FunctionalProgramming/General/toSentenceCase.js
diff --git a/Snippets/Functional_Programming/triangleType.js b/Snippets/FunctionalProgramming/General/triangleType.js
similarity index 100%
rename from Snippets/Functional_Programming/triangleType.js
rename to Snippets/FunctionalProgramming/General/triangleType.js
diff --git a/Snippets/Functional_Programming/wordCounter.js b/Snippets/FunctionalProgramming/General/wordCounter.js
similarity index 100%
rename from Snippets/Functional_Programming/wordCounter.js
rename to Snippets/FunctionalProgramming/General/wordCounter.js
diff --git a/Snippets/FunctionalProgramming/HigherOrderFunctions/README.md b/Snippets/FunctionalProgramming/HigherOrderFunctions/README.md
new file mode 100644
index 0000000..d4daf81
--- /dev/null
+++ b/Snippets/FunctionalProgramming/HigherOrderFunctions/README.md
@@ -0,0 +1,3 @@
+# The One
+
+Write a function `compose()` that can take any number of arguments of functions and return a function which will run the given functions in order when called an argument.
\ No newline at end of file
diff --git a/Snippets/FunctionalProgramming/HigherOrderFunctions/TheOne.js b/Snippets/FunctionalProgramming/HigherOrderFunctions/TheOne.js
new file mode 100644
index 0000000..50e8b1c
--- /dev/null
+++ b/Snippets/FunctionalProgramming/HigherOrderFunctions/TheOne.js
@@ -0,0 +1,13 @@
+// Composing functions
+const increment = (n) => n + 1;
+const square = (n) => n * n;
+const cube = (n) => n*n*n
+
+// Compose Util Function
+function compose(...args){
+    return (num) => args.reduce((acc, cur) => cur(acc), num);
+}
+
+// Main
+const incrementThenSquareThenCube = compose(increment, square, cube);
+console.log(incrementThenSquareThenCube(5));
\ No newline at end of file
diff --git a/Snippets/Functions/bind.js b/Snippets/Functions/bind.js
new file mode 100644
index 0000000..001aa36
--- /dev/null
+++ b/Snippets/Functions/bind.js
@@ -0,0 +1,21 @@
+let user = {
+  firstName: "John",
+  sayHi() {
+    alert(`Hello, ${this.firstName}!`);
+  },
+};
+
+let sayHi = user.sayHi.bind(user); // (*)
+
+// can run it without an object
+sayHi(); // Hello, John!
+
+setTimeout(sayHi, 1000); // Hello, John!
+
+// even if the value of user changes within 1 second
+// sayHi uses the pre-bound value which is reference to the old user object
+user = {
+  sayHi() {
+    alert("Another user in setTimeout!");
+  },
+};
diff --git a/Snippets/Functions/bindAll.js b/Snippets/Functions/bindAll.js
new file mode 100644
index 0000000..8d1acf2
--- /dev/null
+++ b/Snippets/Functions/bindAll.js
@@ -0,0 +1,19 @@
+// If an object has many methods and we plan to actively pass it around, then we could bind them all in a loop
+
+const user = {
+  func1() {
+    console.log("func 1");
+  },
+  func2() {
+    console.log("func 2");
+  },
+  func3() {
+    console.log("func 3");
+  },
+};
+
+for (let key in user) {
+  if (typeof user[key] == "function") {
+    user[key] = user[key].bind(user);
+  }
+}
diff --git a/Snippets/Functions/boundFunctionMethod.js b/Snippets/Functions/boundFunctionMethod.js
new file mode 100644
index 0000000..4e2d792
--- /dev/null
+++ b/Snippets/Functions/boundFunctionMethod.js
@@ -0,0 +1,11 @@
+"use strict";
+function f() {
+  console.log(this); // null
+}
+
+let user = {
+  g: f.bind(null),
+};
+
+// f();
+user.g();
diff --git a/Snippets/Functions/call.js b/Snippets/Functions/call.js
new file mode 100644
index 0000000..76fc2eb
--- /dev/null
+++ b/Snippets/Functions/call.js
@@ -0,0 +1,27 @@
+"use strict";
+let worker = {
+  someMethod() {
+    return 1;
+  },
+  slow(x) {
+    console.log("Called with", x);
+    return x + this.someMethod(); // need a reference for this
+  },
+};
+
+function cachingDecorator(func) {
+  const cache = new Map();
+  return function (x) {
+    if (cache.has(x)) {
+      return cache.get(x);
+    }
+    const res = func.call(this, x);
+    cache.set(x, res);
+    return res;
+  };
+}
+
+worker.slow = cachingDecorator(worker.slow); // now make it caching
+
+console.log(worker.slow(2)); // works
+console.log(worker.slow(2)); // works, doesn't call the original (cached)
diff --git a/Snippets/Functions/customSetInterval.js b/Snippets/Functions/customSetInterval.js
new file mode 100644
index 0000000..a3a7080
--- /dev/null
+++ b/Snippets/Functions/customSetInterval.js
@@ -0,0 +1,15 @@
+const mySetInterval = (callback, delay, ...args) => {
+  let timerId = setTimeout(
+    function tick(...args) {
+      callback(...args);
+      timerId = setTimeout(tick, delay, ...args);
+    },
+    delay,
+    ...args
+  );
+};
+
+function cb(x, y) {
+  console.log(x, y);
+}
+mySetInterval(cb, 2000, 1, 2);
diff --git a/Snippets/Functions/debounceDecorator.js b/Snippets/Functions/debounceDecorator.js
new file mode 100644
index 0000000..a3381c4
--- /dev/null
+++ b/Snippets/Functions/debounceDecorator.js
@@ -0,0 +1,18 @@
+function debounce(func, delay) {
+  let timeout;
+  return function (...args) {
+    if (timeout) {
+      clearTimeout(timeout);
+    }
+    timeout = setTimeout(() => {
+      func(...args);
+      // func.apply(this, args)
+    }, delay);
+  };
+}
+
+let f = debounce(console.log, 2000);
+
+f("a");
+setTimeout(() => f("b"), 200);
+setTimeout(() => f("c"), 500);
diff --git a/Snippets/Functions/delayDecorator.js b/Snippets/Functions/delayDecorator.js
new file mode 100644
index 0000000..ba21328
--- /dev/null
+++ b/Snippets/Functions/delayDecorator.js
@@ -0,0 +1,18 @@
+function f(x) {
+  console.log(x);
+}
+
+function delay(func, delay) {
+  return function (...args) {
+    setTimeout(() => {
+      func.call(this, ...args);
+    }, delay);
+  };
+}
+
+// create wrappers
+let f1000 = delay(f, 1000);
+let f1500 = delay(f, 1500);
+
+f1000("test"); // shows "test" after 1000ms
+f1500("test"); // shows "test" after 1500ms
diff --git a/Snippets/Functions/fixFunctionThis.js b/Snippets/Functions/fixFunctionThis.js
new file mode 100644
index 0000000..4c12b1e
--- /dev/null
+++ b/Snippets/Functions/fixFunctionThis.js
@@ -0,0 +1,21 @@
+function askPassword(ok, fail) {
+  let password = "rockstar";
+  if (password == "rockstar") ok();
+  else fail();
+}
+
+let user = {
+  name: "John",
+
+  loginOk() {
+    console.log(`${this.name} logged in`);
+  },
+
+  loginFail() {
+    console.log(`${this.name} failed to log in`);
+  },
+};
+
+askPassword(user.loginOk.bind(user), user.loginFail.bind(user));
+
+// askPassword(() => user.loginOk(), () => user.loginFail());
diff --git a/Snippets/Functions/globalPartialFunctions.js b/Snippets/Functions/globalPartialFunctions.js
new file mode 100644
index 0000000..7df8409
--- /dev/null
+++ b/Snippets/Functions/globalPartialFunctions.js
@@ -0,0 +1,22 @@
+function partial(func, ...argsBound) {
+  return function (...args) {
+    // (*)
+    return func.call(this, ...argsBound, ...args);
+  };
+}
+
+// Usage:
+let user = {
+  firstName: "John",
+  say(time, phrase) {
+    alert(`[${time}] ${this.firstName}: ${phrase}!`);
+  },
+};
+
+// add a partial method with fixed time
+user.sayNow = partial(
+  user.say,
+  new Date().getHours() + ":" + new Date().getMinutes()
+);
+
+user.sayNow("Hello");
diff --git a/Snippets/Functions/makeCounter.js b/Snippets/Functions/makeCounter.js
new file mode 100644
index 0000000..1d90f60
--- /dev/null
+++ b/Snippets/Functions/makeCounter.js
@@ -0,0 +1,24 @@
+const makeCounter = () => {
+  const counter = () => {
+    return counter.count++;
+  };
+  counter.set = (val) => {
+    counter.count = val;
+    return counter.count;
+  };
+
+  counter.decrease = () => {
+    counter.count--;
+    return counter.count;
+  };
+
+  counter.count = 0;
+
+  return counter;
+};
+
+const counter = makeCounter();
+
+console.log(counter());
+console.log(counter.set(10));
+console.log(counter.decrease());
diff --git a/Snippets/Functions/memoizeOne.js b/Snippets/Functions/memoizeOne.js
new file mode 100644
index 0000000..db4db13
--- /dev/null
+++ b/Snippets/Functions/memoizeOne.js
@@ -0,0 +1,38 @@
+/**
+ * Do not change the function name
+ **/
+
+function memoizeOne(fn, isEqual) {
+  let cache = {};
+
+  function hasher(args) {
+    return args.join(",");
+  }
+  return function (...args) {
+    const hash = hasher(args);
+    if (cache[hash]) {
+      return cache[hash];
+    }
+    cache = {};
+    const res = fn.apply(null, args);
+    cache[hash] = res;
+    return res;
+  };
+}
+
+function add(a, b) {
+  console.print("called");
+  return a + b;
+}
+
+function isEqual(a, b) {
+  if (a === b) {
+    return true;
+  }
+  return false;
+}
+const memoizeAdd = memoizeOne(add, isEqual);
+console.print(memoizeAdd(2, 3));
+console.print(memoizeAdd(2, 3));
+console.print(memoizeAdd(3, 4));
+console.print(memoizeAdd(5, 6));
diff --git a/Snippets/Functions/multiArgumentCaching.js b/Snippets/Functions/multiArgumentCaching.js
new file mode 100644
index 0000000..33618d6
--- /dev/null
+++ b/Snippets/Functions/multiArgumentCaching.js
@@ -0,0 +1,30 @@
+const worker = {
+  slow(min, max) {
+    console.log(`Called with ${min},${max}`);
+    return min + max;
+  },
+};
+
+function cachingDecorator(func, hash) {
+  const cache = new Map();
+  return function (...args) {
+    let key = hash(args);
+    if (cache.has(key)) {
+      return cache.get(key);
+    }
+    let res = func.apply(this, args);
+    // or let res = func.call(this, ...args)
+    cache.set(key, res);
+    return res;
+  };
+}
+
+function hash(args) {
+  // [].join.call(arguments)
+  return args.join();
+}
+
+worker.slow = cachingDecorator(worker.slow, hash);
+
+console.log(worker.slow(3, 5)); // works
+console.log("Again " + worker.slow(3, 5)); // same (cached)
diff --git a/Snippets/Functions/namedFunctionExpression.js b/Snippets/Functions/namedFunctionExpression.js
new file mode 100644
index 0000000..1adfb70
--- /dev/null
+++ b/Snippets/Functions/namedFunctionExpression.js
@@ -0,0 +1,12 @@
+let sayHi = function func(who) {
+  if (who) {
+    console.log(`Hello, ${who}`);
+  } else {
+    func("Guest"); // Error: sayHi is not a function
+  }
+};
+
+let welcome = sayHi;
+sayHi = null;
+
+welcome(); // Error, the nested sayHi call doesn't work any more!
diff --git a/Snippets/Functions/nestedSetTimeout.js b/Snippets/Functions/nestedSetTimeout.js
new file mode 100644
index 0000000..7bbe30d
--- /dev/null
+++ b/Snippets/Functions/nestedSetTimeout.js
@@ -0,0 +1,12 @@
+let delay = 5000;
+
+let timerId = setTimeout(function request() {
+  console.log("Send Request to server", delay);
+  if (true) {
+    // request failed due to server overload
+    // increase the interval to the next run
+    delay *= 2;
+  }
+
+  timerId = setTimeout(request, delay);
+}, delay);
diff --git a/Snippets/Functions/newFunctionSyntax.js b/Snippets/Functions/newFunctionSyntax.js
new file mode 100644
index 0000000..217d9e2
--- /dev/null
+++ b/Snippets/Functions/newFunctionSyntax.js
@@ -0,0 +1,7 @@
+let sum = new Function("a", "b", "return a + b");
+
+alert(sum(1, 2)); // 3
+
+let sayHi = new Function('alert("Hello")');
+
+sayHi(); // Hello
diff --git a/Snippets/Functions/outputEverySecond.js b/Snippets/Functions/outputEverySecond.js
new file mode 100644
index 0000000..50f4306
--- /dev/null
+++ b/Snippets/Functions/outputEverySecond.js
@@ -0,0 +1,50 @@
+function printNumbers(from, to) {
+  const timerId = setInterval(
+    function f(to) {
+      console.log(from);
+      if (to === from) {
+        clearInterval(timerId);
+      }
+      from = from + 1;
+    },
+    1000,
+    to
+  );
+}
+
+printNumbers(1, 10);
+
+// with nested setTimeout
+
+function printNumbers(from, to) {
+  let current = from;
+
+  setTimeout(function go() {
+    alert(current);
+    if (current < to) {
+      setTimeout(go, 1000);
+    }
+    current++;
+  }, 1000);
+}
+
+// usage:
+printNumbers(5, 10);
+
+// runs immediately
+function printNumbers(from, to) {
+  let current = from;
+
+  function go() {
+    alert(current);
+    if (current == to) {
+      clearInterval(timerId);
+    }
+    current++;
+  }
+
+  go();
+  let timerId = setInterval(go, 1000);
+}
+
+printNumbers(5, 10);
diff --git a/Snippets/Functions/partialFunctions.js b/Snippets/Functions/partialFunctions.js
new file mode 100644
index 0000000..fd674d6
--- /dev/null
+++ b/Snippets/Functions/partialFunctions.js
@@ -0,0 +1,22 @@
+function mul(a, b) {
+  return a * b;
+}
+
+const triple = mul.bind(null, 3); // alternative to this is to curry functions
+
+console.log(triple(4));
+
+const user = {
+  firstName: "Samyak Shah",
+};
+function send(from, text, to) {
+  return `
+    By: ${from}
+    To: ${to}
+    Message:
+    ${text}, ${this.firstName}`;
+}
+
+const sendTo = send.bind(user, "soham@invact.com");
+
+console.log(sendTo("Hello World", "samyak@neog.com"));
diff --git a/Snippets/Functions/partialLogin.js b/Snippets/Functions/partialLogin.js
new file mode 100644
index 0000000..216436d
--- /dev/null
+++ b/Snippets/Functions/partialLogin.js
@@ -0,0 +1,15 @@
+function askPassword(ok, fail) {
+  let password = prompt("Password?", "");
+  if (password == "rockstar") ok();
+  else fail();
+}
+
+let user = {
+  name: "John",
+
+  login(result) {
+    alert(this.name + (result ? " logged in" : " failed to log in"));
+  },
+};
+
+askPassword(user.login.bind(user, true), user.login.bind(user, false)); // ?
diff --git a/Snippets/Functions/polymorphism.js b/Snippets/Functions/polymorphism.js
new file mode 100644
index 0000000..a218e64
--- /dev/null
+++ b/Snippets/Functions/polymorphism.js
@@ -0,0 +1,19 @@
+function ask(question, ...handlers) {
+  let isYes = confirm(question);
+
+  for (let handler of handlers) {
+    if (handler.length == 0) {
+      if (isYes) handler();
+    } else {
+      handler(isYes);
+    }
+  }
+}
+
+// for positive answer, both handlers are called
+// for negative answer, only the second one
+ask(
+  "Question?",
+  () => alert("You said yes"),
+  (result) => alert(result)
+);
diff --git a/Snippets/Functions/properties.js b/Snippets/Functions/properties.js
new file mode 100644
index 0000000..3ebcb14
--- /dev/null
+++ b/Snippets/Functions/properties.js
@@ -0,0 +1,48 @@
+function sayHi() {
+  console.log("Hi");
+}
+
+console.log(sayHi.name);
+console.log(function () {}.name); // empty string
+
+function f1(a) {}
+function f2(a, b) {}
+function many(a, b, ...more) {}
+
+console.log(f1.length); // 1
+console.log(f2.length); // 2
+console.log(many.length); // 2
+
+// custom property
+
+function sayHi() {
+  console.log("Hi");
+
+  // let's count how many times we run
+  sayHi.counter++;
+}
+sayHi.counter = 0; // initial value
+
+sayHi(); // Hi
+sayHi(); // Hi
+
+console.log(`Called ${sayHi.counter} times`); // Called 2 times
+
+// counter with custom property
+
+function makeCounter() {
+  // instead of:
+  // let count = 0
+
+  function counter() {
+    return counter.count++;
+  }
+
+  counter.count = 0;
+
+  return counter;
+}
+
+let counter = makeCounter();
+alert(counter()); // 0
+alert(counter()); // 1
diff --git a/Snippets/Functions/secondBind.js b/Snippets/Functions/secondBind.js
new file mode 100644
index 0000000..4684187
--- /dev/null
+++ b/Snippets/Functions/secondBind.js
@@ -0,0 +1,10 @@
+// A function cannot be re-bound
+function f() {
+  console.log(this.name);
+}
+
+f = f.bind({ name: "John" });
+z = f.bind({ name: "Ann" });
+
+f(); // John
+z(); // John
diff --git a/Snippets/Functions/setInterval.js b/Snippets/Functions/setInterval.js
new file mode 100644
index 0000000..40e0b84
--- /dev/null
+++ b/Snippets/Functions/setInterval.js
@@ -0,0 +1,4 @@
+// let timerId = setInterval(func|code, [delay], [arg1], [arg2], ...)
+
+// repeat with the interval of 2 seconds
+let timerId = setInterval(() => alert("tick"), 2000);
diff --git a/Snippets/Functions/setTimeout.js b/Snippets/Functions/setTimeout.js
new file mode 100644
index 0000000..7983b60
--- /dev/null
+++ b/Snippets/Functions/setTimeout.js
@@ -0,0 +1,20 @@
+// let timerId = setTimeout(func|code, [delay], [arg1], [arg2], ...)
+
+function sayHi(phrase, who) {
+  alert(phrase + ", " + who);
+}
+
+setTimeout(sayHi, 1000, "Hello", "John"); // Hello, John
+
+// string also works
+setTimeout("alert('Hello')", 1000);
+
+// recommended
+setTimeout(() => alert("Hello"), 1000);
+
+// wrong!
+setTimeout(sayHi(), 1000);
+
+// clear timeout
+let timerId = setTimeout(() => alert("Hi"));
+clearTimeout(timerId);
diff --git a/Snippets/Functions/spyDecorator.js b/Snippets/Functions/spyDecorator.js
new file mode 100644
index 0000000..0d769cd
--- /dev/null
+++ b/Snippets/Functions/spyDecorator.js
@@ -0,0 +1,29 @@
+function work(a, b) {
+  console.log(a + b); // work is an arbitrary function or method
+}
+
+function spy(func) {
+  wrapper.calls = [];
+  function wrapper(...args) {
+    const key = hash(args);
+    func.call(this, ...args);
+    wrapper.calls.push(key);
+  }
+
+  return wrapper;
+}
+
+const hash = (args) => {
+  return args.join();
+};
+
+work = spy(work);
+
+work(1, 2); // 3
+work(4, 5); // 9
+
+console.log(work);
+
+for (let args of work.calls) {
+  console.log("call:" + args); // "call:1,2", "call:4,5"
+}
diff --git a/Snippets/Functions/sumWithArbitaryAmountOfBrackets.js b/Snippets/Functions/sumWithArbitaryAmountOfBrackets.js
new file mode 100644
index 0000000..5ce5198
--- /dev/null
+++ b/Snippets/Functions/sumWithArbitaryAmountOfBrackets.js
@@ -0,0 +1,32 @@
+const sum = (x) => {
+  let total = x;
+  return function by(y) {
+    if (y === undefined) {
+      return total;
+    } else {
+      total += y;
+      return by;
+    }
+  };
+};
+
+console.log(sum(1)(2)(5)());
+
+// But what if we need exactly like this: sum(1)(2)(5) for the result
+function sum(a) {
+  let currentSum = a;
+
+  function f(b) {
+    currentSum += b;
+    return f;
+  }
+
+  f.toString = function () {
+    return currentSum;
+  };
+
+  return f;
+}
+
+const val = sum(1)(8); // 3
+alert(val); // alert calls val.toString(). We can modify this function for our use case
diff --git a/Snippets/Functions/throttleDecorator.js b/Snippets/Functions/throttleDecorator.js
new file mode 100644
index 0000000..fbc0daf
--- /dev/null
+++ b/Snippets/Functions/throttleDecorator.js
@@ -0,0 +1,19 @@
+function throttle(func, delay) {
+  let flag = true;
+  return function (...args) {
+    if (flag) {
+      flag = false;
+      setTimeout(() => {
+        func.apply(this, args);
+        flag = true;
+      });
+    }
+  };
+}
+
+const f = (text) => {
+  console.log(text);
+};
+
+const f1000 = throttle(f, 1000);
+f1000("Hi I am 1000s throttle function");
diff --git a/Snippets/Functions/timeBomb.js b/Snippets/Functions/timeBomb.js
new file mode 100644
index 0000000..f72451a
--- /dev/null
+++ b/Snippets/Functions/timeBomb.js
@@ -0,0 +1,10 @@
+// 5,4,3,2,1, Bang!
+
+function timeBomb(i) {
+  return i === 0 ? "Bang" : i;
+}
+for (let i = 5; i >= 0; i--) {
+  setTimeout(() => {
+    console.log(timeBomb(i));
+  }, [(5 - i) * 1000]);
+}
diff --git a/Snippets/Functions/transparentCaching.js b/Snippets/Functions/transparentCaching.js
new file mode 100644
index 0000000..ef3f4a2
--- /dev/null
+++ b/Snippets/Functions/transparentCaching.js
@@ -0,0 +1,26 @@
+const delay = (data, ms) => {
+  setTimeout(() => console.log("computing", data), ms);
+};
+let slow = async (x) => {
+  await delay(x, 3000);
+  return x;
+};
+
+const cachingDecorator = (func) => {
+  const cache = new Map();
+  return function (x) {
+    if (cache.has(x)) {
+      return cache.get(x);
+    }
+    const res = func(x);
+    cache.set(x, res);
+    return res;
+  };
+};
+
+slow = cachingDecorator(slow);
+
+slow(4).then(slow(5)).then(slow(4));
+
+console.log(await slow(5));
+console.log(await slow(4));
diff --git a/Snippets/Objects/accumulator.js b/Snippets/Objects/accumulator.js
new file mode 100644
index 0000000..5b5098b
--- /dev/null
+++ b/Snippets/Objects/accumulator.js
@@ -0,0 +1,13 @@
+function Accumulator(initValue) {
+  this.value = initValue;
+  this.read = (payload) => {
+    this.value += payload;
+  };
+}
+
+let accumulator = new Accumulator(1); // initial value 1
+
+accumulator.read(1);
+accumulator.read(8);
+
+console.log(accumulator.value);
diff --git a/Snippets/Objects/bindPolyFill.js b/Snippets/Objects/bindPolyFill.js
new file mode 100644
index 0000000..633ecd0
--- /dev/null
+++ b/Snippets/Objects/bindPolyFill.js
@@ -0,0 +1,18 @@
+Function.prototype.myBind = myBind;
+
+function myBind(context, ...args1) {
+  const newContext = this;
+  return function (...args2) {
+    newContext.apply(context, [...args1, ...args2]);
+  };
+}
+
+let user = {
+  firstName: "John",
+  sayHi(area, birthdate) {
+    console.log(`Hello, ${this.firstName} from ${area}, born on ${birthdate}!`);
+  },
+};
+
+let sayHi = user.sayHi.myBind(user, "Ahmedabad"); // (*)
+sayHi("26/06");
diff --git a/Snippets/Objects/calculator.js b/Snippets/Objects/calculator.js
new file mode 100644
index 0000000..fc4fb44
--- /dev/null
+++ b/Snippets/Objects/calculator.js
@@ -0,0 +1,90 @@
+class Calculator {
+  constructor(a, b) {
+    this.a = a;
+    this.b = b;
+  }
+
+  sum() {
+    console.log(this.a);
+    console.log(this.a + this.b);
+    return this;
+  }
+
+  mul() {
+    console.log(this.a * this.b);
+    return this;
+  }
+}
+
+const calculator = new Calculator(1, 2);
+calculator.sum();
+calculator.mul();
+
+// alternate way
+
+function Calc(a, b) {
+  this.a = a;
+  this.b = b;
+
+  this.sum = () => {
+    return this.a + this.b;
+  };
+  this.mul = () => {
+    return this.a * this.b;
+  };
+}
+
+const calc = new Calc(5, 2);
+console.log(calc.sum());
+console.log(calc.mul());
+
+// approach 2: with chaining
+
+function Calculator(initialValue) {
+  this.total = initialValue;
+  this.sum = function (a) {
+    this.total += a;
+    return this;
+  };
+  this.sub = function (a) {
+    this.total -= a;
+    return this;
+  };
+  this.misc = function (cb) {
+    this.total = cb(this.total);
+    return this;
+  };
+  this.val = function () {
+    return this.total;
+  };
+}
+
+const cal = new Calculator(2);
+console.print(
+  cal
+    .sum(2)
+    .misc((val) => val + 100)
+    .val()
+);
+
+// approach 3: using functions
+
+function cal(initialValue) {
+  let total = initialValue;
+
+  function add(a) {
+    total += a;
+    return cal(total);
+  }
+
+  function val() {
+    return total;
+  }
+
+  return {
+    add,
+    val,
+  };
+}
+
+console.print(cal(2).add(2).add(2).val());
diff --git a/Snippets/Objects/cloneObject.js b/Snippets/Objects/cloneObject.js
new file mode 100644
index 0000000..093088c
--- /dev/null
+++ b/Snippets/Objects/cloneObject.js
@@ -0,0 +1,40 @@
+// using copying properties
+
+let user = {
+  name: "John",
+  age: 30,
+};
+
+let clone = {}; // the new empty object
+
+// let's copy all user properties into it
+for (let key in user) {
+  clone[key] = user[key];
+}
+
+// now clone is a fully independent object with the same content
+clone.name = "Pete"; // changed the data in it
+
+console.log(user.name); // still John in the original object
+
+// Using Object.assign
+
+let permissions1 = { canView: true };
+let permissions2 = { canEdit: true };
+
+// copies all properties from permissions1 and permissions2 into user
+Object.assign(user, permissions1, permissions2);
+
+// now user = { name: "John", canView: true, canEdit: true }
+
+Object.assign(user, { name: "Pete" });
+
+console.log(user.name); // now user = { name: "Pete" }
+
+let clone2 = Object.assign({}, user); // shallow copy
+
+console.log(clone2);
+
+// clone in a different way
+
+let clone = Object.defineProperties({}, Object.getOwnPropertyDescriptors(obj));
diff --git a/Snippets/Objects/colorUtils.js b/Snippets/Objects/colorUtils.js
new file mode 100644
index 0000000..13ca9d4
--- /dev/null
+++ b/Snippets/Objects/colorUtils.js
@@ -0,0 +1,103 @@
+class ColorUtils {
+  constructor(r, g, b) {
+    this.r = r;
+    this.g = g;
+    this.b = b;
+  }
+
+  getRGB() {
+    return `rgb(${this.r}, ${this.g}, ${this.b})`;
+  }
+
+  getHSL() {
+    const hsl = this.rgbToHsl(this.r, this.g, this.b);
+    return `hsl(${hsl[0]}, ${hsl[1]}%, ${hsl[2]}%)`;
+  }
+
+  getHexCode() {
+    return `#${this.componentToHex(this.r)}${this.componentToHex(
+      this.g
+    )}${this.componentToHex(this.b)}`;
+  }
+
+  getOppositeColor() {
+    return new ColorUtils(255 - this.r, 255 - this.g, 255 - this.b);
+  }
+
+  brightenColor(percent) {
+    const factor = 1 + percent / 100;
+    const brightenedR = this.clamp(this.r * factor);
+    const brightenedG = this.clamp(this.g * factor);
+    const brightenedB = this.clamp(this.b * factor);
+    return new ColorUtils(brightenedR, brightenedG, brightenedB);
+  }
+
+  lightenColor(percent) {
+    const factor = 1 + percent / 100;
+    const lightenedR = this.clamp(this.r + (255 - this.r) * (1 - factor));
+    const lightenedG = this.clamp(this.g + (255 - this.g) * (1 - factor));
+    const lightenedB = this.clamp(this.b + (255 - this.b) * (1 - factor));
+    return new ColorUtils(lightenedR, lightenedG, lightenedB);
+  }
+
+  rgbToHsl(r, g, b) {
+    r /= 255;
+    g /= 255;
+    b /= 255;
+    const max = Math.max(r, g, b);
+    const min = Math.min(r, g, b);
+    let h,
+      s,
+      l = (max + min) / 2;
+
+    if (max === min) {
+      h = s = 0; // achromatic
+    } else {
+      const d = max - min;
+      s = l > 0.5 ? d / (2 - max - min) : d / (max + min);
+      switch (max) {
+        case r:
+          h = (g - b) / d + (g < b ? 6 : 0);
+          break;
+        case g:
+          h = (b - r) / d + 2;
+          break;
+        case b:
+          h = (r - g) / d + 4;
+          break;
+      }
+      h /= 6;
+    }
+
+    h = Math.round(h * 360);
+    s = Math.round(s * 100);
+    l = Math.round(l * 100);
+
+    return [h, s, l];
+  }
+
+  componentToHex(c) {
+    const hex = c.toString(16);
+    return hex.length === 1 ? "0" + hex : hex;
+  }
+
+  clamp(value) {
+    return Math.min(255, Math.max(0, value));
+  }
+}
+
+// Example usage:
+const color = new ColorUtils(100, 150, 200);
+
+console.log(color.getRGB()); // "rgb(100, 150, 200)"
+console.log(color.getHSL()); // "hsl(210, 50%, 60%)"
+console.log(color.getHexCode()); // "#6496c8"
+
+const oppositeColor = color.getOppositeColor();
+console.log(oppositeColor.getRGB()); // "rgb(155, 105, 55)"
+
+const brightenedColor = color.brightenColor(20);
+console.log(brightenedColor.getRGB()); // "rgb(120, 180, 240)"
+
+const lightenedColor = color.lightenColor(20);
+console.log(lightenedColor.getRGB()); // "rgb(124, 172, 216)"
diff --git a/Snippets/Objects/computedProperties.js b/Snippets/Objects/computedProperties.js
new file mode 100644
index 0000000..424e15f
--- /dev/null
+++ b/Snippets/Objects/computedProperties.js
@@ -0,0 +1,12 @@
+const obj = {};
+
+for (let i = 0; i < 10; i++) {
+  obj[`field${i}`] = 1;
+}
+
+console.log(obj);
+
+let fruit = "apple";
+let bag = {
+  [fruit + "Computers"]: 5, // bag.appleComputers = 5
+};
diff --git a/Snippets/Objects/deepCopy.js b/Snippets/Objects/deepCopy.js
new file mode 100644
index 0000000..e335bce
--- /dev/null
+++ b/Snippets/Objects/deepCopy.js
@@ -0,0 +1,20 @@
+const x = { b: [{ a: [1, 2, 3], b: [4, 5, 6], c: [7, 8, 9] }] };
+const y = { b: [{ a: [1, 2, 3], b: [4, 5, 6], c: [7, 8, 9] }] };
+
+const z = deepCopy(x);
+
+function deepCopy(obj) {
+  let target = {};
+  const keys = Object.keys(obj);
+  keys.forEach((key) => {
+    if (typeof obj[key] === "object") {
+      target[key] = deepCopy(obj[key]);
+    } else {
+      target[key] = obj[key];
+    }
+  });
+  return target;
+}
+
+console.log(z);
+console.log(z === x);
diff --git a/Snippets/Objects/immediatelyCalledConstructorFunction.js b/Snippets/Objects/immediatelyCalledConstructorFunction.js
new file mode 100644
index 0000000..e974d0e
--- /dev/null
+++ b/Snippets/Objects/immediatelyCalledConstructorFunction.js
@@ -0,0 +1,9 @@
+// create a function and immediately call it with new
+let user = new (function () {
+  this.name = "John";
+  this.isAdmin = false;
+
+  // ...other code for user creation
+  // maybe complex logic and statements
+  // local variables etc
+})();
diff --git a/Snippets/Objects/isEmpty.js b/Snippets/Objects/isEmpty.js
new file mode 100644
index 0000000..75fee18
--- /dev/null
+++ b/Snippets/Objects/isEmpty.js
@@ -0,0 +1,11 @@
+const isEmpty = (obj) => {
+  return Object.keys(obj).length;
+};
+
+let schedule = {};
+
+console.log(isEmpty(schedule)); // true
+
+schedule["8:30"] = "get up";
+
+console.log(isEmpty(schedule)); // false
diff --git a/Snippets/Objects/ladder.js b/Snippets/Objects/ladder.js
new file mode 100644
index 0000000..c1482d4
--- /dev/null
+++ b/Snippets/Objects/ladder.js
@@ -0,0 +1,19 @@
+// chaining
+
+let ladder = {
+  step: 0,
+  up() {
+    this.step++;
+    return this;
+  },
+  down() {
+    this.step--;
+    return this;
+  },
+  showStep: function () {
+    // shows the current step
+    console.log(this.step);
+  },
+};
+
+ladder.up().down();
diff --git a/Snippets/Objects/methodsAndthis.js b/Snippets/Objects/methodsAndthis.js
new file mode 100644
index 0000000..bf2b805
--- /dev/null
+++ b/Snippets/Objects/methodsAndthis.js
@@ -0,0 +1,36 @@
+let user = {
+  name: "Soham",
+  age: 5,
+  sayHi: function () {
+    console.log("Hi " + this.name);
+  },
+};
+
+let user2 = {
+  name: "Ashutosh",
+  age: 15,
+};
+
+function makeUser() {
+  return {
+    name: "John",
+    ref: this,
+  };
+}
+
+let user3 = makeUser();
+
+console.log(user3.ref); // undefined in node / Error in browser
+
+function makeUser2() {
+  return {
+    name: "John",
+    ref() {
+      return this;
+    },
+  };
+}
+
+let user4 = makeUser2();
+
+console.log(user4.ref().name); // John
diff --git a/Snippets/Objects/multiplyNumeric.js b/Snippets/Objects/multiplyNumeric.js
new file mode 100644
index 0000000..2fdfb41
--- /dev/null
+++ b/Snippets/Objects/multiplyNumeric.js
@@ -0,0 +1,16 @@
+const multiplyNumeric = (obj) => {
+  for (key in obj) {
+    if (typeof obj[key] === "number") {
+      obj[key] *= 2;
+    }
+  }
+  console.log(obj);
+};
+// before the call
+let menu = {
+  width: 200,
+  height: 300,
+  title: "My menu",
+};
+
+multiplyNumeric(menu);
diff --git a/Snippets/Objects/objectToPrimitiveConversion.js b/Snippets/Objects/objectToPrimitiveConversion.js
new file mode 100644
index 0000000..e69de29
diff --git a/Snippets/Objects/orderedLikeObject.js b/Snippets/Objects/orderedLikeObject.js
new file mode 100644
index 0000000..7ac6166
--- /dev/null
+++ b/Snippets/Objects/orderedLikeObject.js
@@ -0,0 +1,25 @@
+let codes = {
+  "+49": "Germany",
+  "+41": "Switzerland",
+  "+44": "Great Britain",
+  // ..,
+  "+1": "USA",
+};
+
+for (let code in codes) {
+  console.log(+code); // 49, 41, 44, 1
+}
+
+codes = {
+  49: "Germany",
+  41: "Switzerland",
+  44: "Great Britain",
+  // ..,
+  1: "USA",
+};
+
+console.log(codes);
+
+for (let code in codes) {
+  console.log(code); // 1, 41, 44, 49
+}
diff --git a/Snippets/Objects/propertyDescriptors.js b/Snippets/Objects/propertyDescriptors.js
new file mode 100644
index 0000000..d84689a
--- /dev/null
+++ b/Snippets/Objects/propertyDescriptors.js
@@ -0,0 +1,30 @@
+let user = {
+  name: "John",
+};
+
+// get property
+let descriptor = Object.getOwnPropertyDescriptor(user, "name");
+
+console.log(descriptor);
+
+// define property
+Object.defineProperty(user, "name", {
+  value: "Soham",
+});
+
+// non-writable
+Object.defineProperty(user, "name", {
+  writable: false,
+});
+
+// non-enumerable
+
+Object.defineProperty(user, "toString", {
+  enumerable: false,
+});
+
+// non-configurable
+
+Object.defineProperty(user, "name", { configurable: false });
+
+// cannot even change other ennumberable and writable
diff --git a/Snippets/Objects/propertyGetterSetter.js b/Snippets/Objects/propertyGetterSetter.js
new file mode 100644
index 0000000..9bd6a80
--- /dev/null
+++ b/Snippets/Objects/propertyGetterSetter.js
@@ -0,0 +1,31 @@
+let obj = {
+  name: "Soham",
+  surname: "Shah",
+  get fullName() {
+    return `${this.name} ${this.surname}`;
+  },
+  set propName(value) {
+    [this.name, this.surname] = value.split(" ");
+  },
+};
+
+// hiding a variable
+
+let user = {
+  get name() {
+    return this._name;
+  },
+
+  set name(value) {
+    if (value.length < 4) {
+      alert("Name is too short, need at least 4 characters");
+      return;
+    }
+    this._name = value;
+  },
+};
+
+user.name = "Pete";
+alert(user.name); // Pete
+
+user.name = "";
diff --git a/Snippets/Objects/reference.js b/Snippets/Objects/reference.js
new file mode 100644
index 0000000..89ea186
--- /dev/null
+++ b/Snippets/Objects/reference.js
@@ -0,0 +1,17 @@
+const user = {
+  name: "Soham",
+};
+
+const admin = user;
+
+console.log(admin);
+
+admin.name = "Dhruvi";
+
+console.log(admin);
+
+user.name = "Samyak";
+
+console.log(admin);
+
+console.log(admin == { name: "Samyak" });
diff --git a/Snippets/Objects/restAndspread.js b/Snippets/Objects/restAndspread.js
new file mode 100644
index 0000000..8c8792a
--- /dev/null
+++ b/Snippets/Objects/restAndspread.js
@@ -0,0 +1,71 @@
+// Rest
+
+function sumAll(...args) {
+  // args is the name for the array
+  let sum = 0;
+
+  for (let arg of args) sum += arg;
+
+  return sum;
+}
+
+console.log(sumAll(1, 2, 3));
+
+function showName(firstName, lastName, ...titles) {
+  console.log(firstName + " " + lastName); // Julius Caesar
+
+  // the rest go into titles array
+  // i.e. titles = ["Consul", "Imperator"]
+  console.log(titles[0]); // Consul
+  console.log(titles[1]); // Imperator
+  console.log(titles.length); // 2
+}
+
+showName("Julius", "Caesar", "Consul", "Imperator");
+
+// arguments array
+
+function showName2() {
+  console.log(arguments.length);
+  console.log(arguments[0]);
+  console.log(arguments[1]);
+
+  // it's iterable
+  // for(let arg of arguments) console.log(arg);
+}
+
+// shows: 2, Julius, Caesar
+showName2("Julius", "Caesar");
+
+// shows: 1, Ilya, undefined (no second argument)
+showName2("Ilya");
+
+// BEWARE: Arrow Functions dont have "arguments"
+
+function f() {
+  // If we access the arguments object from an arrow function, it takes them from the outer “normal” function.
+
+  let showArg = () => console.log(arguments[0]);
+  showArg();
+}
+
+f(1); // 1
+
+// Spread
+
+let arr1 = [1, -2, 3, 4];
+let arr2 = [8, 3, -8, 1];
+
+console.log(Math.max(...arr1, ...arr2)); // 8
+
+let str = "Hello";
+
+// Array.from converts an iterable and array-like object into an array
+console.log(Array.from(str)); // H,e,l,l,o
+
+// Array-like is an object that index and length property
+
+let arrLike = { 0: "foo", 5: "bar", length: 6 };
+console.log(Array.from(arrLike));
+
+console.log(Array.from([1, 2, 3], (x) => x + x));
diff --git a/Snippets/Polyfill/bind-polyfill.js b/Snippets/Polyfill/bind-polyfill.js
new file mode 100644
index 0000000..c3d6e7b
--- /dev/null
+++ b/Snippets/Polyfill/bind-polyfill.js
@@ -0,0 +1,10 @@
+// bind polyfill
+
+Function.prototype.customBind = function (...args) {
+   let context = this;
+   let params = args.slice(1);
+
+   return function (...args2) {
+      context.apply(args[0], [...params, ...args2]);
+   };
+};
diff --git a/Snippets/Polyfill/filter-polyfill.js b/Snippets/Polyfill/filter-polyfill.js
new file mode 100644
index 0000000..80fd40c
--- /dev/null
+++ b/Snippets/Polyfill/filter-polyfill.js
@@ -0,0 +1,12 @@
+// filter polyfill
+
+Array.prototype.customFilter = function (callbackFn) {
+   const result = [];
+
+   for (let i = 0; i < this.length; i++) {
+      if (callbackFn.call(this, this[i], i)) {
+         result.push(this[i]);
+      }
+   }
+   return result;
+};
diff --git a/Snippets/Polyfill/forEach-polyfill.js b/Snippets/Polyfill/forEach-polyfill.js
new file mode 100644
index 0000000..faeaa84
--- /dev/null
+++ b/Snippets/Polyfill/forEach-polyfill.js
@@ -0,0 +1,7 @@
+// forEach polyfill
+
+Array.prototype.customForEach = function (callbackFn) {
+   for (let i = 0; i < this.length; i++) {
+      callbackFn.call(this, this[i], i);
+   }
+};
diff --git a/Snippets/Polyfill/map-polyfill.js b/Snippets/Polyfill/map-polyfill.js
new file mode 100644
index 0000000..27326cf
--- /dev/null
+++ b/Snippets/Polyfill/map-polyfill.js
@@ -0,0 +1,10 @@
+// map polyfill
+
+Array.prototype.customMap = function (callbackFn) {
+   const result = [];
+
+   for (let i = 0; i < this.length; i++) {
+      result.push(callbackFn.call(this, this[i], i));
+   }
+   return result;
+};
diff --git a/Snippets/Polyfill/promiseAll-polyfill.js b/Snippets/Polyfill/promiseAll-polyfill.js
new file mode 100644
index 0000000..9a53798
--- /dev/null
+++ b/Snippets/Polyfill/promiseAll-polyfill.js
@@ -0,0 +1,21 @@
+// promise polyfill
+
+Promise.customAll = function (promiseArray) {
+   return new Promise((resolve, reject) => {
+      let completed = 0;
+      const promiseResults = [];
+
+      promiseArray.forEach((value, index) => {
+         Promise.resolve(value)
+            .then((result) => {
+               completed++;
+               promiseResults[index] = result;
+
+               if (completed === promiseArray.length) {
+                  resolve(promiseResults);
+               }
+            })
+            .catch((err) => reject(err));
+      });
+   });
+};
diff --git a/Snippets/Polyfill/reduce-polyfill.js b/Snippets/Polyfill/reduce-polyfill.js
new file mode 100644
index 0000000..9a31b2e
--- /dev/null
+++ b/Snippets/Polyfill/reduce-polyfill.js
@@ -0,0 +1,14 @@
+// reduce polyfill
+
+Array.prototype.customReduce = function (callbackFn, initialValue) {
+   let accumulator = initialValue;
+
+   for (let i = 0; i < this.length; i++) {
+      if (accumulator !== undefined) {
+         accumulator = callbackFn.call(undefined, accumulator, this[i], i, this);
+      } else {
+         accumulator = this[i];
+      }
+   }
+   return accumulator;
+};
diff --git a/Snippets/Promises/asyncAwait.js b/Snippets/Promises/asyncAwait.js
new file mode 100644
index 0000000..82a5a24
--- /dev/null
+++ b/Snippets/Promises/asyncAwait.js
@@ -0,0 +1,21 @@
+function loadJson(url) {
+  return fetch(url).then((response) => {
+    if (response.status == 200) {
+      return response.json();
+    } else {
+      throw new Error(response.status);
+    }
+  });
+}
+
+loadJson("https://javascript.info/no-such-user.json").catch(alert); // Error: 404
+
+async function loadJsonAsyncAwait(url) {
+  const response = await fetch(url);
+  if (response.status === 200) {
+    return response.json();
+  }
+  throw new Error(response.status);
+}
+
+loadJsonAsyncAwait("https://javascript.info/no-such-user.json").catch(alert); // Error: 404
diff --git a/Snippets/Promises/callAsyncFromNonAsync.js b/Snippets/Promises/callAsyncFromNonAsync.js
new file mode 100644
index 0000000..d06f398
--- /dev/null
+++ b/Snippets/Promises/callAsyncFromNonAsync.js
@@ -0,0 +1,12 @@
+async function wait() {
+  await new Promise((resolve) => setTimeout(resolve, 3000));
+
+  return 10;
+}
+
+function f() {
+  // get value from the promise by calling async code in sync func
+  wait().then((value) => console.log(value));
+}
+
+f();
diff --git a/Snippets/Promises/microtask.js b/Snippets/Promises/microtask.js
new file mode 100644
index 0000000..e1b2397
--- /dev/null
+++ b/Snippets/Promises/microtask.js
@@ -0,0 +1,11 @@
+const a = "5";
+const promise = new Promise((resolve, reject) => {
+  setTimeout(() => resolve(1), 3000);
+  console.log("Inside promise"); // 1
+});
+
+promise.then((val) => console.log("Promise", val)); // 3
+
+setTimeout(() => console.log("Set Timeout ran"), 3000); // 4
+
+console.log(a); // 2
diff --git a/Snippets/Promises/noNeedToReturnPromiseInThenChain.js b/Snippets/Promises/noNeedToReturnPromiseInThenChain.js
new file mode 100644
index 0000000..99e2144
--- /dev/null
+++ b/Snippets/Promises/noNeedToReturnPromiseInThenChain.js
@@ -0,0 +1,11 @@
+function first(num) {
+  return Promise.resolve(num); // starting the then chain by returning a promise
+}
+
+function second(num) {
+  return num + 1; // no need to return promise as this function is in 'then' chain
+}
+
+first(4)
+  .then((valueOne) => second(valueOne))
+  .then((valueTwo) => console.log(valueTwo));
diff --git a/Snippets/Promises/promiseAPI.js b/Snippets/Promises/promiseAPI.js
new file mode 100644
index 0000000..c19513b
--- /dev/null
+++ b/Snippets/Promises/promiseAPI.js
@@ -0,0 +1,20 @@
+/*
+There are 6 static methods of Promise class:
+
+Promise.all(promises) – waits for all promises to resolve and returns an array of their results. If any of the given promises rejects, it becomes the error of Promise.all, and all other results are ignored.
+Promise.allSettled(promises) (recently added method) – waits for all promises to settle and returns their results as an array of objects with:
+status: "fulfilled" or "rejected"
+value (if fulfilled) or reason (if rejected).
+Promise.race(promises) – waits for the first promise to settle, and its result/error becomes the outcome.
+Promise.any(promises) (recently added method) – waits for the first promise to fulfill, and its result becomes the outcome. If all of the given promises are rejected, AggregateError becomes the error of Promise.any.
+Promise.resolve(value) – makes a resolved promise with the given value.
+Promise.reject(error) – makes a rejected promise with the given error.
+
+*/
+Promise.race([
+  new Promise((resolve, reject) => setTimeout(() => resolve(1), 1000)),
+  new Promise((resolve, reject) =>
+    setTimeout(() => reject(new Error("Whoops!")), 2000)
+  ),
+  new Promise((resolve, reject) => setTimeout(() => resolve(3), 3000)),
+]).then((value) => console.log(value));
diff --git a/Snippets/Promises/promiseAll.js b/Snippets/Promises/promiseAll.js
new file mode 100644
index 0000000..651e672
--- /dev/null
+++ b/Snippets/Promises/promiseAll.js
@@ -0,0 +1,33 @@
+Promise.myAll = function (promises) {
+  return new Promise((resolve, reject) => {
+    let results = [];
+    let count = 0;
+    let toBeRejected = false;
+
+    promises.forEach((promise, index) => {
+      if (toBeRejected) return;
+      Promise.resolve(promise)
+        .then((res) => {
+          count += 1;
+          results[index] = res; // maintaining the order
+          if (count === promises.length) {
+            resolve(results);
+          }
+        })
+        .catch((err) => {
+          reject(err);
+          toBeRejected = true;
+        });
+    });
+  });
+};
+
+const promise1 = Promise.resolve(1);
+const promise2 = new Promise((resolve, reject) =>
+  setTimeout(() => resolve(2), 3000)
+);
+const promise3 = 3;
+
+Promise.myAll([Promise.reject("bar"), promise1, promise2, promise3])
+  .then((value) => console.log(value))
+  .catch((err) => console.log(err));
diff --git a/Snippets/Promises/promiseAllSettled.js b/Snippets/Promises/promiseAllSettled.js
new file mode 100644
index 0000000..bdbf1f8
--- /dev/null
+++ b/Snippets/Promises/promiseAllSettled.js
@@ -0,0 +1,33 @@
+Promise.myAllSettled = function (promises) {
+  let results = [];
+  let count = 0;
+  return new Promise((resolve, reject) => {
+    promises.forEach((promise, index) => {
+      Promise.resolve(promise)
+        .then((value) => {
+          count += 1;
+          results[index] = value;
+          if (count === promises.length) {
+            resolve(results);
+          }
+        })
+        .catch((err) => {
+          count += 1;
+          results[index] = "Error: " + err;
+          if (count === promises.length) {
+            resolve(results);
+          }
+        });
+    });
+  });
+};
+
+const promise1 = Promise.resolve(1);
+const promise2 = new Promise((resolve, reject) =>
+  setTimeout(() => resolve(2), 3000)
+);
+const promise3 = 3;
+
+Promise.myAllSettled([Promise.reject("bar"), promise1, promise2, promise3])
+  .then((value) => console.log(value))
+  .catch((err) => console.log(err));
diff --git a/Snippets/Promises/promiseAny.js b/Snippets/Promises/promiseAny.js
new file mode 100644
index 0000000..b163a07
--- /dev/null
+++ b/Snippets/Promises/promiseAny.js
@@ -0,0 +1,46 @@
+Promise.myAny = function (promises) {
+  let errList = [];
+  let errCount = 0;
+  return new Promise((resolve, reject) => {
+    promises.forEach((promise, index) => {
+      Promise.resolve(promise).then(
+        (value) => {
+          return resolve(value);
+        },
+        (reason) => {
+          errList[index] = reason;
+          errCount += 1;
+          if (errCount === promises.length) {
+            return reject([
+              new AggregateError([errList], "All promises were rejected"),
+            ]);
+          }
+        }
+      );
+    });
+  });
+};
+
+const promise1 = Promise.resolve(1);
+const promise2 = new Promise((resolve, reject) =>
+  setTimeout(() => resolve(2), 3000)
+);
+const promise3 = Promise.resolve(3);
+
+Promise.myAny([
+  Promise.reject("bar"),
+  Promise.reject("foo"),
+  Promise.reject("nice"),
+  Promise.reject("wow"),
+])
+  .then((value) => console.log(value))
+  .catch((err) => console.log(err));
+
+Promise.any([
+  Promise.reject("bar"),
+  Promise.reject("foo"),
+  Promise.reject("nice"),
+  Promise.reject("wow"),
+])
+  .then((value) => console.log(value))
+  .catch((err) => console.log(err));
diff --git a/Snippets/Promises/promiseRace.js b/Snippets/Promises/promiseRace.js
new file mode 100644
index 0000000..94fb770
--- /dev/null
+++ b/Snippets/Promises/promiseRace.js
@@ -0,0 +1,24 @@
+Promise.myRace = function (promises) {
+  return new Promise((resolve, reject) => {
+    promises.forEach((promise) => {
+      Promise.resolve(promise).then(
+        (value) => resolve(value),
+        (reason) => reject(reason)
+      );
+    });
+  });
+};
+
+const promise1 = Promise.resolve(1);
+const promise2 = new Promise((resolve, reject) =>
+  setTimeout(() => resolve(2), 3000)
+);
+const promise3 = Promise.resolve(3);
+
+Promise.myRace([Promise.reject(new Error("bar")), promise1, promise2, promise3])
+  .then((value) => console.log(value))
+  .catch((err) => console.log("error"));
+
+Promise.race([Promise.reject("bar"), promise1, promise2, promise3])
+  .then((value) => console.log(value))
+  .catch((err) => console.log("error"));
diff --git a/Snippets/Promises/resolveVsReturn.js b/Snippets/Promises/resolveVsReturn.js
new file mode 100644
index 0000000..1cf7ee7
--- /dev/null
+++ b/Snippets/Promises/resolveVsReturn.js
@@ -0,0 +1,17 @@
+function second() {
+  return new Promise((resolve, reject) => {
+    // resolve/reject happens only one time
+    resolve(1);
+    reject("Failed");
+    resolve(2);
+    console.log("After resolve/reject"); // this will be printed first because aLl lines will be executed
+  });
+}
+
+function first() {
+  second()
+    .then((value) => console.log(value))
+    .catch((err) => console.log(err));
+}
+
+first();
diff --git a/Snippets/Promises/retryNTimes.js b/Snippets/Promises/retryNTimes.js
new file mode 100644
index 0000000..d244d18
--- /dev/null
+++ b/Snippets/Promises/retryNTimes.js
@@ -0,0 +1,51 @@
+// wait function
+const wait = (ms) => {
+  return new Promise((resolve) => {
+    setTimeout(() => resolve(), ms);
+  });
+};
+
+const retryWithDelay = (
+  operation,
+  retries = 3,
+  delay = 50,
+  finalErr = "Retry Failed"
+) => {
+  return new Promise((resolve, reject) =>
+    operation()
+      .then(resolve)
+      .catch((reason) => {
+        console.log(retries);
+        if (retries > 0) {
+          return wait(delay)
+            .then(
+              retryWithDelay.bind(null, operation, retries - 1, delay, finalErr)
+            )
+            .then(resolve)
+            .catch(reject);
+        }
+        // throw final error
+        return reject(finalErr);
+      })
+  );
+};
+
+const getTestFunc = () => {
+  let callCounter = 0;
+  return async () => {
+    callCounter += 1;
+
+    if (callCounter) {
+      throw new Error("Not yet");
+    }
+  };
+};
+
+// Test the code
+const test = async () => {
+  await retryWithDelay(getTestFunc(), 10, 1000);
+  console.log("success");
+};
+
+// Print the result
+test().catch(console.error);
diff --git a/Snippets/Promises/throwingErrorOutsidePromiseChain.js b/Snippets/Promises/throwingErrorOutsidePromiseChain.js
new file mode 100644
index 0000000..53327b0
--- /dev/null
+++ b/Snippets/Promises/throwingErrorOutsidePromiseChain.js
@@ -0,0 +1,14 @@
+function first() {
+  throw new Error("lol"); // error wont be caught in .catch()
+  return Promise.resolve(1);
+}
+
+function second(num) {
+  throw new Error("lol"); // error will be caught in .catch()
+  return num + 2;
+}
+
+first()
+  .then((valueOne) => second(valueOne))
+  .then((valueTwo) => console.log(valueTwo))
+  .catch((err) => console.log(err));
diff --git a/Snippets/Promises/tryCatch.js b/Snippets/Promises/tryCatch.js
new file mode 100644
index 0000000..21625d8
--- /dev/null
+++ b/Snippets/Promises/tryCatch.js
@@ -0,0 +1,20 @@
+async function first() {
+  try {
+    // return await second(); // remains synchronous for the function if used await
+    return second(); //asynchronous returning the function
+  } catch (err) {
+    console.log("Try/Catch", err);
+  }
+}
+
+function second() {
+  return Promise.reject("Something went wrong!");
+}
+
+first()
+  .then(() => {
+    console.log("End");
+  })
+  .catch((err) => {
+    console.log("From .catch()", err);
+  });
diff --git a/Snippets/Prototype/basic.js b/Snippets/Prototype/basic.js
new file mode 100644
index 0000000..24921f0
--- /dev/null
+++ b/Snippets/Prototype/basic.js
@@ -0,0 +1,29 @@
+let arr = ["Soham", "Dhruvi"];
+
+let obj = {
+  name: "Soham",
+  city: "Ahmedabad",
+  getIntro: function () {
+    console.log(this.name + "from" + this.city);
+  },
+};
+
+function fun() {
+  console.log("hello");
+}
+
+/* 
+Learnings
+arr.__proto__ === Array.prototype
+arr.__proto__.__proto__ === Object.prototype
+arr.__proto__.__proto__ === null
+
+obj.__proto__ === Object.prototype
+obj.__proto__proto__ === null
+
+fun.__proto__ === Function.prototype
+fun.__proto__.__proto__ === Object.prototype
+fun.__proto__.__proto__.__prototype === null
+
+Everything is object in JavaScript
+*/
diff --git a/Snippets/Prototype/forInLoop.js b/Snippets/Prototype/forInLoop.js
new file mode 100644
index 0000000..2c716a9
--- /dev/null
+++ b/Snippets/Prototype/forInLoop.js
@@ -0,0 +1,25 @@
+let animal = {
+  eats: true,
+};
+
+let rabbit = {
+  jumps: true,
+  __proto__: animal,
+};
+
+// Object.keys only returns own keys
+console.log(Object.keys(rabbit)); // jumps
+
+// for..in loops over both own and inherited keys
+for (let prop in rabbit) console.log(prop); // jumps, then eats
+
+// only loop in own keys and ignore inherited keys
+for (let prop in rabbit) {
+  let isOwn = rabbit.hasOwnProperty(prop);
+
+  if (isOwn) {
+    alert(`Our: ${prop}`); // Our: jumps
+  } else {
+    alert(`Inherited: ${prop}`); // Inherited: eats
+  }
+}
diff --git a/Snippets/Prototype/getAndset.js b/Snippets/Prototype/getAndset.js
new file mode 100644
index 0000000..8b7964b
--- /dev/null
+++ b/Snippets/Prototype/getAndset.js
@@ -0,0 +1,25 @@
+let user = {
+  name: "John",
+  surname: "Smith",
+
+  set fullName(value) {
+    [this.name, this.surname] = value.split(" ");
+  },
+
+  get fullName() {
+    return `${this.name} ${this.surname}`;
+  },
+};
+
+let admin = {
+  __proto__: user,
+  isAdmin: true,
+};
+
+console.log(admin.fullName); // John Smith
+
+// setter triggers!
+admin.fullName = "Alice Cooper";
+
+console.log(admin.fullName); // Alice Cooper, state of admin modified
+console.log(user.fullName); // John Smith, state of user protected
diff --git a/Snippets/Prototype/nativePrototypes.js b/Snippets/Prototype/nativePrototypes.js
new file mode 100644
index 0000000..48db9fd
--- /dev/null
+++ b/Snippets/Prototype/nativePrototypes.js
@@ -0,0 +1,23 @@
+Function.prototype.defer = function (ms) {
+  setTimeout(this, ms);
+};
+
+function f() {
+  console.log("Hello!");
+}
+
+f.defer(1000); // shows "Hello!" after 1 sec
+
+Function.prototype.defer2 = function (ms) {
+  let k = this;
+  return function (...args) {
+    setTimeout(() => k.apply(this, args), ms);
+  };
+};
+
+// check it
+function k(a, b) {
+  console.log(a + b);
+}
+
+k.defer(1000)(1, 2); // shows 3 after 1 sec
diff --git a/Snippets/Prototype/prototype.js b/Snippets/Prototype/prototype.js
new file mode 100644
index 0000000..14e0e12
--- /dev/null
+++ b/Snippets/Prototype/prototype.js
@@ -0,0 +1,35 @@
+let animal = {
+  eats: true,
+};
+
+function Rabbit(name) {
+  this.name = name;
+}
+
+Rabbit.prototype = animal;
+
+let rabbit = new Rabbit("White Rabbit"); //  rabbit.__proto__ == animal
+
+let rabbit2 = new rabbit.constructor("Black Rabbit"); // another way to create a new object
+
+// re-assigning prototype of Rabbit
+Rabbit.prototype = {
+  jumps: true,
+};
+
+let rabbit3 = new Rabbit();
+console.log(rabbit.constructor === Rabbit); // false
+
+// Not overwrite Rabbit.prototype totally
+// just add to it
+Rabbit.prototype.jumps = true;
+// the default Rabbit.prototype.constructor is preserved
+
+let rabbit4 = new Rabbit();
+console.log(rabbit.constructor === Rabbit); // false
+
+// Other alternative way
+Rabbit.prototype = {
+  jumps: true,
+  constructor: Rabbit,
+};
diff --git a/Snippets/Prototype/searchingAlgorithm.js b/Snippets/Prototype/searchingAlgorithm.js
new file mode 100644
index 0000000..04b89df
--- /dev/null
+++ b/Snippets/Prototype/searchingAlgorithm.js
@@ -0,0 +1,34 @@
+/*
+Problem statement
+Use __proto__ to assign prototypes in a way that any property lookup will follow the path: pockets → bed → table → head. For instance, pockets.pen should be 3 (found in table), and bed.glasses should be 1 (found in head).
+Answer the question: is it faster to get glasses as pockets.glasses or head.glasses? Benchmark if needed.
+*/
+
+let head = {
+  glasses: 1,
+};
+
+let table = {
+  pen: 3,
+  __proto__: head,
+};
+
+let bed = {
+  sheet: 1,
+  pillow: 2,
+  __proto__: table,
+};
+
+let pockets = {
+  money: 2000,
+  __proto__: bed,
+};
+
+console.log(pockets.pen); // 3
+console.log(bed.glasses); // 1
+
+/*
+In modern engines, performance-wise, there’s no difference whether we take a property from an object or its prototype. They remember where the property was found and reuse it in the next request.
+
+For instance, for pockets.glasses they remember where they found glasses (in head), and next time will search right there. They are also smart enough to update internal caches if something changes, so that optimization is safe.
+*/
diff --git a/Snippets/Prototype/this.js b/Snippets/Prototype/this.js
new file mode 100644
index 0000000..2f4508f
--- /dev/null
+++ b/Snippets/Prototype/this.js
@@ -0,0 +1,22 @@
+// animal has methods
+let animal = {
+  walk() {
+    if (!this.isSleeping) {
+      console.log(`I walk`);
+    }
+  },
+  sleep() {
+    this.isSleeping = true;
+  },
+};
+
+let rabbit = {
+  name: "White Rabbit",
+  __proto__: animal,
+};
+
+// modifies rabbit.isSleeping
+rabbit.sleep();
+
+console.log(rabbit.isSleeping); // true
+console.log(animal.isSleeping); // undefined (no such property in the prototype)
diff --git a/Snippets/Prototype/whyAreBothHamstersFull.js b/Snippets/Prototype/whyAreBothHamstersFull.js
new file mode 100644
index 0000000..dc3059f
--- /dev/null
+++ b/Snippets/Prototype/whyAreBothHamstersFull.js
@@ -0,0 +1,45 @@
+let hamster = {
+  stomach: [],
+  eat(food) {
+    this.stomach.push(food);
+  },
+};
+
+let speedy = {
+  __proto__: hamster,
+};
+
+let lazy = {
+  __proto__: hamster,
+};
+
+// This one found the food
+speedy.eat("apple");
+console.log(speedy.stomach); // apple
+
+// This one also has it, why?
+console.log(lazy.stomach); // apple
+
+/*
+Reason:
+
+speedy.eat() -> couldn't find in its obj -> finds it in hamster
+Now, this = speedy
+In this.stomach.push() -> it searches for stomach value -> couldn't find in speedy -> found in hamster
+So, this.stomach.push actually pushes food to the hamster object's stomach; which is common for both of them
+*/
+
+/*
+Solution:
+
+let speedy = {
+  __proto__: hamster,
+  stomach: []
+};
+
+let lazy = {
+  __proto__: hamster,
+  stomach: []
+};
+
+*/
diff --git a/Snippets/Recursion/factorial.js b/Snippets/Recursion/factorial.js
new file mode 100644
index 0000000..2bca7aa
--- /dev/null
+++ b/Snippets/Recursion/factorial.js
@@ -0,0 +1,8 @@
+const factorial = (num) => {
+  if (num === 1) {
+    return 1;
+  }
+  return num * factorial(num - 1);
+};
+
+console.log(factorial(5));
diff --git a/Snippets/Recursion/fibonacci.js b/Snippets/Recursion/fibonacci.js
new file mode 100644
index 0000000..bc17d9f
--- /dev/null
+++ b/Snippets/Recursion/fibonacci.js
@@ -0,0 +1,26 @@
+// fibonacci
+
+const fibonacci = (num) => {
+  if (num === 1) {
+    return 1;
+  }
+  if (num === 0) {
+    return 0;
+  }
+  return fibonacci(num - 2) + fibonacci(num - 1);
+};
+
+console.log(fibonacci(7));
+
+// DP Approach
+
+function fib(n) {
+  let a = 1;
+  let b = 1;
+  for (let i = 3; i <= n; i++) {
+    let c = a + b;
+    a = b;
+    b = c;
+  }
+  return b;
+}
diff --git a/Snippets/Recursion/linkedList.js b/Snippets/Recursion/linkedList.js
new file mode 100644
index 0000000..eb13922
--- /dev/null
+++ b/Snippets/Recursion/linkedList.js
@@ -0,0 +1,22 @@
+let list = {
+  value: 1,
+  next: {
+    value: 2,
+    next: {
+      value: 3,
+      next: {
+        value: 4,
+        next: null,
+      },
+    },
+  },
+};
+
+const printList = (obj) => {
+  console.log(obj.value);
+  if (obj.next !== null) {
+    printList(obj.next);
+  }
+};
+
+console.log(printList(list));
diff --git a/Snippets/Recursion/power.js b/Snippets/Recursion/power.js
new file mode 100644
index 0000000..967bacf
--- /dev/null
+++ b/Snippets/Recursion/power.js
@@ -0,0 +1,9 @@
+const power = (x, n) => {
+  console.log(x, n);
+  if (n === 1) {
+    return x;
+  }
+  return x * power(x, n - 1);
+};
+
+console.log(power(2, 3));
diff --git a/Snippets/Recursion/recursiveTraversal.js b/Snippets/Recursion/recursiveTraversal.js
new file mode 100644
index 0000000..f85bc4a
--- /dev/null
+++ b/Snippets/Recursion/recursiveTraversal.js
@@ -0,0 +1,46 @@
+let company = {
+  sales: [
+    {
+      name: "John",
+      salary: 1000,
+    },
+    {
+      name: "Alice",
+      salary: 1600,
+    },
+  ],
+
+  development: {
+    sites: [
+      {
+        name: "Peter",
+        salary: 2000,
+      },
+      {
+        name: "Alex",
+        salary: 1800,
+      },
+    ],
+
+    internals: [
+      {
+        name: "Jack",
+        salary: 1300,
+      },
+    ],
+  },
+};
+
+const computeSalary = (department, salary) => {
+  if (Array.isArray(department)) {
+    return department.reduce((prev, current) => prev + current.salary, 0);
+  } else {
+    let sum = 0;
+    for (let subDep of Object.values(department)) {
+      sum += computeSalary(subDep);
+    }
+    return sum;
+  }
+};
+
+console.log(computeSalary(company));
diff --git a/Snippets/Recursion/sumTo.js b/Snippets/Recursion/sumTo.js
new file mode 100644
index 0000000..0ab4e8e
--- /dev/null
+++ b/Snippets/Recursion/sumTo.js
@@ -0,0 +1,10 @@
+const sumTo = (n) => {
+  if (n === 1) {
+    return 1;
+  } else {
+    return n + sumTo(n - 1);
+  }
+};
+
+console.log(sumTo(5)); // 15
+console.log(sumTo(100000)); // error
diff --git a/Snippets/Strings/lowerCaseConverter.js b/Snippets/Strings/lowerCaseConverter.js
new file mode 100644
index 0000000..6c88127
--- /dev/null
+++ b/Snippets/Strings/lowerCaseConverter.js
@@ -0,0 +1,7 @@
+// toLowerCase() method changes the string to lowercase letters.
+let favLanguage = "JavasCript";
+console.log(favLanguage.toLowerCase()); // javascript
+let standard = "ECMA";
+console.log(standard.toLowerCase()); // ecma
+let oneMoreLangugae = "PHP";
+console.log(oneMoreLangugae.toLowerCase()); // php
diff --git a/Snippets/Strings/repeat.js b/Snippets/Strings/repeat.js
new file mode 100644
index 0000000..ed5cd94
--- /dev/null
+++ b/Snippets/Strings/repeat.js
@@ -0,0 +1,5 @@
+/**
+ * repeat methods creates specified n copies and concatenates together and returns it. Original string will be unaltered
+ */
+let stringToBeRepeated = "love-Javascript";
+console.log(stringToBeRepeated.repeat(5)); //love-Javascriptlove-Javascriptlove-Javascriptlove-Javascriptlove-Javascript
diff --git a/Snippets/Strings/search.js b/Snippets/Strings/search.js
new file mode 100644
index 0000000..d06cdb3
--- /dev/null
+++ b/Snippets/Strings/search.js
@@ -0,0 +1,7 @@
+/**
+ * search a word in the sentence and find out at which position it is found for first time.
+ */
+
+let jsLove = "Javascript is awesome. I am a Javascript lover. You have to experience this awesomeness";
+let searchWord = "awesome";
+console.log(searchWord + " found at " + (jsLove.search(searchWord) + 1) + " position"); // 14
diff --git a/Snippets/Strings/trim.js b/Snippets/Strings/trim.js
new file mode 100644
index 0000000..46fb77d
--- /dev/null
+++ b/Snippets/Strings/trim.js
@@ -0,0 +1,7 @@
+/**
+ * trim removes whitespaces in the beginning of the string and end of the string but not in the middle
+ */
+
+let string = "   Data       Structures   ";
+console.log(string); //   Data       Structures
+console.log(string.trim()); //Data       Structures
diff --git a/Snippets/Strings/upperCaseConverter.js b/Snippets/Strings/upperCaseConverter.js
new file mode 100644
index 0000000..3a6acf9
--- /dev/null
+++ b/Snippets/Strings/upperCaseConverter.js
@@ -0,0 +1,7 @@
+// toUpperCase() method changes the string to upper letters.
+let favLanguage = "JavasCript";
+console.log(favLanguage.toUpperCase()); // JAVASCRIPT
+let firstName = "ECMA";
+console.log(firstName.toUpperCase()); // ECMA
+let oneMoreLangugae = "Python";
+console.log(oneMoreLangugae.toUpperCase()); // PYTHON