Mahendra Yadav retweetledi

Let me save you 50+ hours of jumping between Leetcode lists with this list of 96 Leetcode problems, patterns + pattern triggers. This will make everyone sitting for placements, interviews, and grinding Leetcode solve 50-70% faster.
The goal is simple: spot the pattern early, reduce the search space, and save time in those 45-minute rounds.
Use this as a cheatsheet. The keywords are triggers, not guarantees.
But they’ll help you narrow down the right approach much faster.
[1] Sliding Window
Keywords: contiguous, substring, longest/shortest, at most k
Problems: 3, 76, 424, 567, 904, 1004
[2] Two Pointers
Keywords: sorted array, pair sum, left-right, move inward
Problems: 11, 15, 42, 125, 167, 881
[3] Binary Search
Keywords: sorted/monotonic, first/last, search space, log n
Problems: 33, 34, 153, 704, 875, 1011
[4] Hashing + Prefix Sum
Keywords: frequency, fast lookup, running sum, subarray count
Problems: 1, 49, 128, 560, 525, 974
[5] Monotonic Stack
Keywords: next greater, previous smaller, span, maintain order
Problems: 84, 496, 503, 739, 901, 907
[6] Heap / Top K
Keywords: top k, priority, smallest/largest, stream
Problems: 215, 295, 347, 378, 621, 703
[7] Intervals
Keywords: merge, overlap, meeting time, sort by start/end
Problems: 56, 57, 435, 452, 986, 1288
[8] BFS
Keywords: shortest path, level order, queue, neighbors
Problems: 102, 127, 199, 994, 1091, 752
[9] DFS / Backtracking
Keywords: all combinations, choices, recursion, undo move
Problems: 39, 40, 46, 78, 79, 131
[10] Trees
Keywords: subtree, depth, ancestor, recursive structure
Problems: 98, 104, 124, 230, 236, 543
[11] Linked List
Keywords: pointers, reverse, merge, node manipulation
Problems: 19, 21, 23, 141, 143, 206
[12] Union Find
Keywords: connected components, groups, merge sets, parent
Problems: 547, 684, 721, 947, 990, 1319
[13] Topological Sort
Keywords: dependency order, DAG, in-degree, course schedule
Problems: 207, 210, 310, 802, 1136, 1203
[14] Trie
Keywords: prefix, dictionary, startsWith, autocomplete
Problems: 208, 211, 212, 648, 677, 1268
[15] Greedy
Keywords: best local choice, maximize/minimize, jump, intervals
Problems: 45, 55, 134, 406, 763, 1029
[16] Dynamic Programming
Keywords: overlapping subproblems, state, transition, optimal result
Problems: 70, 198, 213, 300, 322, 746
English




















