revamp

elarabyelaidy19 · May 13, 2022 · cae09a7 · cae09a7
1 parent f9b4ec9
commit cae09a7
Show file tree

Hide file tree

Showing 67 changed files with 27 additions and 860 deletions.
diff --git a/Gem/Array/Arrays1.java → Array/Arrays1.java b/Gem/Array/Arrays1.java → Array/Arrays1.java
diff --git a/Gem/Array/Arrays2.java → Array/Arrays2.java b/Gem/Array/Arrays2.java → Array/Arrays2.java
diff --git a/Gem/Array/Grid1.java → Array/Grid1.java b/Gem/Array/Grid1.java → Array/Grid1.java
diff --git a/Gem/Array/Grid2.java → Array/Grid2.java b/Gem/Array/Grid2.java → Array/Grid2.java
diff --git a/Gem/Array/arrays.md → Array/arrays.md b/Gem/Array/arrays.md → Array/arrays.md
diff --git a/Gem/Array/grids.md → Array/grids.md b/Gem/Array/grids.md → Array/grids.md
diff --git a/BinarySearch/BinarySearch.java b/BinarySearch/BinarySearch.java
@@ -0,0 +1,18 @@
+package Gem.BinarySearch;
+
+public class BinarySearch { 
+    // 
+    int peakIndexMountainArray(int[] arr) {
+        int l = 0;
+        int r = arr.length - 1;
+        int m = 0;
+        while (r > l) {
+            m = (l + r) / 2;
+            if (arr[m] < arr[m + 1])
+                l = m + 1;
+            else
+                r = m;
+        }
+        return l;
+    }
+}
diff --git a/BinarySearch/BinarySearch.md b/BinarySearch/BinarySearch.md
@@ -0,0 +1,4 @@
+
+# [PeakMountainIndexArray](https://leetcode.com/problems/peak-index-in-a-mountain-array/) 
+- search for the first number that is greater than its neighbors. arr[i] > arr[i+1] 
+- binary search array, return the index of the number at left if it is greater than its neighbors. 
diff --git a/Blind75/java/array/ConatinDuplicates.java b/Blind75/java/array/ConatinDuplicates.java
diff --git a/Blind75/java/array/MaxSubarraySum.java b/Blind75/java/array/MaxSubarraySum.java
diff --git a/Blind75/java/array/ProductOfArrayExceptItSelf.java b/Blind75/java/array/ProductOfArrayExceptItSelf.java
diff --git a/Blind75/java/array/Stocks.java b/Blind75/java/array/Stocks.java
diff --git a/Blind75/java/array/TwoSum.java b/Blind75/java/array/TwoSum.java
diff --git a/Blind75/ruby/array/122_stock.rb b/Blind75/ruby/array/122_stock.rb
diff --git a/Blind75/ruby/array/contains_duplicates.rb b/Blind75/ruby/array/contains_duplicates.rb
diff --git a/Blind75/ruby/array/max_subarray_sum.rb b/Blind75/ruby/array/max_subarray_sum.rb
diff --git a/Blind75/ruby/array/product_except_self.rb b/Blind75/ruby/array/product_except_self.rb
diff --git a/Blind75/ruby/array/two_sum.rb b/Blind75/ruby/array/two_sum.rb
diff --git a/Gem/Deque/Deques.java → Deque/Deques.java b/Gem/Deque/Deques.java → Deque/Deques.java
diff --git a/Gem/Deque/notes.md → Deque/notes.md b/Gem/Deque/notes.md → Deque/notes.md
diff --git a/Gem/Design/PeekingIterator.java → Design/PeekingIterator.java b/Gem/Design/PeekingIterator.java → Design/PeekingIterator.java
diff --git a/Gem/Design/UndergroundSystem.java → Design/UndergroundSystem.java b/Gem/Design/UndergroundSystem.java → Design/UndergroundSystem.java
diff --git a/Gem/Design/design.md → Design/design.md b/Gem/Design/design.md → Design/design.md
diff --git a/Gem/LinkedList/LList.java → LinkedList/LList.java b/Gem/LinkedList/LList.java → LinkedList/LList.java
diff --git a/Gem/LinkedList/LinkedList.java → LinkedList/LinkedList.java b/Gem/LinkedList/LinkedList.java → LinkedList/LinkedList.java
diff --git a/Gem/LinkedList/list.md → LinkedList/list.md b/Gem/LinkedList/list.md → LinkedList/list.md
diff --git a/Gem/Loop/Loop.java → Loop/Loop.java b/Gem/Loop/Loop.java → Loop/Loop.java
diff --git a/Gem/Loop/Loop2.java → Loop/Loop2.java b/Gem/Loop/Loop2.java → Loop/Loop2.java
diff --git a/Gem/Loop/Notes.md → Loop/Notes.md b/Gem/Loop/Notes.md → Loop/Notes.md
diff --git a/Gem/MST/MST.java → MST/MST.java b/Gem/MST/MST.java → MST/MST.java
diff --git a/Gem/MST/notes.md → MST/notes.md b/Gem/MST/notes.md → MST/notes.md