Learning a new concept: Minimum Spanning Tree using Prim’s Algorithm! 🌳
It’s amazing how we can connect all vertices with minimum total weight while avoiding cycles. Graph algorithms are becoming more interesting with every step! 💡
#DSA#Graphs#PrimAlgorithm#MST
Solved LeetCode 1631 after learning Dijkstra’s Algorithm!
The key insight: updating edges dynamically in a 2D grid and minimizing the maximum effort.
Have you solved this one?
#DSA#Dijkstra#LeetCode#DSACommunity
If you feel you are too sensitive to face your fears, go out and face the world.
The external environment is not a monster, but it is full of many in the form of a few people, a few circumstances, a few internal struggles.
Face them. Get hurt. Become stronger. Then you’ll be able to face whatever comes after.
ever spent the whole day doing a little bit of everything, yet felt like you accomplished nothing?
maybe our elders were right "ek waqt mein ek hi kaam karo, aur poori lagan se karo.🤍"
one goal at a time. one step at a time.
Ever forgotten a concept you thought you knew? 🥲
Happened to me today while revising DSU and solving problems. Turns out, I forgot how to implement DFS!
Lesson learned: Learning is one thing, retaining it takes revision.
Life sucks when you’re forced to do what you hate.
But when you know exactly what you hate doing—and still choose to do it like you love it…
That’s where growth begins.
Working on a product feels completely different from building projects.
After launching the beta, every day starts with fixing bugs, improving flows, and shipping updates.
Turns out, launching isn't the finish line it's just the beginning.