{"id":18266198,"url":"https://github.com/arindal1/blind75-proelevate","last_synced_at":"2025-04-09T02:19:09.019Z","repository":{"id":242035212,"uuid":"808463446","full_name":"arindal1/Blind75-ProElevate","owner":"arindal1","description":"This Blind 75 DSA sheet from LeetCode contains all the important DSA questions and is designed for quick interview preparation.","archived":false,"fork":false,"pushed_at":"2024-06-05T16:31:19.000Z","size":26,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-14T20:40:18.974Z","etag":null,"topics":["algorithms","cpp","data-structures","dsa","leetcode","leetcode-cpp","leetcode-solutions","problem-solving"],"latest_commit_sha":null,"homepage":"https://www.proelevate.in/dsa-practice/leetcode-blind-75","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/arindal1.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-05-31T06:00:53.000Z","updated_at":"2024-06-05T16:31:23.000Z","dependencies_parsed_at":"2025-02-14T20:37:17.838Z","dependency_job_id":"0104fd4e-ae15-4eb2-8f81-498b71d38f89","html_url":"https://github.com/arindal1/Blind75-ProElevate","commit_stats":null,"previous_names":["arindal1/blind75-proelevate"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arindal1%2FBlind75-ProElevate","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arindal1%2FBlind75-ProElevate/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arindal1%2FBlind75-ProElevate/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arindal1%2FBlind75-ProElevate/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/arindal1","download_url":"https://codeload.github.com/arindal1/Blind75-ProElevate/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247962605,"owners_count":21024871,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","cpp","data-structures","dsa","leetcode","leetcode-cpp","leetcode-solutions","problem-solving"],"created_at":"2024-11-05T11:22:26.641Z","updated_at":"2025-04-09T02:19:08.991Z","avatar_url":"https://github.com/arindal1.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Blind 75 by ProElevate\n\n![image](https://www.proelevate.in/assets/Common/Logo.svg)\n\n[ProElevate](https://www.proelevate.in/) is your one-stop destination for DSA practice, interview experiences, and career opportunities. \u003cbr\u003e\nThis [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. \u003cbr\u003e\n\n## Arrays, Hashing, Binary Search\n\n| Problem Name                        | Difficulty | Source                                                                                       | Solution |\n|:-------------------------------------|:------------:|:----------------------------------------------------------------------------------------------:|:----------:|\n| 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)        |\n| 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)         |\n| 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)         |\n| 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)         |\n| 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)         |\n| 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)         |\n| 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)         |\n| 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)         |\n| 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)         |\n| 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)         |\n\n## Bit Manipulation\n\n| Problem Name                        | Difficulty | Source                                                                                       | Solution |\n|:-------------------------------------|:------------:|:----------------------------------------------------------------------------------------------:|:----------:|\n| 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)         |\n| 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)         |\n| 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)         |\n| 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)         |\n| 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)         |\n\n## Dynamic Programming\n\n| Problem Name                    | Difficulty | Source                                                                                      | Solution |\n|:-------------------------------------|:------------:|:----------------------------------------------------------------------------------------------:|:----------:|\n| 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)        |\n| 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)        |\n| 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)       |\n| 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)        |\n| 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)         |\n| 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)         |\n| 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)         |\n| 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)         |\n| 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)         |\n| 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)         |\n| 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)         |\n\n## Graph\n\n| Problem Name                    | Difficulty | Source                                                                                      | Solution |\n|:-------------------------------------|:------------:|:----------------------------------------------------------------------------------------------:|:----------:|\n| 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) |\n| 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) |\n| 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) |\n| Number of Islands                                                        | MEDIUM 🟡 | [LINK 🔗](https://leetcode.com/problems/number-of-islands/description/)                                     | ⛔ |\n| 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) |\n| Alien Dictionary (Premium)                                      | HARD 🔴   | [LINK 🔗](https://leetcode.com/problems/alien-dictionary/description/)                                      | ⛔ |\n| Graph Valid Tree (Premium)                                      | MEDIUM 🟡 | [LINK 🔗](https://leetcode.com/problems/graph-valid-tree/)                                                  | ⛔ |\n| Number of Connected Components In an Undirected Graph (Premium) | MEDIUM 🟡 | [LINK 🔗](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/description/) | ⛔ |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Farindal1%2Fblind75-proelevate","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Farindal1%2Fblind75-proelevate","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Farindal1%2Fblind75-proelevate/lists"}