awesome-leetcode-resources

This repository is a curated index — a big hand-picked reading list — of online resources for learning data structures and algorithms (DSA) and getting ready for technical coding interviews on LeetCode. It does not contain a course or a piece of software you run; it is essentially a single README that organises links to articles, videos, problem sets and cheatsheets that the maintainer has found useful.

The collection is grouped to mirror how interview prep is usually approached. There is a section on fundamental concepts covering things like algorithmic complexity, arrays, linked lists, stacks, queues, hash tables, binary trees, heaps, recursion, backtracking, tries, binary search, greedy algorithms, dynamic programming, and a range of graph topics such as DFS and BFS traversals, Union-Find, Dijkstra and minimum spanning trees. A second section catalogues recurring problem-solving "patterns" — two pointers, sliding window, prefix sum, fast and slow pointers, top K elements, Kadane's algorithm, monotonic stacks, overlapping intervals, backtracking and modified binary search, among others. Further sections point at must-read LeetCode discussion articles, curated problem lists (such as Blind 75 and the LeetCode Top 100 Liked), and YouTube playlists.

You would use this repository if you are starting from scratch with DSA, refreshing your memory before an interview loop at a tech company, or looking for a structured path through LeetCode rather than picking problems at random. It is meant for self-study; the actual content lives on the linked sites. The full README is longer than what was provided.