© 2026 Hashnode
Minimum Spanning Tree (MST) A Minimum Spanning Tree of a connected, undirected, weighted graph is a subset of edges that: Connects all vertices without cycles. Has the minimum possible total edge weight. 1. Kruskal’s Algorithm Idea: Kruskal’s al...

I’m writing this article to expand on and correct some things on my mental model for understanding data structures and algorithms. It builds on top of a previous article I wrote about understanding data structures and algorithms in a slightly more in...

Note : Started my 27-day DSA journey with Striver’s SDE Sheet!I will be journaling every day — recording what I learn, reflecting on it, and sharing it with my network to help fellow learners and aspiring developers.. Learning through videos, resourc...

There’s brute force — and then there’s brute force with a brain. That’s what backtracking is.It’s the art of exploring possibilities... but only until you realize it’s a waste of time. Then you back out faster than when someone says, “We need to talk...
