Search Insert Position

[Aishwarya-S-Sharma]

Problem
Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You must write an algorithm with O(log n) runtime complexity.

Example 1:
Input: nums = [1,3,5,6], target = 5
Output: 2

Example 2:
Input: nums = [1,3,5,6], target = 2
Output: 1

Example 3:
Input: nums = [1,3,5,6], target = 7
Output: 4

[github-actions]

@Aishwarya-S-Sharma

Welcome to the Project!

Thank you for opening this Issue 🙌! We’re thrilled to have you join us for Hacktoberfest 💖. We’ll review your submission and get back to you shortly.

In the meantime, please remember to give this repo a star! ⭐ We appreciate your contribution!

[Aishwarya-S-Sharma]

Hii @Kushal997-das please assign this issue to me

[aryanayush012]

please assign this issue to me

[shalupatidar22]

Hii @Kushal997-das I want to solve this issue please assign this issue to me

[NimraAslamkhan]

Hi there!
I am the Mentor of this project.
Although this repo is not part of Hacktoberfest 2024, we have some great alternatives for you. Welcome to SkillShow, a repository focused on skill enhancement!

Guidelines:

• Please adhere to the existing guidelines.
• No additional rules, thanks!
• Check it out here: SkillShow.

Note: Start by creating an issue. Once it’s assigned to you, feel free to open a pull request (PR). Directly opening a PR will lead to an invalid label.

Looking forward to your contributions!