-
All Paths From Source to Target - Easy DFS solution
Backtracking
Breadth-First Search
C++
Depth-First Search
Graph
Medium
-
Delete Operation for Two Strings - Edit Distance + LCS DP solutions
C++
Dynamic Programming
Medium
String
-
Next Greater Element II - NGE using stack on repeated array
Array
C++
Medium
Monotonic Stack
Stack
-
Next Greater Element I - Stack + HashMap O(N1+N2) solution
Array
C++
Easy
Hash Table
Monotonic Stack
Stack
-
Network Delay Time - Dijkstra method
Breadth-First Search
Depth-First Search
Graph
Heap (Priority Queue)
Medium
Shortest Path
-
Deepest Leaves Sum - Easy DFS solution
Binary Tree
Breadth-First Search
Depth-First Search
Medium
Tree
-
Populating Next Right Pointers in Each Node II - Connections using Level Wise Traversal DFS
Binary Tree
Breadth-First Search
C++
Depth-First Search
Linked List
Medium
Tree
-
Binary Tree Level Order Traversal - Three methods - Two DFS + One BFS
Binary Tree
Breadth-First Search
C++
Medium
Tree