Search Insert Position | Day 10 | [June LeetCoding Challenge] [Leetcode #35] [2020]

preview_player
Показать описание
The day 10 problem in June Leetcoding Challenge. ( Search Insert Position ).

Problem statement:
Given a sorted array 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 may assume no duplicates in the array.

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

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

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

Example 4:
Input: [1,3,5,6], 0
Output: 0

If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful.

#coding #leetcode #softwareengineering #algorithmsMadeEasy
Рекомендации по теме
Комментарии
Автор

I hope you all are enjoying the June leetcoding challenge!!! Don't forget to leave a comment!!! Please like the video to support us!!!
Struggling in a question??
Leave in a comment and we will make a video!!!🙂🙂🙂

AlgorithmsMadeEasy
Автор

why return left at the end ? could you please explain ?

banrg