Promise BTS added in detail

Author: mrinaljain

.DS_Store

@@ -73,4 +73,10 @@ closureFun(20);
 
 6. Can closures be used with event handlers?
 
-   Yes, closures are often used in event handlers to remember and manage state related to the event, even after the event has been triggered.
+   Yes, closures are often used in event handlers to remember and manage state related to the event, even after the event has been triggered.
+
+
+
+### Links
+
+- Closures BTS(https://www.youtube.com/watch?v=6Ixyltr8_R0&t=22s)

C/closure/readme.md

@@ -1,6 +1,9 @@
 # Promise
 
 Promise is an object which represents the eventual completion (or failure)  of an Asynchronous operation.
+##### Components
+- Promise Constructor
+- Executor Function
 ```
 const p = new Promise((res , rej)=> {
 
@@ -71,4 +74,11 @@ When you use await, the function pauses execution until the awaited promise reso
    .then()   .catch()
 
 2. What is the difference between `Promise` and `Async-Await`?
-   
+   
+
+
+
+#### Learning Material
+
+- [Understanding internal working of Promises using GIFs [ Video ]](https://www.youtube.com/watch?v=Xs1EMmBLpn4)
+- [GIF blog on Promises understanding](https://web.archive.org/web/20230325052017/https://dev.to/lydiahallie/javascript-visualized-promises-async-await-5gke)

P/promises/README.md

@@ -0,0 +1,34 @@
+/*
+sort the array such that it becomes a wave
+*/
+
+function convertToWave(arr) {
+  let n = arr.length;
+
+  for (let i = 0; i < n - 1; i++) {
+    const element = arr[i];
+    const nextElement = arr[i + 1];
+    // even index
+    if (i % 2 === 0 && element < nextElement) {
+     
+        //swap
+        let temp1 = arr[i];
+        arr[i] = arr[i+1];
+        arr[i+1]= temp1;
+      
+    }
+    // odd index
+    else if (i % 2 !== 0 && element > nextElement) {
+      //swap
+      let temp2 = arr[i];
+      arr[i] = arr[i + 1];
+      arr[i + 1] = temp2;
+    }
+  }
+
+  console.log(arr);
+  
+}
+
+
+convertToWave([1, 2 ,3 ,4 ,5]);

gfg/wave_array.js

@@ -11,7 +11,7 @@
 
 
 
-   <script src="./leetcode-solutions/189-Rotate_Array.js"> </script>
+   <script src="./leetcode-solutions/66-plus_one.js"> </script>
 </body>
 
 </html>

index.html

@@ -0,0 +1,31 @@
+/*
+You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any leading 0's.
+
+Increment the large integer by one and return the resulting array of digits
+*/
+
+var plusOne = function (digits) {
+
+   let carry = false;
+  for (let i = digits.length-1; i >=0 ; i--) {
+
+   if(digits[i] !== 9){
+      digits[i] = digits[i] + 1;
+      carry = false;
+      return digits;
+   } else{
+      carry = true;
+       digits[i] = 0;
+   }
+   
+  }
+   if(carry){
+      digits.unshift(1);
+   }
+   return digits;
+};
+
+
+let digits1 = [1, 9, 9];
+console.log(plusOne(digits1));
+  

leetcode-solutions/66-plus_one.js

@@ -1,3 +1,5 @@
 # Important Links
 
-- [Practice Javascript Logic](http://teachertrek.in/#/js-logic-building)
+- [Practice Javascript Logic](http://teachertrek.in/#/js-logic-building)
+- [Javascript Visualised](https://www.youtube.com/@theavocoder/videos)
+- [Javascript concepts by GIFs](https://www.linkedin.com/feed/update/urn:li:activity:7300416805972389889/)