Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/arindal1/blind75-proelevate
This Blind 75 DSA sheet from LeetCode contains all the important DSA questions and is designed for quick interview preparation.
https://github.com/arindal1/blind75-proelevate
algorithms cpp data-structures dsa leetcode leetcode-cpp leetcode-solutions problem-solving
Last synced: 25 days ago
JSON representation
This Blind 75 DSA sheet from LeetCode contains all the important DSA questions and is designed for quick interview preparation.
- Host: GitHub
- URL: https://github.com/arindal1/blind75-proelevate
- Owner: arindal1
- License: mit
- Created: 2024-05-31T06:00:53.000Z (8 months ago)
- Default Branch: main
- Last Pushed: 2024-06-05T16:31:19.000Z (7 months ago)
- Last Synced: 2024-11-05T11:28:04.809Z (2 months ago)
- Topics: algorithms, cpp, data-structures, dsa, leetcode, leetcode-cpp, leetcode-solutions, problem-solving
- Language: C++
- Homepage: https://www.proelevate.in/dsa-practice/leetcode-blind-75
- Size: 25.4 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Blind 75 by ProElevate
[ProElevate](https://www.proelevate.in/) is your one-stop destination for DSA practice, interview experiences, and career opportunities.
This [Blind75](https://www.proelevate.in/dsa-practice/leetcode-blind-75) DSA sheet from LeetCode contains all the important DSA questions and is designed for quick interview preparation.
## Arrays, Hashing, Binary Search
| Problem Name | Difficulty | Source | Solution |
|:-------------------------------------|:------------:|:----------------------------------------------------------------------------------------------:|:----------:|
| Two Sum | EASY 🟢 | [LINK 🔗 ](https://leetcode.com/problems/two-sum/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/1%20-%20array%2C%20hashing%2C%20binary%20search/1.TwoSum.cpp) |
| Best Time to Buy and Sell Stock | EASY 🟢 | [LINK 🔗 ](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/1%20-%20array%2C%20hashing%2C%20binary%20search/2.BestTimeToBuyAndSellStock.cpp) |
| Contains Duplicate | EASY 🟢 | [LINK 🔗 ](https://leetcode.com/problems/contains-duplicate/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/1%20-%20array%2C%20hashing%2C%20binary%20search/3.ContainsDuplicate.cpp) |
| Product of Array Except Self | MEDIUM 🟡 | [LINK 🔗 ](https://leetcode.com/problems/product-of-array-except-self/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/1%20-%20array%2C%20hashing%2C%20binary%20search/4.ProductOfArrayExceptSelf.cpp) |
| Maximum Subarray (Kadane's Algorithm) | MEDIUM 🟡 | [LINK 🔗 ](https://leetcode.com/problems/maximum-subarray/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/1%20-%20array%2C%20hashing%2C%20binary%20search/5.MaximumSubarray.cpp) |
| Maximum Product Subarray | MEDIUM 🟡 | [LINK 🔗 ](https://leetcode.com/problems/maximum-product-subarray/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/1%20-%20array%2C%20hashing%2C%20binary%20search/6.MaximumProductSubarray.cpp) |
| Find Minimum in Rotated Sorted Array | MEDIUM 🟡 | [LINK 🔗 ](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/1%20-%20array%2C%20hashing%2C%20binary%20search/7.FindMinimumInRotatedSortedArray.cpp) |
| Search in Rotated Sorted Array | MEDIUM 🟡 | [LINK 🔗 ](https://leetcode.com/problems/search-in-rotated-sorted-array/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/1%20-%20array%2C%20hashing%2C%20binary%20search/8.SearchInRotatedSortedArray.cpp) |
| Three Sum | MEDIUM 🟡 | [LINK 🔗 ](https://leetcode.com/problems/3sum/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/1%20-%20array%2C%20hashing%2C%20binary%20search/9.ThreeSum.cpp) |
| Container With Most Water | MEDIUM 🟡 | [LINK 🔗 ](https://leetcode.com/problems/container-with-most-water/description/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/1%20-%20array%2C%20hashing%2C%20binary%20search/10.ContainerWithMostWater.cpp) |
## Bit Manipulation
| Problem Name | Difficulty | Source | Solution |
|:-------------------------------------|:------------:|:----------------------------------------------------------------------------------------------:|:----------:|
| Sum of Two Integers | MEDIUM 🟡 | [LINK 🔗 ](https://leetcode.com/problems/sum-of-two-integers/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/2%20-%20bit%20manipulation/1.SumOfTwoIntegers.cpp) |
| Number of 1 Bits | EASY 🟢 | [LINK 🔗 ](https://leetcode.com/problems/number-of-1-bits/description/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/2%20-%20bit%20manipulation/2.NumberOf1Bits.cpp) |
| Counting Bits | EASY 🟢 | [LINK 🔗 ](https://leetcode.com/problems/counting-bits/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/2%20-%20bit%20manipulation/3.CountingBits.cpp) |
| Missing Number | EASY 🟢 | [LINK 🔗 ](https://leetcode.com/problems/missing-number/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/2%20-%20bit%20manipulation/4.MissingNumber.cpp) |
| Reverse Bits | EASY 🟢 | [LINK 🔗 ](https://leetcode.com/problems/reverse-bits/description/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/2%20-%20bit%20manipulation/5.ReverseBits.cpp) |
## Dynamic Programming
| Problem Name | Difficulty | Source | Solution |
|:-------------------------------------|:------------:|:----------------------------------------------------------------------------------------------:|:----------:|
| Climbing Stairs | EASY 🟢 | [LINK 🔗](https://leetcode.com/problems/climbing-stairs/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/3%20-%20dynamic%20programming/1.ClimbingStairs.cpp) |
| Coin Change | MEDIUM 🟡 | [LINK 🔗](https://leetcode.com/problems/coin-change/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/3%20-%20dynamic%20programming/2.CoinChange.cpp) |
| Longest Increasing Subsequence | MEDIUM 🟡 | [LINK 🔗](https://leetcode.com/problems/longest-increasing-subsequence/description/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/3%20-%20dynamic%20programming/3.LongestIncreasingSubsequence.cpp) |
| Longest Common Subsequence | MEDIUM 🟡 | [LINK 🔗](https://leetcode.com/problems/longest-common-subsequence/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/3%20-%20dynamic%20programming/4.LongestCommonSubsequence.cpp) |
| Word Break | MEDIUM 🟡 | [LINK 🔗](https://leetcode.com/problems/word-break/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/3%20-%20dynamic%20programming/5.WordBreak.cpp) |
| Combination Sum | MEDIUM 🟡 | [LINK 🔗](https://leetcode.com/problems/combination-sum-iii/description/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/3%20-%20dynamic%20programming/6.CombinationalSum.cpp) |
| House Robber | MEDIUM 🟡 | [LINK 🔗](https://leetcode.com/problems/house-robber/description/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/3%20-%20dynamic%20programming/7.HouseRobber.cpp) |
| House Robber II | MEDIUM 🟡 | [LINK 🔗](https://leetcode.com/problems/house-robber-ii/description/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/3%20-%20dynamic%20programming/8.HouseRobberII.cpp) |
| Decode Ways | MEDIUM 🟡 | [LINK 🔗](https://leetcode.com/problems/decode-ways/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/3%20-%20dynamic%20programming/9.DecodeWays.cpp) |
| Unique Paths | MEDIUM 🟡 | [LINK 🔗](https://leetcode.com/problems/unique-paths/description/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/3%20-%20dynamic%20programming/10.UniquePaths.cpp) |
| Jump Game | MEDIUM 🟡 | [LINK 🔗](https://leetcode.com/problems/jump-game/description/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/3%20-%20dynamic%20programming/11.JumpGame.cpp) |
## Graph
| Problem Name | Difficulty | Source | Solution |
|:-------------------------------------|:------------:|:----------------------------------------------------------------------------------------------:|:----------:|
| Clone Graph | MEDIUM 🟡 | [LINK 🔗](https://leetcode.com/problems/clone-graph/description/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/4%20-%20graph/1.CloneGraph.cpp) |
| Course Shedule | MEDIUM 🟡 | [LINK 🔗](https://leetcode.com/problems/course-schedule/description/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/4%20-%20graph/2.CourseShedule.cpp) |
| Pacific Atlantic Water Flow | MEDIUM 🟡 | [LINK 🔗](https://leetcode.com/problems/pacific-atlantic-water-flow/description/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/4%20-%20graph/3.PacificAtlanticWaterFlow.cpp) |
| Number of Islands | MEDIUM 🟡 | [LINK 🔗](https://leetcode.com/problems/number-of-islands/description/) | ⛔ |
| Longest Common Subsequence | MEDIUM 🟡 | [LINK 🔗](https://leetcode.com/problems/longest-common-subsequence/description/) | [✅](https://github.com/arindal1/Blind75-ProElevate/blob/main/3%20-%20dynamic%20programming/4.LongestCommonSubsequence.cpp) |
| Alien Dictionary (Premium) | HARD 🔴 | [LINK 🔗](https://leetcode.com/problems/alien-dictionary/description/) | ⛔ |
| Graph Valid Tree (Premium) | MEDIUM 🟡 | [LINK 🔗](https://leetcode.com/problems/graph-valid-tree/) | ⛔ |
| Number of Connected Components In an Undirected Graph (Premium) | MEDIUM 🟡 | [LINK 🔗](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/description/) | ⛔ |