wxgrzr · November 29, 2021 05:42 · Nov 29, 2021 · Nov 29, 2021 · Nov 29, 2021 · Nov 29, 2021
diff --git a/1-SlidingWindow.md b/1-SlidingWindow.md
@@ -1,4 +1,3 @@
-
 # Find Maximum in Sliding Window 
 
 [Link](https://www.educative.io/module/lesson/data-structures-in-javascript/gxnlB9N5MR9)
@@ -7,20 +6,20 @@
 ## Description
 
   Given a large array of integers and a window size of `w` find the current maximum value in the window as the window slides through the entire array.
-  
+
   Let's try to find all maximums for `w = 3`:
-    
+
     [-4, 2, -5, 3, 6]
-  
+
   **Step 1:** for the first *3* elements, max is 2.
 
     [-4, 2, -5], 3, 6
-         * 
-    
-  **Step 2:** Slide `window` one position to right and the max is now *3* 
+         *
+
+  **Step 2:** Slide `window` one position to right and the max is now *3*
 
     -4, [2, -5, 3], 6
-                * 
+                *
 
   **Step 3:** In the last `window` the max is 6.
 
@@ -71,7 +70,7 @@ console.log("Array = " + array);
 console.log("Max = " + ffindMaxSlidingWindow(array, 3));
 // Max = 3,4,5,6,7,8,9,10
 
-let array1 = [10, 6, 9, -3, 23, -1, 34, 56, 67, -1, -4, -8, -2, 9, 10, 34, 67]  
+let array1 = [10, 6, 9, -3, 23, -1, 34, 56, 67, -1, -4, -8, -2, 9, 10, 34, 67]
 console.log("Array = " + array1);
 console.log("Max = " + ffindMaxSlidingWindow(array1, 3))
 // Max = 10,9,23,23,34,56,67,67,67,-1,-2,9,10,34,67
@@ -88,4 +87,3 @@ The runtime complexity in *`linear, O(n)`*.
 Memory complexity is *`linear, O*(w)`*, where `w` is the window size
 
 
-
diff --git a/0-Index.md b/0-Index.md
@@ -3,5 +3,5 @@
 Educative Modules
 
 [[1-SlidingWindow]]
-[[2-RotatedArray]]
+[[DSAX-Modules/educative.io/2-RotatedArray]]
 
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -1,6 +1,6 @@
 # Rotated Array Search
 
-  [[0-Index]]
+[[0-Index]]
 
 ## Description
 

diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -1,6 +1,6 @@
 # Rotated Array Search
 
-[[0-Index]]
+  [[0-Index]]
 
 ## Description
 

diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -204,4 +204,4 @@ This solution works iteratively so te algo comes down to **`O(1)`** even though
 
 ---
 
-Next - [[3-]]
+Next - [[3-SmallestCommonNumber.md]]
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -204,4 +204,4 @@ This solution works iteratively so te algo comes down to **`O(1)`** even though
 
 ---
 
-Next - [[]]
+Next - [[3-]]
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -204,4 +204,4 @@ This solution works iteratively so te algo comes down to **`O(1)`** even though
 
 ---
 
-Next - []
+Next - [[]]
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -202,6 +202,6 @@ console.log("Key(6) found at: " + binarySearchRotated(v2, 6));
 ```
 This solution works iteratively so te algo comes down to **`O(1)`** even though the logic remains the same
 
---
+---
 
-Next -
+Next - []
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -202,4 +202,6 @@ console.log("Key(6) found at: " + binarySearchRotated(v2, 6));
 ```
 This solution works iteratively so te algo comes down to **`O(1)`** even though the logic remains the same
 
-Next - 
+--
+
+Next -
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -202,3 +202,4 @@ console.log("Key(6) found at: " + binarySearchRotated(v2, 6));
 ```
 This solution works iteratively so te algo comes down to **`O(1)`** even though the logic remains the same
 
+Next - 
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -202,4 +202,3 @@ console.log("Key(6) found at: " + binarySearchRotated(v2, 6));
 ```
 This solution works iteratively so te algo comes down to **`O(1)`** even though the logic remains the same
 
-
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -200,4 +200,6 @@ let v2 = [4, 5, 6, 1, 2, 3];
 console.log("Key(3) found at: " + binarySearchRotated(v2, 3));
 console.log("Key(6) found at: " + binarySearchRotated(v2, 6));
 ```
-This solution works iteratively so te algo comes down to **`O(1)`**
+This solution works iteratively so te algo comes down to **`O(1)`** even though the logic remains the same
+
+
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -200,4 +200,4 @@ let v2 = [4, 5, 6, 1, 2, 3];
 console.log("Key(3) found at: " + binarySearchRotated(v2, 3));
 console.log("Key(6) found at: " + binarySearchRotated(v2, 6));
 ```
-This solution works iteratively so te algo comes down to **``**
+This solution works iteratively so te algo comes down to **`O(1)`**
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -200,4 +200,4 @@ let v2 = [4, 5, 6, 1, 2, 3];
 console.log("Key(3) found at: " + binarySearchRotated(v2, 3));
 console.log("Key(6) found at: " + binarySearchRotated(v2, 6));
 ```
-This solution works iteratively so te algo comes down to **``
+This solution works iteratively so te algo comes down to **``**
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -200,4 +200,4 @@ let v2 = [4, 5, 6, 1, 2, 3];
 console.log("Key(3) found at: " + binarySearchRotated(v2, 3));
 console.log("Key(6) found at: " + binarySearchRotated(v2, 6));
 ```
-This solution works iteratively so te algo comes down to ``
+This solution works iteratively so te algo comes down to **``
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -200,4 +200,4 @@ let v2 = [4, 5, 6, 1, 2, 3];
 console.log("Key(3) found at: " + binarySearchRotated(v2, 3));
 console.log("Key(6) found at: " + binarySearchRotated(v2, 6));
 ```
-This solution works iteratively so te algo comes down to 
+This solution works iteratively so te algo comes down to ``
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -200,4 +200,4 @@ let v2 = [4, 5, 6, 1, 2, 3];
 console.log("Key(3) found at: " + binarySearchRotated(v2, 3));
 console.log("Key(6) found at: " + binarySearchRotated(v2, 6));
 ```
-This solution works iteratively so te al
+This solution works iteratively so te algo comes down to 
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -200,4 +200,4 @@ let v2 = [4, 5, 6, 1, 2, 3];
 console.log("Key(3) found at: " + binarySearchRotated(v2, 3));
 console.log("Key(6) found at: " + binarySearchRotated(v2, 6));
 ```
-This solution works iteratively so te 
+This solution works iteratively so te al
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -200,4 +200,4 @@ let v2 = [4, 5, 6, 1, 2, 3];
 console.log("Key(3) found at: " + binarySearchRotated(v2, 3));
 console.log("Key(6) found at: " + binarySearchRotated(v2, 6));
 ```
-This solution works iteratively
+This solution works iteratively so te 
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -200,4 +200,4 @@ let v2 = [4, 5, 6, 1, 2, 3];
 console.log("Key(3) found at: " + binarySearchRotated(v2, 3));
 console.log("Key(6) found at: " + binarySearchRotated(v2, 6));
 ```
-
+This solution works iteratively
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -150,7 +150,7 @@ The memory complexity of this solution is constant
 `O(1)`.
 
 
-```
+```javascript
 let binarySearchRotated = function(arr, key) {
 
   start = 0;
@@ -198,6 +198,6 @@ console.log("Key(6) found at: " + binarySearchRotated(v1, 6));
 let v2 = [4, 5, 6, 1, 2, 3];
 
 console.log("Key(3) found at: " + binarySearchRotated(v2, 3));
-console.log("Key(6) found at: " + binarySearchRotated(v2, 6)); 
+console.log("Key(6) found at: " + binarySearchRotated(v2, 6));
 ```
 
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -150,5 +150,54 @@ The memory complexity of this solution is constant
 `O(1)`.
 
 
+```
+let binarySearchRotated = function(arr, key) {
+
+  start = 0;
+  end = arr.length - 1;
+
+  if (start > end){
+    return -1;
+  }
+
+  while (start <= end){
+    mid = start + Math.floor((end - start) / 2);
+
+    if (arr[mid] == key){
+      return mid;
+    }
+
+    if (arr[start] <= arr[mid] && key <= arr[mid] && key >= arr[start]){
+      end = mid - 1;
+    }
+
+    else if (arr[mid] <= arr[end] && key >= arr[mid] && key <= arr[end]){
+      start = mid + 1;
+    }
+
+    else if (arr[end] <= arr[mid]){
+      start = mid + 1;
+    }
 
+    else if (arr[start] >= arr[mid]){
+      end = mid - 1;
+    }
+
+    else{
+      return -1;
+    }
+  }
+  return -1;
+};
+
+let v1 = [6, 7, 1, 2, 3, 4, 5];
+
+console.log("Key(3) found at: " + binarySearchRotated(v1, 3));
+console.log("Key(6) found at: " + binarySearchRotated(v1, 6));
+
+let v2 = [4, 5, 6, 1, 2, 3];
+
+console.log("Key(3) found at: " + binarySearchRotated(v2, 3));
+console.log("Key(6) found at: " + binarySearchRotated(v2, 6)); 
+```
 
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -150,3 +150,5 @@ The memory complexity of this solution is constant
 `O(1)`.
 
 
+
+
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -146,6 +146,7 @@ The runtime complexity of this solution is logarithmic
  `O(log n)`.
 
 ### Memory complexity
-The memory complexity of this solution is constant, `O(1)`.
+The memory complexity of this solution is constant
+`O(1)`.
 
 
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -146,6 +146,6 @@ The runtime complexity of this solution is logarithmic
  `O(log n)`.
 
 ### Memory complexity
-The memory complexity of this solution is constant, O(1)O(1)`.
+The memory complexity of this solution is constant, `O(1)`.
 
 
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -146,6 +146,6 @@ The runtime complexity of this solution is logarithmic
  `O(log n)`.
 
 ### Memory complexity
-The memory complexity of this solution is constant, O(1)O(1).
+The memory complexity of this solution is constant, O(1)O(1)`.
 
 
diff --git a/2-RotatedArray.md b/2-RotatedArray.md
@@ -143,7 +143,7 @@ Solution 2: Iterative
 
 ### Runtime complexity
 The runtime complexity of this solution is logarithmic
-, `O(log n)`.
+ `O(log n)`.
 
 ### Memory complexity
 The memory complexity of this solution is constant, O(1)O(1).
Original file line number	Diff line number	Diff line change
		@@ -202,4 +202,3 @@ console.log("Key(6) found at: " + binarySearchRotated(v2, 6));
		```
		This solution works iteratively so te algo comes down to `O(1)` even though the logic remains the same
Original file line number	Diff line number	Diff line change
		@@ -150,3 +150,5 @@ The memory complexity of this solution is constant
		`O(1)`.