Find the shortest clear path from the top-left to bottom-right of a 0-1 grid. We explain the intuition, walk through…
Browsing: Intermediate
See how to run Dijkstra with a set instead of a heap. We break down the idea, walk through clear…
Learn to implement Dijkstras Algorithm with a Priority Queue using a min-heap (heapq). We cover the problem statement, clear intuition,…
Learn how to find single source shortest path in a weighted directed acyclic graph (DAG) in linear time. We explain…
Find the Shortest Path in an Undirected Graph from a source to every other node when every edge costs 1.…
Check if you can finish every course when some need to be done first. We build the course graph, run…
Learn how to detect cycle in a directed graph with Kahn’s algorithm. Simple intuition, commented Python code, step-by-step dry run,…
Learn how to perform topological sorting of a DAG using Kahn’s algorithm (BFS based). Clear steps, commented Python code, dry-run…
See how to solve “detect cycle in a directed graph” using depth-first search and two helper arrays. Simple idea, commented…
Learn how to test if an undirected graph is bipartite by coloring it with two colors. Simple DFS idea, commented…