Scribd
Upload
6 views1 page

Leetcode Patterns

The document categorizes LeetCode patterns based on difficulty into three levels: Easy, Medium, and Hard. Level 1 includes basic concepts like Hashing and Two Pointers, Level 2 covers more complex techniques such as Binary Search and BFS, while Level 3 focuses on advanced topics like Dynamic Programming and Graph Algorithms. Each level lists specific patterns that are essential for problem-solving in coding interviews.

Uploaded by

Tarun
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views1 page

Leetcode Patterns

The document categorizes LeetCode patterns based on difficulty into three levels: Easy, Medium, and Hard. Level 1 includes basic concepts like Hashing and Two Pointers, Level 2 covers more complex techniques such as Binary Search and BFS, while Level 3 focuses on advanced topics like Dynamic Programming and Graph Algorithms. Each level lists specific patterns that are essential for problem-solving in coding interviews.

Uploaded by

Tarun
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

LeetCode Patterns Based on Difficulty

LEVEL 1 — EASY PATTERNS


1. Hashing Basics
2. Two Pointers (Basic)
3. Sliding Window (Fixed Size)
4. Basic String Manipulation
5. Stack (Basic)
6. Basic Math & Greedy

LEVEL 2 — MEDIUM PATTERNS


7. Sliding Window (Variable Size)
8. HashMap + Two Pointers
9. Fast & Slow Pointer (Linked List)
10. Binary Search
11. Monotonic Stack
12. Intervals
13. BFS & DFS
14. Backtracking

LEVEL 3 — HARD PATTERNS


15. Dynamic Programming (Hard)
16. Advanced Graph Algorithms
17. Segment Tree / Fenwick Tree
18. Hard Greedy
19. Trie (Prefix Tree)
20. Advanced Monotonic Stack / Deque

You might also like