From 95b42f14a1e16fc44c4646d9fcf01bee1fda3def Mon Sep 17 00:00:00 2001 From: "github-actions[bot]" Date: Thu, 21 Sep 2023 07:24:31 +0000 Subject: [PATCH] Formatted the code --- .../Binary-Search/03-search-insert-position.md | 2 +- .../Binary-Search/07-search-in-rotated-sorted-unique-array.md | 2 +- .../08-search-in-rotated-sorted-duplicate-array.md | 2 +- .../Binary-Search/09-minimum-in-sorted-rotated.md | 2 +- 4 files changed, 4 insertions(+), 4 deletions(-) diff --git a/Algorithms/Searching-Algorithms/Binary-Search/03-search-insert-position.md b/Algorithms/Searching-Algorithms/Binary-Search/03-search-insert-position.md index cd28ec3..1723458 100644 --- a/Algorithms/Searching-Algorithms/Binary-Search/03-search-insert-position.md +++ b/Algorithms/Searching-Algorithms/Binary-Search/03-search-insert-position.md @@ -73,4 +73,4 @@ Explanation : 7 isn't present in the array so 4 will be the index where 7 would **Solve it on :** [Coding Ninjas](https://www.codingninjas.com/studio/problems/algorithm-to-find-best-insert-position-in-sorted-array_839813?utm_source=striver&utm_medium=website&utm_campaign=a_zcoursetuf) & -[LeetCode](https://leetcode.com/problems/search-insert-position/#:~:text=Search%20Insert%20Position%20%2D%20LeetCode&text=Given%20a%20sorted%20array%20of,(log%20n)%20runtime%20complexity). +[LeetCode](). diff --git a/Algorithms/Searching-Algorithms/Binary-Search/07-search-in-rotated-sorted-unique-array.md b/Algorithms/Searching-Algorithms/Binary-Search/07-search-in-rotated-sorted-unique-array.md index 87c4cc5..8d093de 100644 --- a/Algorithms/Searching-Algorithms/Binary-Search/07-search-in-rotated-sorted-unique-array.md +++ b/Algorithms/Searching-Algorithms/Binary-Search/07-search-in-rotated-sorted-unique-array.md @@ -223,4 +223,4 @@ int search(vector& arr, int n, int k) **Solve it on :** [Coding Ninjas](https://www.codingninjas.com/studio/problems/search-in-rotated-sorted-array_1082554?utm_source=striver&utm_medium=website&utm_campaign=a_zcoursetuf) & -[LeetCode](https://leetcode.com/problems/search-in-rotated-sorted-array/). \ No newline at end of file +[LeetCode](https://leetcode.com/problems/search-in-rotated-sorted-array/). diff --git a/Algorithms/Searching-Algorithms/Binary-Search/08-search-in-rotated-sorted-duplicate-array.md b/Algorithms/Searching-Algorithms/Binary-Search/08-search-in-rotated-sorted-duplicate-array.md index 556aa8a..e9550e7 100644 --- a/Algorithms/Searching-Algorithms/Binary-Search/08-search-in-rotated-sorted-duplicate-array.md +++ b/Algorithms/Searching-Algorithms/Binary-Search/08-search-in-rotated-sorted-duplicate-array.md @@ -110,4 +110,4 @@ bool searchInARotatedSortedArrayII(vector&arr, int target) { **Solve it on :** [Coding Ninjas](https://www.codingninjas.com/studio/problems/search-in-a-rotated-sorted-array-ii_7449547?utm_source=striver&utm_medium=website&utm_campaign=a_zcoursetuf) & -[LeetCode](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/). \ No newline at end of file +[LeetCode](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/). diff --git a/Algorithms/Searching-Algorithms/Binary-Search/09-minimum-in-sorted-rotated.md b/Algorithms/Searching-Algorithms/Binary-Search/09-minimum-in-sorted-rotated.md index ca61a9b..abc6e51 100644 --- a/Algorithms/Searching-Algorithms/Binary-Search/09-minimum-in-sorted-rotated.md +++ b/Algorithms/Searching-Algorithms/Binary-Search/09-minimum-in-sorted-rotated.md @@ -33,4 +33,4 @@ int findMin(vector& arr) **Solve it on :** [Coding Ninjas](https://www.codingninjas.com/studio/problems/rotated-array_1093219?utm_source=striver&utm_medium=website&utm_campaign=a_zcoursetuf) & -[LeetCode](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/). \ No newline at end of file +[LeetCode](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/).