Mar 7 · 4 min read · Anyone who has travelled in the Delhi Metro knows an interesting fact: The shortest route is not always the best route. A path with fewer stations can feel worse if it requires multiple interchanges.A slightly longer route can feel easier if you st...
Join discussionOct 1, 2025 · 4 min read · Admiration of a Mathematician Growing up, I loved sports, and my favorite people were athletes. Their discipline, teamwork, and determination inspired me. However, as I matured, I still respected their grit and discipline, but I entered the engineeri...
Join discussion
Aug 19, 2025 · 3 min read · Introduction Algorithms power our everyday life — from unlocking your phone with a fingerprint to finding the fastest route on Google Maps. One of the most widely used algorithms in pathfinding and navigation is Dijkstra’s algorithm, introduced in 19...
Join discussionAug 14, 2025 · 4 min read · 1. Introduction Shortest path algorithms are fundamental in graph theory and computer science, with wide applications ranging from GPS navigation systems to network routing protocols. This article covers three major algorithms: Dijkstra's Algorithm:...
Join discussion
Aug 5, 2025 · 8 min read · Introduction Pathfinding is a fundamental topic in computer science, with applications in fields like navigation, AI/ML, network routing, and many others. In this article, we compare four core pathfinding algorithms: breadth-first search (BFS), depth...
Join discussion
Jun 23, 2025 · 9 min read · Introduction to Dijkstra’s Algorithm: Finding the Easiest Path In a sprawling ant colony, some tunnels are easy to travel through, while others are rugged or filled with obstacles. When an ant seeks the easiest path to reach food, it needs a way to n...
Join discussion
Jun 17, 2025 · 3 min read · Introduction Finding the shortest path from one node to all others in a graph is a core building block in computer science. Since 1959, Dijkstra’s algorithm has been the go-to solution for graphs with non-negative weights. It runs in O(m + n log n) t...
Join discussionMay 20, 2025 · 16 min read · Graphs ! an important from DSA for interview preparation point of view as it’s assumed to be most complicated topic that most learner fail to recognize patterns of questions or you can say they are not able to relate other topics like tree,matrices e...
Join discussion
May 10, 2025 · 5 min read · “Dijkstra’s algorithm turns networks into maps — and complexity into clarity” What is Dijkstra's Algorithm? Definition: Dijkstra's Algorithm is a method used to find the shortest path from one point or node (called a source) to all other points in a ...
Join discussionMay 7, 2025 · 4 min read · Problem Overview: Navigating a Time-Locked Dungeon Grid Imagine you're trapped in a dungeon that looks like a grid. Each cell in the grid represents a room. Some rooms are instantly accessible, while others are locked and only become accessible after...
Join discussion