dsa1 min read
Task Scheduler — Greedy with Most Frequent First
Find the minimum intervals to execute all tasks with cooldown n by greedily scheduling the most frequent task first.
Read →
All Posts
1575 articles
dsa1 min read
Rotting Oranges — Multi-Source BFS
Find minutes until all oranges rot using multi-source BFS starting from all initially rotten oranges simultaneously.
Read →
dsa1 min read
Number of Islands — BFS or DFS Flood Fill
Count islands in a 2D grid using BFS or DFS to flood-fill connected land cells, marking them visited.
Read →
dsa1 min read
Course Schedule — Topological Sort BFS (Kahns Algorithm)
Detect if all courses can be finished (no cycle) using Kahn's algorithm: BFS on in-degree zero nodes.
Read →
dsa1 min read
Course Schedule II — Topological Order via BFS
Return a valid course order using Kahn's BFS topological sort, or empty array if a cycle exists.
Read →
Page 152 of 315