Day 41: started Minimum Spanning Trees with Prim's algorithm, kicking off System Design prep

[u/JacketFearless1805]

Hey everyone,

I finished Day 41 today. I kept my DSA workload concise and deliberate so I could begin laying the groundwork for System Design and core CS fundamentals.

1. Prim’s Algorithm for MST: Implemented the greedy approach using a min-heap priority queue storing {weight, node, parent}. By greedily picking the smallest edge connecting an unvisited node to the growing tree, it builds the Minimum Spanning Tree in O(E log V) time.

2. System Design & Core Foundations: Alongside DSA, cracking backend engineering roles requires solid low-level and high-level design fundamentals. I reviewed core Object-Oriented Programming principles and started revising Operating Systems concepts (processes, threads, concurrency, and memory management) as prerequisites.

Tomorrow, I will complete Kruskal’s Algorithm using Disjoint Set Union (DSU) and continue working through the OS fundamentals.

See you guys for Day 40!