feat: 34_find_first_and_last_position_of_element_in_sorted_array

34_find_first_and_last_position_of_element_in_sorted_array/main.cpp

@@ -0,0 +1,16 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+class Solution {
+   public:
+    vector<int> searchRange(vector<int>& nums, int target) {
+        if (!binary_search(nums.begin(), nums.end(), target)) {
+            return {-1, -1};
+        }
+
+        auto first = lower_bound(nums.begin(), nums.end(), target);
+        auto second = upper_bound(nums.begin(), nums.end(), target);
+
+        return {(int)(first - nums.begin()), (int)(second - nums.begin() - 1)};
+    }
+};