Practice problems across 75+ categories
Practice problems frequently asked at Topological Sort • 36 problems | 0 Easy | 15 Medium | 20 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 16 | Find Eventual Safe States | Medium | Depth-First SearchBreadth-First SearchGraph |
| 17 | Frequencies of Shortest Supersequences | Hard | ArrayStringBit Manipulation |
| 18 | Largest Color Value in a Directed Graph | Hard | Hash TableDynamic ProgrammingGraph |
| 19 | Longest Cycle in a Graph | Hard | Depth-First SearchBreadth-First SearchGraph |
| 20 | Longest Increasing Path in a Matrix | Hard | ArrayDynamic ProgrammingDepth-First Search |
| 21 | Longest Path With Different Adjacent Characters | Hard | ArrayStringTree |
| 22 | Loud and Rich | Medium | ArrayDepth-First SearchGraph |
| 23 | Maximum Employees to Be Invited to a Meeting | Hard | Depth-First SearchGraphTopological Sort |
| 24 | Maximum Profit from Valid Topological Order in DAG | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 25 | Minimize Maximum Value in a Grid | Hard | ArrayUnion FindGraph |
| 26 | Minimum Height Trees | Medium | Depth-First SearchBreadth-First SearchGraph |
| 27 | Minimum Runes to Add to Cast Spell | Hard | ArrayDepth-First SearchBreadth-First Search |
| 28 | Number of Increasing Paths in a Grid | Hard | ArrayDynamic ProgrammingDepth-First Search |
| 29 | Number of Restricted Paths From First to Last Node | Medium | Dynamic ProgrammingGraphTopological Sort |
| 30 | Number of Ways to Arrive at Destination | Medium | Dynamic ProgrammingGraphTopological Sort |
Powerful online tools to boost your productivity
Coding Ground For Developers
Code, Edit, Run and ShareIgnite your coding potential on Coding Ground - an immersive online platform for hands-on learning, collaboration, and skill development.
