Day-26 q3: Find first and last position of element in sorted array

[Smita-Maurya]

Given 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.

Example 1:

Input: nums = [5,7,7,8,8,10], target = 8
Output: [3,4]

[Akansha77]

please assign this issue to me.

[Kalpana8055]

@bh-g this issue assign to me

[namita0210]

Pls assign this issue to me @bh-g

[Anomasingh]

Please assign this issue to me @bh-g .

[Tech-neophyte]

Plz assign for python soln... @bh-g

[Karnankita04]

@bh-g please assign this issue to me:)

[aishwarya-chandra]

Please assign this issue to me

[Shubh-Krishna]

please assign this question to me :) @bh-g

[Shruti-jha6]

please assign this issue to me @bh-g

[sriya-singh]

@bh-g @kratika-Jangid @karishma-2020 please assign this issue to me for cpp solution.

[priyagupta20044]

Please assign this issue to me @bh-g .

[avanimathur]

Please assign it to me @bh-g @kratika-Jangid