4d ago · 4 min read · Graphs are simply a language for relationships. Whether you are designing a power grid, a social network, or a compiler, the patterns remain the same. Master BFS/DFS, understand Topological Sorting, a
Join discussion4d ago · 11 min read · Graphs are the most feared topic in coding interviews — not because they're impossible, but because most people learn the algorithms in isolation without understanding when to use each one. This guide
Join discussion
Apr 10 · 2 min read · Finding the shortest path Day 106 of 149 👉 Full deep-dive with code examples The GPS Navigation Analogy When you ask Google Maps for directions: It doesn't try every possible route It smartly finds the shortest path Considers traffic, distance, ti...
Join discussionApr 9 · 2 min read · Exploring graphs breadth or depth first Day 105 of 149 👉 Full deep-dive with code examples The Maze Exploration Analogy Imagine you're lost in a maze. Two strategies: Strategy 1 (DFS - Depth First): Pick a path and go as far as possible Hit a dead...
Join discussionApr 6 · 3 min read · I recently launched Nice Graphs, a free online tool that converts plain text into charts using AI. You paste a paragraph, a report excerpt, or any text containing numbers, and it automatically extract
Join discussion
Jan 16 · 5 min read · Tarjan’s algorithm is used to find bridges in a graph. But under the hood, it’s a story of selfish parents and selfish children in a family tree where nobody dies. Imagine a family where ancestors give birth to their children and those children give ...
Join discussion
Oct 19, 2025 · 3 min read · Problem There are n servers numbered from 0 to n - 1 connected by undirected server-to-server connections forming a network where connections[i] = [a<sub>i</sub>, b<sub>i</sub>] represents a connection between servers a<sub>i</sub> and b<sub>i</sub>....
Join discussionOct 18, 2025 · 3 min read · Problem Given a list of accounts where each element accounts[i] is a list of strings, where the first element accounts[i][0] is a name, and the rest of the elements are emails representing emails of the account. Now, we would like to merge these acco...
Join discussionOct 12, 2025 · 2 min read · Introduction A disjoint set is a data structure that helps determine if two nodes are part of the same component efficiently. While BFS or DFS can be used to check this, a disjoint set can perform the task in constant time. It is particularly useful ...
Join discussion
