Crack coding rounds by pattern. Master the core problem-solving patterns behind coding interviews, from backtracking to dynamic programming.
Start Learning Free39 courses · 138 topics · 619 patterns
Choose a category and find the course that fits your goal.
39 courses
Permutations, Constraint Satisfaction - Grid & String, String / Expression Backtracking
BST Validation & Search, BST Insert, Delete, Modify, BST Range & Order Queries…
XOR Magic, Bit Counting & Manipulation, Bitmask & Advanced
Linear Structures (Weeks 1-2 Hardest), Search & Enumeration (Weeks 3-4 Hardest), DP Hardest (Week 5)…
Network Models & Addressing, Transport Layer - TCP & UDP, Application Layer - HTTP, DNS & DHCP…
Cache Design (LRU / LFU), Median, Skyline & Range Structures, Linked List Based Design
Core Cyclic Sort Mechanics, Missing + Duplicate Combinations, First Missing & Advanced
SQL Deep Dive, Normalization & Schema Design, Indexing & Query Optimization…
LIS Family, DP on Trees, Bitmask DP
Matrix / Grid DP, Grid DP Extensions, Interval / Game DP
0/1 Knapsack Pattern, Unbounded Knapsack Pattern, Knapsack Variants & Extensions
LCS Family, Palindrome DP, String DP Extensions
Fibonacci / Linear DP, Decode, Break & Word Problems, Stock Trading DP (State Machines)
Cycle Detection & Entry, Middle, Palindrome & Split, Fast-Slow on Implicit Sequences…
Grid DFS / BFS, Graph DFS - Components & Cycle Detection, Shortest Path (Dijkstra & BFS)…
Task Scheduling & Assignment, Array / Sequence Greedy, String & Math Greedy
Frequency & Counting, Set Membership & Lookup, Prefix Sum + Hash Map…
Reversal Patterns, Merge & Sort, Pointer Tricks - Nth Node, Intersection, Rotation
Merge & Insert, Scheduling - Sort by End, Sweep Line / Event Processing…
Merge K Sorted Structures, K-way Merge Applications
Track Frequencies, Track Prefix Sums / Remainders, Track Running State…
Reorder & Structural Rearrangement, Complex Pointer Manipulation, Linked List Design
Number Theory, Integer Math & Encoding, Geometry & Coordinate Math
Matrix Traversal & Output, In-Place Matrix Transformation, Matrix Search & Count
Classic Binary Search, Boundary Finding, Binary Search on Answer Space…
Four OOP Pillars, SOLID Principles, Creational Design Patterns…
Processes, Threads & CPU Scheduling, Synchronization & Deadlock, Memory Management & Virtual Memory…
Fixed-Size Window, Variable-Size Window - Longest, Variable-Size Window - Shortest / Count…
Sort to Enable Binary Search, Sort to Enable Two Pointers, Custom Sort Orders
Classic Stack Problems, Monotonic Stack - Next Greater / Smaller, Queue & Deque Patterns…
Pure Subsets (Include / Exclude), Combinations with Sum Constraint, Subsets / Combinations with Bitmask
Kth Order Statistics, K Selection with Constraints, Frequency Stack & Advanced
Kahn's Algorithm (BFS / In-Degree), DFS Postorder Topological Sort, Advanced Dependency Problems
Level Order Traversal Foundations, Level-Based Properties, Views & Right-Side Patterns…
Traversal Orders, Tree Properties & Measurements, DFS Path Problems…
Trie Fundamentals, Trie + DFS / Backtracking, Bit Trie (XOR Problems)
Running Median Pattern, Capital / Project Optimization, Interval & Task Scheduling with Two Heaps
Opposite Ends - Sorted Array, Three Pointers / K-Sum, Same Direction / Partition…
Core Union-Find Problems, Union-Find with Weights / Custom Logic, Advanced Union-Find
Why LeyaaLeyaa doesn't just deliver content - it understands where you are, what you need, and how to get you there fastest.
Teaching programming through visualization since 2019. Same conviction, broader scope with Leyaa.
What learners say
“I took the assessment on Java. Leyaa showed exactly where I was strong, what to improve, and gave me the right learning plan. It was 100% accurate. Now I'm addicted to learning here.”
Choose a course, take a quick diagnostic, and get a personalized Focus List in under 15 minutes.
