{"id":13434397,"url":"https://github.com/armankhondker/best-leetcode-resources","last_synced_at":"2026-01-27T00:37:14.472Z","repository":{"id":215303359,"uuid":"738608882","full_name":"armankhondker/best-leetcode-resources","owner":"armankhondker","description":"Learn LeetCode and prepare for coding interviews with free resources. ","archived":false,"fork":false,"pushed_at":"2025-02-14T20:04:12.000Z","size":801,"stargazers_count":3638,"open_issues_count":5,"forks_count":394,"subscribers_count":40,"default_branch":"main","last_synced_at":"2025-03-25T15:50:54.047Z","etag":null,"topics":["algorithms","coding","coding-interview","data-structures","interview-prep","interview-problems","leetcode","leetcode-solutions","software-engineering"],"latest_commit_sha":null,"homepage":"","language":null,"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/armankhondker.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}},"created_at":"2024-01-03T16:14:39.000Z","updated_at":"2025-03-25T11:48:07.000Z","dependencies_parsed_at":"2024-01-03T17:31:06.546Z","dependency_job_id":"c378e97f-944b-4add-928b-7787d8b2b4bb","html_url":"https://github.com/armankhondker/best-leetcode-resources","commit_stats":{"total_commits":13,"total_committers":1,"mean_commits":13.0,"dds":0.0,"last_synced_commit":"00e1e0bda7d5d66b9147041153342f2054fcb49a"},"previous_names":["armankhondker/codinginterviewprep"],"tags_count":1,"template":false,"template_full_name":null,"purl":"pkg:github/armankhondker/best-leetcode-resources","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/armankhondker%2Fbest-leetcode-resources","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/armankhondker%2Fbest-leetcode-resources/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/armankhondker%2Fbest-leetcode-resources/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/armankhondker%2Fbest-leetcode-resources/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/armankhondker","download_url":"https://codeload.github.com/armankhondker/best-leetcode-resources/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/armankhondker%2Fbest-leetcode-resources/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28793855,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-26T21:49:50.245Z","status":"ssl_error","status_checked_at":"2026-01-26T21:48:29.455Z","response_time":59,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["algorithms","coding","coding-interview","data-structures","interview-prep","interview-problems","leetcode","leetcode-solutions","software-engineering"],"created_at":"2024-07-31T02:01:55.526Z","updated_at":"2026-01-27T00:37:14.454Z","avatar_url":"https://github.com/armankhondker.png","language":null,"funding_links":[],"categories":["Others"],"sub_categories":[],"readme":"# Best LeetCode Resources\nThis repository contains the best resources for coding interview prep and mastering leetcode. \n\n## Data Structures \u0026 Algorithms\n- [Hash Tables](https://medium.com/basecs/taking-hash-tables-off-the-shelf-139cbf4752f0)\n- [Linked List](https://medium.com/basecs/whats-a-linked-list-anyway-part-1-d8b7e6508b9d)\n- [Recursion](https://leetcode.com/discuss/study-guide/1733447/Become-Master-In-Recursion)\n- [Sorting](https://medium.com/basecs/sorting-out-the-basics-behind-sorting-algorithms-b0a032873add)\n- [Binary Search](https://leetcode.com/discuss/general-discussion/786126/Python-Powerful-Ultimate-Binary-Search-Template.-Solved-many-problems)\n- [Stacks](https://medium.com/basecs/stacks-and-overflows-dbcf7854dc67)\n- [Queues](https://medium.com/basecs/to-queue-or-not-to-queue-2653bcde5b04)\n- [Trees](https://leetcode.com/discuss/study-guide/1820334/Become-Master-in-Tre)\n- [Tries](https://leetcode.com/discuss/general-discussion/931977/beginner-friendly-guide-to-trie-tutorial-practice-problems)\n- [Backtracking](https://medium.com/leetcode-patterns/leetcode-pattern-3-backtracking-5d9e5a03dc26)\n- [Heaps](https://medium.com/basecs/learning-to-love-heaps-cef2b273a238)\n- [Breadth First Search](https://medium.com/basecs/breaking-down-breadth-first-search-cebe696709d9)\n- [Depth First Search](https://medium.com/basecs/deep-dive-through-a-graph-dfs-traversal-8177df5d0f13)\n- [Graph Theory](https://medium.com/basecs/a-gentle-introduction-to-graph-theory-77969829ead8)\n- [Dynaymic Programming](https://leetcode.com/discuss/general-discussion/458695/dynamic-programming-patterns)\n- [Big O Cheat Sheet](https://www.bigocheatsheet.com/) \n\n### [Leetcode Spaced-Repetition Template](https://docs.google.com/spreadsheets/d/1qcVCZ3VrBa2p0Tlzad0kEdG94carfZly5z81VLdz2w4/edit#gid=0) \n\n## Patterns\n- [14 Coding Interview Patterns](https://www.teamblind.com/blog/top-leetcode-patterns-coding-interview-questions/)\n- [Sliding Window](https://medium.com/leetcode-patterns/leetcode-pattern-2-sliding-windows-for-strings-e19af105316b)\n- [Two Pointers](https://leetcode.com/discuss/study-guide/1688903/Solved-all-two-pointers-problems-in-100-days)\n- [Merge Intervals](https://medium.com/codex/grokking-the-coding-interview-pattern-merge-interval-6e6b1e9e038c)\n- [Cyclic Sort](https://leetcode.com/discuss/study-guide/2958275/cyclic-sort-important-pattern)\n- [Monotonic Stack](https://leetcode.com/discuss/study-guide/2347639/A-comprehensive-guide-and-template-for-monotonic-stack-based-problems)\n- [Two Heaps](https://leetcode.com/discuss/general-discussion/1127238/master-heap-by-solving-23-questions-in-4-patterns-category)\n- [Subsets](https://leetcode.com/discuss/general-discussion/1125779/Dynamic-programming-on-subsets-with-examples-explained)\n- [Modified Binary Search](https://leetcode.com/discuss/general-discussion/691825/Binary-Search-for-Beginners-Problems-or-Patterns-or-Sample-solutions)\n- [Top K Elements](https://github.com/Chanda-Abdul/Several-Coding-Patterns-for-Solving-Data-Structures-and-Algorithms-Problems-during-Interviews/blob/main/%E2%9C%85%20Pattern%2013:%20Top%20'K'%20Elements.md)\n- [K-way merge](https://github.com/Chanda-Abdul/Several-Coding-Patterns-for-Solving-Data-Structures-and-Algorithms-Problems-during-Interviews/blob/main/%E2%9C%85%20Pattern%2014%3A%20K-way%20merge.md)\n- [In-place Reversal of Linked List](https://github.com/Chanda-Abdul/Several-Coding-Patterns-for-Solving-Data-Structures-and-Algorithms-Problems-during-Interviews/blob/main/%E2%9C%85%20%20Pattern%2006:%20In-place%20Reversal%20of%20a%20LinkedList.md)\n- [DFS Pattern](https://github.com/Chanda-Abdul/Several-Coding-Patterns-for-Solving-Data-Structures-and-Algorithms-Problems-during-Interviews/blob/main/%E2%9C%85%20%20Pattern%2008%3ATree%20Depth%20First%20Search.md)\n- [BFS Pattern](https://github.com/Chanda-Abdul/Several-Coding-Patterns-for-Solving-Data-Structures-and-Algorithms-Problems-during-Interviews/blob/main/%E2%9C%85%20%20Pattern%2007%3A%20Tree%20Breadth%20First%20Search.md)\n- [O-1 Knapsack](https://github.com/Chanda-Abdul/Several-Coding-Patterns-for-Solving-Data-Structures-and-Algorithms-Problems-during-Interviews/blob/main/%E2%9C%85%20Pattern%2015%3A%200-1%20Knapsack%20(Dynamic%20Programming).md)\n- [Topological Sort](https://medium.com/basecs/spinning-around-in-cycles-with-directed-acyclic-graphs-a233496d4688)\n\n## Famous Problem Sets\n- [Blind 75](https://leetcode.com/discuss/general-discussion/460599/blind-75-leetcode-questions)\n- [Neetcode 150](https://neetcode.io/practice)\n- [Sean Prashad's Leetcode Patterns](https://seanprashad.com/leetcode-patterns/) \n- [Leetcode Top Interview Questions](https://leetcode.com/problem-list/top-interview-questions/)\n\n## Books\n- [Elements of Programming Interviews](https://www.amazon.com/Elements-Programming-Interviews-Insiders-Guide/dp/1479274836)\n- [Competitive Programmer's Handbook](https://github.com/Avinash987/Coding/blob/master/CodingBook.pdf)\n- [Cracking the Coding Interview](https://github.com/Avinash987/Coding/blob/master/Cracking-the-Coding-Interview-6th-Edition-189-Programming-Questions-and-Solutions.pdf)\n\n## Courses\n- [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview)\n- [Data Structures with a Google SWE](https://www.youtube.com/watch?v=RBSGKlAvoiM)\n- [Meta Coding Interview Prep Course](https://www.coursera.org/learn/coding-interview-preparation)\n\n## Mock Interviewing\n- [Pramp](https://www.pramp.com/#/)\n- [Interviewing.io](https://interviewing.io/)\n- [Meetapro](https://www.meetapro.com/)\n\n## LeetCode Extensions\n- [LeetCode Video Solutions](https://chromewebstore.google.com/detail/leetcode-video-solutions/ilnmgkahgjdpkoliooildngldmilhelm?hl=en)\n- [LeetCode GitHub Submission Sync](https://github.com/QasimWani/LeetHub)\n- [LeetCode VS Code Extension](https://marketplace.visualstudio.com/items?itemName=LeetCode.vscode-leetcode) \n\n\n### [Resume Template](https://www.overleaf.com/read/gzgzrpszyzyg)\n\n## Must-do Problems\n\n### Graphs\n- [Redundant Connection](https://leetcode.com/problems/trim-a-binary-search-tree/description/)\n- [Course Schedule](https://leetcode.com/problems/course-schedule/description/)\n- [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/description/)\n- [Number of connected components in an undirected graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/description/)\n- [Shortest Path to Get All Keys](https://leetcode.com/problems/shortest-path-to-get-all-keys/description/?envType=list\u0026envId=xler60c5)\n- [Pacific Atlantic Waterflow](https://leetcode.com/problems/pacific-atlantic-water-flow/description/?envType=list\u0026envId=xler60c5)\n- [Word Ladder](https://leetcode.com/problems/word-ladder/description/)\n- [Number of Islands](https://leetcode.com/problems/number-of-islands/description/?envType=list\u0026envId=xler60c5)\n- [Clone Graph](https://leetcode.com/problems/clone-graph/description/?envType=list\u0026envId=xler60c5)\n- [Alien Dictionary](https://leetcode.com/problems/alien-dictionary/description/)\n\n### Binary Trees\n- [Construct binary tree from preorder and inorder traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/)\n- [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/)\n- [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)\n- [Count good nodes in Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree/description/)\n- [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/description/)\n- [Kth smallest element in BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/description/)\n- [Lowest Common Ancestor of a BST](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/description/)\n- [Path Sum](https://leetcode.com/problems/path-sum/description/?envType=list\u0026envId=xlemouqi)\n- [Path Sum II](https://leetcode.com/problems/path-sum-ii/description/?envType=list\u0026envId=xlemouqi)\n- [Merge two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/description/?envType=list\u0026envId=xlemouqi)\n- [Word Search](https://leetcode.com/problems/word-search/)\n- [Word Search II](https://leetcode.com/problems/word-search-ii/)\n- [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree/)\n\n### Linked Lists\n- [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/description/?envType=list\u0026envId=xler4hke)\n- [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/description/?envType=list\u0026envId=xler4hke)\n- [Rotate List](https://leetcode.com/problems/rotate-list/description/?envType=list\u0026envId=xler4hke)\n- [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/description/?envType=list\u0026envId=xler4hke)\n- [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/description/?envType=list\u0026envId=xler4hke)\n- [Reverse nodes in K group](https://leetcode.com/problems/reverse-nodes-in-k-group/description/?envType=list\u0026envId=xler4hke)\n- [LRU Cache](https://leetcode.com/problems/lru-cache/description/)\n\nYour open-source contributions are appreciated!\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Farmankhondker%2Fbest-leetcode-resources","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Farmankhondker%2Fbest-leetcode-resources","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Farmankhondker%2Fbest-leetcode-resources/lists"}