[NEW ALGORITHM] Find First and Last Position of Elements in Sorted Array

[Dipanita45]

Issue will be closed if:

1. You mention more than one algorithm. You can create a separate issue for each algorithm once the current one is completed.
2. You propose an algorithm that is already present or has been mentioned in a previous issue.
3. You create a new issue without completing your previous issue.

Note: These actions will be taken seriously. Failure to follow the guidelines may result in the immediate closure of your issue.

---

Name:

[NEW ALGORITHM] Find First and Last Position of Elements in Sorted Array

About:

iven an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value.
If target is not found in the array, return [-1, -1].
You must write an algorithm with O(log n) runtime complexity.

---

Labels:

new algorithm, gssoc-ext, hacktoberfest, level1

---

Assignees:

• [yes] Contributor in GSSoC-ext
• [yes] Want to work on it

Please assign me
@pankaj-bind