From 30e6694c4b80c5d31a3f75b22cd66a8473b22a9a Mon Sep 17 00:00:00 2001 From: Zahran <108330797+iiZtZahran@users.noreply.github.com> Date: Sat, 23 Nov 2024 07:09:23 +0200 Subject: [PATCH] Create README - LeetHub --- 0035-search-insert-position/README.md | 35 +++++++++++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 0035-search-insert-position/README.md diff --git a/0035-search-insert-position/README.md b/0035-search-insert-position/README.md new file mode 100644 index 0000000..f7e96ce --- /dev/null +++ b/0035-search-insert-position/README.md @@ -0,0 +1,35 @@ +

35. Search Insert Position

Easy

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
+
+ +

 

+

Constraints:

+ +