Data Structure and Algorithm Mastery
- Buy now
- Learn more
- Discussions
Arrays

Arrays Basics
Binary Search

Binary Search Introduction
Binary Search Application
LinkedList

Linked List Implementation and Operations
Linked List Reverse in groups
Hashing

Hashing
Heaps

Heap tree implementation
Median in a stream
Stacks And Queues

Stacks Introduction
Sum Subarray Ranges
Queues
Sliding Window

Sliding window Intro
Sliding window Advanced
Graphs and trees

Basics for Graph and Tree
Binary Tree
BFS on Graph
Topological sorting
BFS On Grid
Union Find and MST
Dijkstra On Graph
Minimum Cost to Reach Destination in Time
Topological Sorting with DFS
Backtracking

Backtracking Inclusion Exclusion
Rat in a Maze
Dynamic programming

Dynamic Programming Inclusion exclusion
Matrix chain multiplication
Arithmetic Slices
Trie

Trie Operations and Applications
Intervals

Merge and Insert Intervals
Greedy

Greedy approch
Special Topics

Segment Tree
KMP

Products
Course
Section

Backtracking

Data Structure and Algorithm Mastery
- Buy now
- Learn more
- Discussions
Arrays
- Arrays Basics
Binary Search
- Binary Search Introduction
- Binary Search Application
LinkedList
- Linked List Implementation and Operations
- Linked List Reverse in groups
Hashing
- Hashing
Heaps
- Heap tree implementation
- Median in a stream
Stacks And Queues
- Stacks Introduction
- Sum Subarray Ranges
- Queues
Sliding Window
- Sliding window Intro
- Sliding window Advanced
Graphs and trees
- Basics for Graph and Tree
- Binary Tree
- BFS on Graph
- Topological sorting
- BFS On Grid
- Union Find and MST
- Dijkstra On Graph
- Minimum Cost to Reach Destination in Time
- Topological Sorting with DFS
Backtracking
- Backtracking Inclusion Exclusion
- Rat in a Maze
Dynamic programming
- Dynamic Programming Inclusion exclusion
- Matrix chain multiplication
- Arithmetic Slices
Trie
- Trie Operations and Applications
Intervals
- Merge and Insert Intervals
Greedy
- Greedy approch
Special Topics
- Segment Tree
- KMP

Visualizing the "Decision making." See how we explore paths and collect all possible outcomes.

2 Lessons

Backtracking Inclusion Exclusion

Rat in a Maze