- Find the duplicate number: findDuplicate Concepts: pigeonhole principle, binary Search on answer space, hashmap
- Merge intervals: merge Concepts: Sorting, greedy
- Best time to buy and sell stock: maxProfit
- Kth smallest
- Move all negative numbers to beginning and positive to end with constant space: moveNegativePositive
- Union of array with duplicates: findUnion
- Next permutation: nextPermutation
- Two sum pairs with 0 sum: getPairs
- Common in 3 sorted arrays: commonElements
- Sort 0s, 1s and 2s: sort012
- Rearrange Array Elements by Sign: rearrange
- Kadane's algorithm: maxSubarraySum
- Chocolate Distribution Problem: findMidDiff
- Rotate by one clockwise: rotate
- More than n/k occurances: countOccurance
- Minimize the Heights II:
- Stock buy and sell - Max 2 transactions allowed: maxProfit
- Minimum Jumps: minJumps
-
Notifications
You must be signed in to change notification settings - Fork 0
Arup3201/python-dsa
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published