{"id":23085152,"url":"https://github.com/ankitsamaddar/blind75_cpp_solutions","last_synced_at":"2025-09-16T09:51:53.907Z","repository":{"id":229915653,"uuid":"609632658","full_name":"ankitsamaddar/blind75_cpp_solutions","owner":"ankitsamaddar","description":"Blind 75 cpp solutions of Neetcode YT. Other cpp basics practice programs solutions.","archived":false,"fork":false,"pushed_at":"2024-03-31T10:53:10.000Z","size":204,"stargazers_count":7,"open_issues_count":0,"forks_count":2,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-14T07:13:30.597Z","etag":null,"topics":["blind75","cpp-solutions","leetcode-cpp","leetcode-solutions","neetcode"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ankitsamaddar.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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":"2023-03-04T19:07:58.000Z","updated_at":"2025-06-02T18:14:57.000Z","dependencies_parsed_at":"2024-03-31T11:32:13.858Z","dependency_job_id":"2e822854-c987-4582-957c-7d630a914a98","html_url":"https://github.com/ankitsamaddar/blind75_cpp_solutions","commit_stats":null,"previous_names":["ankitsamaddar/blind75_cpp_solutions"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ankitsamaddar/blind75_cpp_solutions","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ankitsamaddar%2Fblind75_cpp_solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ankitsamaddar%2Fblind75_cpp_solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ankitsamaddar%2Fblind75_cpp_solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ankitsamaddar%2Fblind75_cpp_solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ankitsamaddar","download_url":"https://codeload.github.com/ankitsamaddar/blind75_cpp_solutions/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ankitsamaddar%2Fblind75_cpp_solutions/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":275399182,"owners_count":25457779,"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","status":"online","status_checked_at":"2025-09-16T02:00:10.229Z","response_time":65,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["blind75","cpp-solutions","leetcode-cpp","leetcode-solutions","neetcode"],"created_at":"2024-12-16T17:49:49.320Z","updated_at":"2025-09-16T09:51:53.882Z","avatar_url":"https://github.com/ankitsamaddar.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# cpp_solutions\n\n Cpp solutions to some coding problems.\n\n\n## Table Of Contents\n\n- [cpp\\_solutions](#cpp_solutions)\n  - [cpp-basics](#cpp-basics)\n  - [cpp-blind-75](#cpp-blind-75)\n    - [Array](#array)\n    - [Binary](#binary)\n    - [Matrix](#matrix)\n    - [Linked List](#linked-list)\n    - [String](#string)\n    - [Heap](#heap)\n    - [Interval](#interval)\n    - [Tree](#tree)\n    - [Graph](#graph)\n    - [Dynamic Programming](#dynamic-programming)\n\n\u003cdetails\u003e\n\u003csummary\u003e\n## [cpp-basics](./cpp-basics)\n\u003c/summary\u003e\n\nThe [cpp-basics](./cpp-basics/README.md) contains basic programs learning C++ language.\n\u003c/details\u003e\n\n## [cpp-blind-75](./cpp-blind-75/)\n\nThe [cpp-blind-75](./cpp-blind-75/README.md) contains a collection of solutions to 75 LeetCode questions from [NeetCode YT](https://docs.google.com/spreadsheets/d/1A2PaQKcdwO_lwxz9bAnxXnIQayCouZP6d-ENrBz_NXc/edit?usp=sharing) in C++ language.\n\nLeetcode links for the programs at the beginning of each file.\n\n### Array\n\n| Sl No. | Problem Name w/ Difficulty | Leetcode | Lintcode | Solutions | Notes |\n| :----: | --------- | :-----: | :-----: | :----: | --- |\n| 01 | 1. Two Sum\u003cbr\u003e🟢Easy | [1](https://leetcode.com/problems/two-sum) | [56](https://www.lintcode.com/problem/56) | 27-07-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/01_two-sum.cpp\u003e) |  |\n| 02 | 121. Best Time to Buy and Sell Stock\u003cbr\u003e🟢Easy | [121](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | [149](https://www.lintcode.com/problem/149) | 27-07-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/02_best-time-to-buy-and-sell-stock.cpp\u003e) |  |\n| 03 | 217. Contains Duplicate\u003cbr\u003e🟢Easy | [217](https://leetcode.com/problems/contains-duplicate) | [1320](https://www.lintcode.com/problem/1320) | 27-07-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/03_contains-duplicate.cpp\u003e) |  |\n| 04 | 238. Product of Array Except Self\u003cbr\u003e🟡Medium | [238](https://leetcode.com/problems/product-of-array-except-self) | [1310](https://www.lintcode.com/problem/1310) | 27-07-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/04_product-of-array-except-self.cpp\u003e) |  |\n| 05 | 53. Maximum Subarray\u003cbr\u003e🟡Medium | [53](https://leetcode.com/problems/maximum-subarray) | [41](https://www.lintcode.com/problem/41) | 28-07-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/05_maximum-subarray.cpp\u003e) |  |\n| 06 | 152. Maximum Product Subarray\u003cbr\u003e🟡Medium | [152](https://leetcode.com/problems/maximum-product-subarray) | [191](https://www.lintcode.com/problem/191) | 28-July-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/06_maximum-product-subarray.cpp\u003e) |  |\n| 07 | 153. Find Minimum in Rotated Sorted Array\u003cbr\u003e🟡Medium | [153](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [159](https://www.lintcode.com/problem/159) | 28-July-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/07_find-minimum-in-rotated-sorted-array.cpp\u003e) |  |\n| 08 | 33. Search in Rotated Sorted Array\u003cbr\u003e🟡Medium | [33](https://leetcode.com/problems/search-in-rotated-sorted-array) | [62](https://www.lintcode.com/problem/62) | 28-July-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/08_search-in-rotated-sorted-array.cpp\u003e) |  |\n| 09 | 15. 3Sum\u003cbr\u003e🟡Medium | [15](https://leetcode.com/problems/3sum) | [57](https://www.lintcode.com/problem/57) | 28-July-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/09_3sum.cpp\u003e) |  |\n| 10 | 11. Container With Most Water\u003cbr\u003e🟡Medium | [11](https://leetcode.com/problems/container-with-most-water) | [383](https://www.lintcode.com/problem/383) | 28-July-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/10_container-with-most-water.cpp\u003e) |  |\n\n### Binary\n\n| Sl No. | Problem Name w/ Difficulty | Leetcode | Lintcode | Solutions | Notes |\n| :----: | --------- | :-----: | :-----: | :----: | --- |\n| 11 | 371. Sum of Two Integers\u003cbr\u003e🟡Medium | [371](https://leetcode.com/problems/sum-of-two-integers) | 🔒 [1276](https://www.lintcode.com/problem/1276) | 28-July-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/11_sum-of-two-integers.cpp\u003e) |  |\n| 12 | 191. Number of 1 Bits\u003cbr\u003e🟢Easy | [191](https://leetcode.com/problems/number-of-1-bits) | [1332](https://www.lintcode.com/problem/1332) | 28-July-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/12_number-of-1-bits.cpp\u003e) |  |\n| 13 | 338. Counting Bits\u003cbr\u003e🟢Easy | [338](https://leetcode.com/problems/counting-bits) | 🔒 [664](https://www.lintcode.com/problem/664) | 28-July-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/13_counting-bits.cpp\u003e) |  |\n| 14 | 268. Missing Number\u003cbr\u003e🟢Easy | [268](https://leetcode.com/problems/missing-number) | [196](https://www.lintcode.com/problem/196) | 28-July-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/14_missing-number.cpp\u003e) |  |\n| 15 | 190. Reverse Bits\u003cbr\u003e🟢Easy | [190](https://leetcode.com/problems/reverse-bits) | [1333](https://www.lintcode.com/problem/1333) | 28-July-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/15_reverse-bits.cpp\u003e) |  |\n\n### Matrix\n\n| Sl No. | Problem Name w/ Difficulty | Leetcode | Lintcode | Solutions | Notes |\n| :----: | --------- | :-----: | :-----: | :----: | --- |\n| 16 | 73. Set Matrix Zeroes\u003cbr\u003e🟡Medium | [73](https://leetcode.com/problems/set-matrix-zeroes) | [162](https://www.lintcode.com/problem/162) | 29-July-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/16_set-matrix-zeroes.cpp\u003e) |  |\n| 17 | 54. Spiral Matrix\u003cbr\u003e🟡Medium | [54](https://leetcode.com/problems/spiral-matrix) | [374](https://www.lintcode.com/problem/374) | 29-July-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/17_spiral-matrix.cpp\u003e) |  |\n| 18 | 48. Rotate Image\u003cbr\u003e🟡Medium | [48](https://leetcode.com/problems/rotate-image) | [161](https://www.lintcode.com/problem/161) | 29-July-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/18_rotate-image.cpp\u003e) |  |\n| 19 | 79. Word Search\u003cbr\u003e🟡Medium | [79](https://leetcode.com/problems/word-search) | [123](https://www.lintcode.com/problem/123) | 29-July-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/19_word-search.cpp\u003e) |  |\n\n### Linked List\n\n| Sl No. | Problem Name w/ Difficulty | Leetcode | Lintcode | Solutions | Notes |\n| :----: | --------- | :-----: | :-----: | :----: | --- |\n| 20 | 206. Reverse Linked List\u003cbr\u003e🟢Easy | [206](https://leetcode.com/problems/reverse-linked-list) | [35](https://www.lintcode.com/problem/35) | 02-August-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/20_reverse-linked-list.cpp\u003e) |  |\n| 21 | 141. Linked List Cycle\u003cbr\u003e🟢Easy | [141](https://leetcode.com/problems/linked-list-cycle) | [102](https://www.lintcode.com/problem/102) | 02-August-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/21_linked-list-cycle.cpp\u003e) |  |\n| 22 | 21. Merge Two Sorted Lists\u003cbr\u003e🟢Easy | [21](https://leetcode.com/problems/merge-two-sorted-lists) | [165](https://www.lintcode.com/problem/165) | 02-August-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/22_merge-two-sorted-lists.cpp\u003e) |  |\n| 23 | 23. Merge k Sorted Lists\u003cbr\u003e🔴Hard | [23](https://leetcode.com/problems/merge-k-sorted-lists) | [104](https://www.lintcode.com/problem/104) | 02-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/23_merge-k-sorted-lists.cpp\u003e) |  |\n| 24 | 19. Remove Nth Node From End of List\u003cbr\u003e🟡Medium | [19](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | [174](https://www.lintcode.com/problem/174) | 02-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/24_remove-nth-node-from-end-of-list.cpp\u003e) |  |\n| 25 | 143. Reorder List\u003cbr\u003e🟡Medium | [143](https://leetcode.com/problems/reorder-list) | [99](https://www.lintcode.com/problem/99) | 02-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/25_reorder-list.cpp\u003e) |  |\n\n### String\n\n| Sl No. | Problem Name w/ Difficulty | Leetcode | Lintcode | Solutions | Notes |\n| :----: | --------- | :-----: | :-----: | :----: | --- |\n| 26 | 3. Longest Substring Without Repeating Characters\u003cbr\u003e🟡Medium | [3](https://leetcode.com/problems/longest-substring-without-repeating-characters) | [384](https://www.lintcode.com/problem/384) | 03-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/26_longest-substring-without-repeating-characters.cpp\u003e) |  |\n| 27 | 424. Longest Repeating Character Replacement\u003cbr\u003e🟡Medium | [424](https://leetcode.com/problems/longest-repeating-character-replacement) | [1246](https://www.lintcode.com/problem/1246) | 03-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/27_longest-repeating-character-replacement.cpp\u003e) |  |\n| 28 | 76. Minimum Window Substring\u003cbr\u003e🔴Hard | [76](https://leetcode.com/problems/minimum-window-substring) | [32](https://www.lintcode.com/problem/32) | 03-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/28_minimum-window-substring.cpp\u003e) |  |\n| 29 | 242. Valid Anagram\u003cbr\u003e🟢Easy | [242](https://leetcode.com/problems/valid-anagram) | [158](https://www.lintcode.com/problem/158) | 05-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/29_valid-anagram.cpp\u003e) |  |\n| 30 | 49. Group Anagrams\u003cbr\u003e🟡Medium | [49](https://leetcode.com/problems/group-anagrams) | 🔒 [772](https://www.lintcode.com/problem/772) | 05-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/30_group-anagrams.cpp\u003e) |  |\n| 31 | 20. Valid Parentheses\u003cbr\u003e🟢Easy | [20](https://leetcode.com/problems/valid-parentheses) | [423](https://www.lintcode.com/problem/423) | 05-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/31_valid-parentheses.cpp\u003e) |  |\n| 32 | 125. Valid Palindrome\u003cbr\u003e🟢Easy | [125](https://leetcode.com/problems/valid-palindrome) | [415](https://www.lintcode.com/problem/415) | 05-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/32_valid-palindrome.cpp\u003e) |  |\n| 33 | 5. Longest Palindromic Substring\u003cbr\u003e🟡Medium | [5](https://leetcode.com/problems/longest-palindromic-substring) | [200](https://www.lintcode.com/problem/200) | 05-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/33_longest-palindromic-substring.cpp\u003e) |  |\n| 34 | 647. Palindromic Substrings\u003cbr\u003e🟡Medium | [647](https://leetcode.com/problems/palindromic-substrings) | [837](https://www.lintcode.com/problem/837) | 05-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/34_palindromic-substrings.cpp\u003e) |  |\n| 35 | 271. Encode and Decode Strings\u003cbr\u003e🟡Medium | 🔒 [271](https://leetcode.com/problems/encode-and-decode-strings) | [659](https://www.lintcode.com/problem/659) | 05-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/35_encode-and-decode-strings.cpp\u003e) |  |\n\n### Heap\n\n| Sl No. | Problem Name w/ Difficulty | Leetcode | Lintcode | Solutions | Notes |\n| :----: | --------- | :-----: | :-----: | :----: | --- |\n| 36 | 347. Top K Frequent Elements\u003cbr\u003e🟡Medium | [347](https://leetcode.com/problems/top-k-frequent-elements) | [1281](https://www.lintcode.com/problem/1281) | 06-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/36_top-k-frequent-elements.cpp\u003e) |  |\n| 37 | 295. Find Median from Data Stream\u003cbr\u003e🔴Hard | [295](https://leetcode.com/problems/find-median-from-data-stream) | [81](https://www.lintcode.com/problem/81) | 06-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/37_find-median-from-data-stream.cpp\u003e) |  |\n\n### Interval\n\n| Sl No. | Problem Name w/ Difficulty | Leetcode | Lintcode | Solutions | Notes |\n| :----: | --------- | :-----: | :-----: | :----: | --- |\n| 38 | 57. Insert Interval\u003cbr\u003e🟡Medium | [57](https://leetcode.com/problems/insert-interval) | [30](https://www.lintcode.com/problem/30) | 06-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/38_insert-interval.cpp\u003e) |  |\n| 39 | 56. Merge Intervals\u003cbr\u003e🟡Medium | [56](https://leetcode.com/problems/merge-intervals) | [156](https://www.lintcode.com/problem/156) | 06-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/39_merge-intervals.cpp\u003e) |  |\n| 40 | 435. Non-overlapping Intervals\u003cbr\u003e🟡Medium | [435](https://leetcode.com/problems/non-overlapping-intervals) | [1242](https://www.lintcode.com/problem/1242) | 06-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/40_non-overlapping-intervals.cpp\u003e) |  |\n| 41 | 252. Meeting Rooms\u003cbr\u003e🟢Easy | 🔒 [252](https://leetcode.com/problems/meeting-rooms) | [920](https://www.lintcode.com/problem/920) | 06-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/41_meeting-rooms.cpp\u003e) |  |\n| 42 | 253. Meeting Rooms II\u003cbr\u003e🟡Medium | 🔒 [253](https://leetcode.com/problems/meeting-rooms-ii) | [919](https://www.lintcode.com/problem/919) | 06-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/42_meeting-rooms-ii.cpp\u003e) |  |\n\n### Tree\n\n| Sl No. | Problem Name w/ Difficulty | Leetcode | Lintcode | Solutions | Notes |\n| :----: | --------- | :-----: | :-----: | :----: | --- |\n| 43 | 104. Maximum Depth of Binary Tree\u003cbr\u003e🟢Easy | [104](https://leetcode.com/problems/maximum-depth-of-binary-tree) | [97](https://www.lintcode.com/problem/97) | 06-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/43_maximum-depth-of-binary-tree.cpp\u003e) |  |\n| 44 | 100. Same Tree\u003cbr\u003e🟢Easy | [100](https://leetcode.com/problems/same-tree) | [469](https://www.lintcode.com/problem/469) | 07-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/44_same-tree.cpp\u003e) |  |\n| 45 | 226. Invert Binary Tree\u003cbr\u003e🟢Easy | [226](https://leetcode.com/problems/invert-binary-tree) | [175](https://www.lintcode.com/problem/175) | 07-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/45_invert-binary-tree.cpp\u003e) |  |\n| 46 | 124. Binary Tree Maximum Path Sum\u003cbr\u003e🔴Hard | [124](https://leetcode.com/problems/binary-tree-maximum-path-sum) | [94](https://www.lintcode.com/problem/94) | 07-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/46_binary-tree-maximum-path-sum.cpp\u003e) |  |\n| 47 | 102. Binary Tree Level Order Traversal\u003cbr\u003e🟡Medium | [102](https://leetcode.com/problems/binary-tree-level-order-traversal) | [69](https://www.lintcode.com/problem/69) | 07-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/47_binary-tree-level-order-traversal.cpp\u003e) |  |\n| 48 | 297. Serialize and Deserialize Binary Tree\u003cbr\u003e🔴Hard | [297](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | [7](https://www.lintcode.com/problem/7) | 07-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/48_serialize-and-deserialize-binary-tree.cpp\u003e) |  |\n| 49 | 572. Subtree of Another Tree\u003cbr\u003e🟢Easy | [572](https://leetcode.com/problems/subtree-of-another-tree) | [1165](https://www.lintcode.com/problem/1165) | 07-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/49_subtree-of-another-tree.cpp\u003e) |  |\n| 50 | 105. Construct Binary Tree from Preorder and Inorder Traversal\u003cbr\u003e🟡Medium | [105](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [73](https://www.lintcode.com/problem/73) | 07-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/50_construct-binary-tree-from-preorder-and-inorder-traversal.cpp\u003e) |  |\n| 51 | 98. Validate Binary Search Tree\u003cbr\u003e🟡Medium | [98](https://leetcode.com/problems/validate-binary-search-tree) | [95](https://www.lintcode.com/problem/95) | 07-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/51_validate-binary-search-tree.cpp\u003e) |  |\n| 52 | 230. Kth Smallest Element in a BST\u003cbr\u003e🟡Medium | [230](https://leetcode.com/problems/kth-smallest-element-in-a-bst) | [902](https://www.lintcode.com/problem/902) | 07-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/52_kth-smallest-element-in-a-bst.cpp\u003e) |  |\n| 53 | 235. Lowest Common Ancestor of a Binary Search Tree\u003cbr\u003e🟡Medium | [235](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | [1311](https://www.lintcode.com/problem/1311) | 07-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/53_lowest-common-ancestor-of-a-binary-search-tree.cpp\u003e) |  |\n| 54 | 208. Implement Trie (Prefix Tree)\u003cbr\u003e🟡Medium | [208](https://leetcode.com/problems/implement-trie-prefix-tree) | — | 07-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/54_implement-trie-prefix-tree.cpp\u003e) |  |\n| 55 | 211. Design Add and Search Words Data Structure\u003cbr\u003e🟡Medium | [211](https://leetcode.com/problems/design-add-and-search-words-data-structure) | — | 08-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/55_design-add-and-search-words-data-structure.cpp\u003e) |  |\n| 56 | 212. Word Search II\u003cbr\u003e🔴Hard | [212](https://leetcode.com/problems/word-search-ii) | [132](https://www.lintcode.com/problem/132) | 08-Aug-2023\u003cbr\u003e[Cpp](\u003ccpp-blind-75/56_word-search-ii.cpp\u003e) |  |\n\n### Graph\n\n| SL No | Problem Name w/ Difficulty |  Leetcode  |  Lintcode  |  Solution  | Notes |\n| :---: | -------------------------- | :--------: | :--------: | :--------: | ----- |\n|  57   | 133. Clone Graph  \u003cbr\u003e 🟡Medium  | [133](https://leetcode.com/problems/clone-graph)  |  [137](https://www.lintcode.com/problem/137)  |  09-Aug-2023\u003cbr\u003e[Cpp](\u003c./cpp-blind-75/57_clone-graph.cpp\u003e)  |  |\n|  58   | 207. Course Schedule  \u003cbr\u003e 🟡Medium  | [207](https://leetcode.com/problems/course-schedule)  |  [615](https://www.lintcode.com/problem/615)  |  09-Aug-2023\u003cbr\u003e[Cpp](\u003c./cpp-blind-75/58_course-schedule.cpp\u003e)  |  |\n|  59   | 417. Pacific Atlantic Water Flow  \u003cbr\u003e 🟡Medium  | [417](https://leetcode.com/problems/pacific-atlantic-water-flow)  |  [778](https://www.lintcode.com/problem/778)  |  12-Aug-2023\u003cbr\u003e[Cpp](\u003c./cpp-blind-75/59_pacific-atlantic-water-flow.cpp\u003e)  |  |\n|  60   | 200. Number of Islands  \u003cbr\u003e 🟡Medium  | [200](https://leetcode.com/problems/number-of-islands)  |  [433](https://www.lintcode.com/problem/433)  |  12-Aug-2023\u003cbr\u003e[Cpp](\u003c./cpp-blind-75/60_number-of-islands.cpp\u003e)  |  |\n|  61   | 128. Longest Consecutive Sequence  \u003cbr\u003e 🟡Medium  | [128](https://leetcode.com/problems/longest-consecutive-sequence)  |  [124](https://www.lintcode.com/problem/124)  |  12-Aug-2023\u003cbr\u003e[Cpp](\u003c./cpp-blind-75/61_longest-consecutive-sequence.cpp\u003e)  |  |\n|  62   | 269. Alien Dictionary  \u003cbr\u003e 🔴Hard |  🔒 [269](https://leetcode.com/problems/alien-dictionary)  | [892](https://www.lintcode.com/problem/892)  |  13-Aug-2023\u003cbr\u003e[Cpp](\u003c./cpp-blind-75/62_alien-dictionary.cpp\u003e)  |  |\n|  63   | 261. Graph Valid Tree  \u003cbr\u003e 🟡Medium |  🔒 [261](https://leetcode.com/problems/graph-valid-tree)  | [178](https://www.lintcode.com/problem/178)  |  13-Aug-2023\u003cbr\u003e[Cpp](\u003c./cpp-blind-75/63_graph-valid-tree.cpp\u003e)  |  |\n|  64   | 323. Number of Connected Components in an Undirected Graph \u003cbr\u003e 🟡Medium | 🔒 [323](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) | [3651](https://www.lintcode.com/problem/3651) | 13-Aug-2023\u003cbr\u003e[Cpp](\u003c./cpp-blind-75/64_number-of-connected-components-in-an-undirected-graph.cpp\u003e) |  |\n\n### Dynamic Programming\n\n| SL No | Problem Name w/ Difficulty  | Leetcode |  Lintcode  |  Solution  | Notes  |\n| :---: | --------------------------- | :------: | :--------: | :--------: | ------ |\n|  65   | 70. Climbing Stairs  \u003cbr\u003e 🟢Easy   | [70](https://leetcode.com/problems/climbing-stairs)  | [111](https://www.lintcode.com/problem/111) | 13-Aug-2023\u003cbr\u003e[Cpp](\u003c./cpp-blind-75/65_climbing-stairs.cpp\u003e)  |   |\n|  66   | 322. Coin Change  \u003cbr\u003e🟡Medium  | [322](https://leetcode.com/problems/coin-change)  | [669](https://www.lintcode.com/problem/669) | 14-Aug-2023\u003cbr\u003e[Cpp](\u003c./cpp-blind-75/66_coin-change.cpp\u003e)  |   |\n|  67   | 300. Longest Increasing Subsequence \u003cbr\u003e🟡Medium  | [300](https://leetcode.com/problems/longest-increasing-subsequence) |  [76](https://www.lintcode.com/problem/76)  | 14-Aug-2023\u003cbr\u003e[Cpp](\u003c./cpp-blind-75/67_longest-increasing-subsequence.cpp\u003e) |   |\n|  68   | 1143. Longest Common Subsequence  \u003cbr\u003e🟡Medium  | [1143](https://leetcode.com/problems/longest-common-subsequence)   |  [77](https://www.lintcode.com/problem/77)  | 14-Aug-2023\u003cbr\u003e[Cpp](\u003c./cpp-blind-75/68_longest-common-subsequence.cpp\u003e)  |   |\n|  69   | 139. Word Break  \u003cbr\u003e🟡Medium  | [139](https://leetcode.com/problems/word-break)  | [107](https://www.lintcode.com/problem/107) | 14-Aug-2023\u003cbr\u003e[Cpp](\u003c./cpp-blind-75/69_word-break.cpp\u003e)  |   |\n|  70   | 39. Combination Sum  \u003cbr\u003e🟡Medium  | [39](https://leetcode.com/problems/combination-sum)  | [135](https://www.lintcode.com/problem/135) | 14-Aug-2023\u003cbr\u003e[Cpp](\u003c./cpp-blind-75/70_combination-sum.cpp\u003e)  |   |\n|  71   | 198. House Robber  \u003cbr\u003e🟡Medium  | [198](https://leetcode.com/problems/house-robber)  | [392](https://www.lintcode.com/problem/392) | 14-Aug-2023\u003cbr\u003e[Cpp](\u003c./cpp-blind-75/71_house-robber.cpp\u003e)  |   |\n|  72   | 213. House Robber II  \u003cbr\u003e🟡Medium  | [213](https://leetcode.com/problems/house-robber-ii)  | [534](https://www.lintcode.com/problem/534) | 14-Aug-2023\u003cbr\u003e[Cpp](\u003c./cpp-blind-75/72_house-robber-ii.cpp\u003e)  |   |\n|  73   | 91. Decode Ways  \u003cbr\u003e🟡Medium  | [91](https://leetcode.com/problems/decode-ways)  | [512](https://www.lintcode.com/problem/512) | 15-Aug-2023\u003cbr\u003e[Cpp](\u003c./cpp-blind-75/73_decode-ways.cpp\u003e)  |   |\n|  74   | 62. Unique Paths  \u003cbr\u003e🟡Medium  | [62](https://leetcode.com/problems/unique-paths)  | [114](https://www.lintcode.com/problem/114) | 15-Aug-2023\u003cbr\u003e[Cpp](\u003c./cpp-blind-75/74_unique-paths.cpp\u003e)  |   |\n|  75   | 55. Jump Game  \u003cbr\u003e🟡Medium  | [55](https://leetcode.com/problems/jump-game)  | [116](https://www.lintcode.com/problem/116) | 15-Aug-2023\u003cbr\u003e[Cpp](\u003c./cpp-blind-75/75_jump-game.cpp\u003e)  |   |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fankitsamaddar%2Fblind75_cpp_solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fankitsamaddar%2Fblind75_cpp_solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fankitsamaddar%2Fblind75_cpp_solutions/lists"}