This blog tracks my journey to master DSA, overcome procrastination, and improve my coding skills. Let's grow together, one step at a time!
Welcome to Day 35 of my 100 Days of DSA challenge! Today, I tackled some advanced dynamic programming problems that involve string manipulation and pattern matching. From solving the "word break" and "interleaving strings" problems to addressing chal...
Welcome to Day 34 of my 100 Days of DSA challenge! Today, I delved into advanced Segment Tree concepts, focusing on optimizing range updates and queries using lazy propagation. These advanced techniques allow for efficient solutions to problems invol...
Welcome to Day 33 of my 100 Days of DSA challenge! Today’s focus was on mastering the fundamentals of segment trees, a versatile data structure designed for efficient range queries and updates. From implementing basic range sum queries to solving pro...
Welcome to Day 32 of my 100 Days of DSA challenge! Today’s focus was on tackling hard graph problems, pushing the boundaries of algorithmic thinking and optimization. The tasks included solving challenges like finding the smallest cycle, identifying ...
Welcome to Day 31 of my 100 Days of DSA challenge! Today’s focus was on advanced graph algorithms, delving into topics like shortest paths in DAGs, handling negative weights with Bellman-Ford, and exploring critical graph structures with Tarjan’s and...
Welcome to Day 30 of my 100 Days of DSA challenge! Today, I delved into advanced graph techniques and the Union-Find algorithm, a powerful tool for managing disjoint sets and solving connectivity problems. From detecting cycles in graphs to merging a...
Welcome to Day 29 of my 100 Days of DSA challenge! Today’s focus was on Tries, a versatile and efficient data structure for managing strings. I explored their implementation and tackled problems involving prefix searches, dictionary operations, and a...
Welcome to Day 28 of my 100 Days of DSA challenge! Today, I delved into advanced dynamic programming problems, tackling challenges like partitioning a set into equal sums, calculating edit distances, and finding unique paths in a grid. These problems...
Welcome to Day 27 of my 100 Days of DSA challenge! Today, I focused on intermediate dynamic programming problems, diving into classic challenges like the longest increasing subsequence, longest common subsequence, and the 0/1 knapsack problem. By app...
