Commit abaaf8a

committed

Added new solutions

1 parent fe21aa1 commit abaaf8aCopy full SHA for abaaf8a

File tree

+49

-0

lines changed

+49

-0

lines changed

Lines changed: 3 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,4 +6,7 @@ This repository contains my answers to all Leetcode/HackerRank algorithm questio`
`6`	`6`	`\| # \| Problem \| Solution \|`
`7`	`7`	`\| :----: \| :-----------------------------: \| :----: \|`
`8`	`8`	`\| 1 \| [Two Sum](https://leetcode.com/problems/two-sum/)\| [python3](https://github.com/sushant097/Data-Structure-Algorithms-Collections-Python/blob/master/coding_solutions/interview_related/TwoSum.py) \|`
	`9`	`+\| 2 \| [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)\| [python3](https://github.com/sushant097/Data-Structure-Algorithms-Collections-Python/blob/master/coding_solutions/interview_related/AddTwoNum.py) \|`
	`10`	`+\| 3 \| [Two Sum](https://leetcode.com/problems/two-sum/)\| [python3](https://github.com/sushant097/Data-Structure-Algorithms-Collections-Python/blob/master/coding_solutions/interview_related/TwoSum.py) \|`
	`11`	`+\| 4 \| [Two Sum](https://leetcode.com/problems/two-sum/)\| [python3](https://github.com/sushant097/Data-Structure-Algorithms-Collections-Python/blob/master/coding_solutions/interview_related/TwoSum.py) \|`
`9`	`12`

Whitespace-only changes.

Lines changed: 46 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,46 @@`
	`1`	`+# clear explanation: https://www.youtube.com/watch?v=oTfPJKGEHcc`
	`2`	`+`
	`3`	`+'''`
	`4`	`+Approach: Binary Search`
	`5`	`+`
	`6`	`+Point to note: In a rotated sorted array, when doing binary search, one side will always be sorted and other side will always be incorrectly sorted if`
	`7`	`+pivot index k (1 <= k < nums.length)`
	`8`	`+`
	`9`	`+`
	`10`	`+1. find mid.`
	`11`	`+2. if left side is sorted`
	`12`	`+ - if target is within left limits, binary search on left`
	`13`	`+ - else binary search on right`
	`14`	`+3 else (if left side is not sorted, right side is sorted)`
	`15`	`+ - if target is within right limits, binary search on right`
	`16`	`+ - else binary search on left`
	`17`	`+`
	`18`	`+`
	`19`	`+'''`
	`20`	`+`
	`21`	`+class Solution:`
	`22`	`+ def search(self, nums: List[int], target: int) -> int:`
	`23`	`+ l, r = 0, len(nums) - 1`
	`24`	`+`
	`25`	`+ while l <= r:`
	`26`	`+ m = l + (r-l) // 2`
	`27`	`+ if nums[m] == target:`
	`28`	`+ return m`
	`29`	`+`
	`30`	`+ elif nums[m] >= nums[l]: # strictly increasing`
	`31`	`+ if target <= nums[m] and target >=nums[l]:`
	`32`	`+ # search in left part`
	`33`	`+ r = m - 1`
	`34`	`+ else:`
	`35`	`+ # search in right part`
	`36`	`+ l = m + 1`
	`37`	`+ else:`
	`38`	`+ if target >= nums[m] and target <= nums[r]:`
	`39`	`+ # search in right part`
	`40`	`+ l = m + 1`
	`41`	`+ else:`
	`42`	`+ # search in left part`
	`43`	`+ r = m - 1`
	`44`	`+`
	`45`	`+ return -1`
	`46`	`+`

Comments

(0)