LeetcodeRush
diff --git a/‎Problems/.DS_Store
0 Bytes b/‎Problems/.DS_Store
0 Bytes
diff --git a/‎Problems/12-Find-First-and-Last-Position-of-Element-in-Sorted-Array/Find-First-and-Last-Position-of-Element-in-Sorted-Array.cpp
Lines changed: 48 additions & 0 deletions b/‎Problems/12-Find-First-and-Last-Position-of-Element-in-Sorted-Array/Find-First-and-Last-Position-of-Element-in-Sorted-Array.cpp
Lines changed: 48 additions & 0 deletions
@@ -0,0 +1,48 @@
+class Solution {
+public:
+    vector<int> searchRange(vector<int>& nums, int target) {
+        int n = nums.size();
+        int left = 0, right = n-1;
+        int first = -1;
+        while (left <= right)
+        {
+            int mid = (right - left ) / 2 + left;
+            if (nums[mid] == target)
+            {
+                first = mid;
+                right = mid - 1;
+            }
+            else if (nums[mid] < target)
+            {
+                left = mid + 1;
+            }
+            else
+            {
+                right = mid - 1;
+            }
+        }
+
+        if (first == -1) return {-1, -1};
+
+        int last = -1;
+        left = 0, right = n-1;
+        while (left <= right)
+        {
+            int mid = (right - left ) / 2 + left;
+            if (nums[mid] == target)
+            {
+                last = mid;
+                left = mid + 1;
+            }
+            else if (nums[mid] < target)
+            {
+                left = mid + 1;
+            }
+            else
+            {
+                right = mid - 1;
+            }
+        }
+        return {first, last};
+    }
+};