// practice ground

Problems

#	Title	Topics	Difficulty
101	Rotate Image	Arrays Matrix	Medium
102	Spiral Matrix Traversal	Arrays Matrix Simulation	Medium
103	Set Matrix Zeroes	Arrays Matrix	Medium
104	Word Search	Backtracking Matrix	Medium
105	N-Queens Count	Backtracking	Hard
106	Valid Sudoku	Hashing Matrix	Medium
107	Course Schedule	Graphs	Medium
108	Detect Cycle in a Directed Graph	Graphs	Medium
109	Dijkstra Shortest Path	Graphs Heaps / Priority Queue	Hard
110	Minimum Spanning Tree (Kruskal's Algorithm)	Graphs Greedy Sorting Union Find (Disjoint Set)	Hard
111	Topological Sort (Lexicographically Smallest)	Graphs	Medium
112	Word Ladder — Shortest Transformation Length	Graphs Strings	Hard
113	Kth Smallest Element in a BST	Binary Search Tree Trees	Medium
114	Balanced Binary Tree Check	Trees	Easy
115	Path Sum	Trees	Easy
116	Right Side View of Binary Tree	Trees	Medium
117	Kth Largest Element in a Stream	Heaps / Priority Queue	Medium
118	Merge K Sorted Arrays	Arrays Heaps / Priority Queue	Hard
119	Top K Frequent Elements	Hashing Heaps / Priority Queue	Medium
120	Find Median from Data Stream	Design Heaps / Priority Queue	Hard
121	Task Scheduler	Greedy Hashing Heaps / Priority Queue	Medium
122	Activity Selection Problem	Greedy	Easy
123	Fractional Knapsack	Greedy	Medium
124	Job Sequencing with Deadlines	Greedy	Medium
125	Meeting Rooms II	Greedy Heaps / Priority Queue Intervals	Medium

Showing 101–125 of 1062

Prev 3 4 5 6 7 Next