Excited to share that I won the 21-Day #geekstreak2024 Challenge with @DeutscheBank and @geeksforgeeks , This challenge motivated me to explore new challenges and grow my skills. Thank you for this amazing experience and the exclusive DB-sponsored bag! 🎒

🔥 Day 430 of #geekstreak2025 ✅ GFG POTD: Minimum Cost to Cut a Stick 💡 Used interval dp added boundaries, sorted cuts, and computed minimum cost using dp[i][j] over all possible first cuts. #dsa #gfg #dp

Posting from mobile..😅

🔥 Day 428 of #geekstreak2025 ✅ GFG POTD: Interleaved Strings #geekstreak2025 @gfg #dsa

🔥 Day 426 of #geekstreak2025 ✅ GFG POTD: Shortest Common Supersequence 💡 Used Dynamic Programming built the LCS table to find the length of the shortest string that contains both s1 and s2 as subsequences. formula used: len = n + m - LCS(s1, s2) #dsa #gfg #java

🔥 Day 425 of #geekstreak2025 ✅ GFG POTD: Stock Buy and Sell with Cooldown 💡 Used Dynamic Programming (state compression) maintaining 3 states: dp0: not holding, no cooldown dp1: holding a stock dp2: in cooldown after selling #dsa #java #dynamicprogramming #geekstreak2025

🔥 Day 424 of #geekstreak2025 ✅ GFG POTD: Chocolate Pickup II 💡 Solved using 3d dynamic programming treated two paths moving simultaneously and maximized total chocolates while avoiding blocked cells (-1), used dp state (i, j, k) representing two travelers positions. #dsa #gfg

🔥 Day 423 of #geekstreak2025 ✅ GFG POTD: Number of paths in a matrix with k coins 💡 Solved using Recursion + 3D DP memoization tracked position (i, j) and coin sum to count all valid paths. #dsa #gfg #java #dynamicprogramming #recursion #geekstreak2025

🔥 Day 422 of #geekstreak2025 ✅ GFG POTD: Weighted Job Scheduling 💡 Solved using dynamic programming + binary search picked the optimal non-overlapping job for max profit. #dsa #gfg #java #dynamicprogramming #geekstreak2025

🔥 Day 421 of #geekstreak2025 ✅ GFG POTD: Ways To Tile A Floor 💡 Used a Fibonacci-based DP relation each tile arrangement depends on the previous two configurations. #dsa #gfg #java #dynamicprogramming #geekstreak2025

🔥 Day 419 of #geekstreak2025 ✅ GFG POTD: Frog Jump 💡 Solved using recursion + memoization to minimize energy cost while jumping 1 or 2 steps. classic dp on 1d state.... #dsa #gfg #java #dynamicprogramming #geekstreak2025

🔥 Day 418 of #geekstreak2025 ✅ GFG POTD: Safe States 💡 Reversed the graph and used Kahn’s Algorithm to detect nodes that eventually lead to terminal nodes... #dsa #gfg #java #graph #topologicalsort #geekstreak2025

🔥 Day 417 of #geekstreak2025 ✅ GFG POTD: Max DAG Edges 💡 Used topological sort to find a valid ordering of nodes, then counted all possible edges that can be added without forming a cycle. #dsa #gfg #java #graph #topologicalsort #geekstreak2025

🔥 Day 416 of #geekstreak2025 ✅ GFG POTD: Course Schedule II 📚 Solved using Kahn’s Algorithm , pushed 0 - degree nodes into a queue, and built a valid course order efficiently. #dsa #gfg #java #graph #topologicalsort #geekstreak2025

🔥 Day 415 of #geekstreak2025 ✅ GFG POTD: Shortest Cycle 🧠 Applied BFS from every node while tracking parent nodes detected cycles and updated the shortest length dynamically. #dsa #gfg #java #graph #bfs #geekstreak2025

🔥 Day 414 of #geekstreak2025 ✅ GFG POTD: Replace O’s with X’s 🧠 Used DFS from boundary O’s to mark safe regions then flipped the rest to X’s. A neat application of flood fill logic to isolate enclosed areas #dsa #gfg #java #dfs #matrix #geekstreak2025

🔥 Day 413 of #geekstreak2025 ✅ GFG POTD: Graph Diameter 🧠 Applied double BFS first to find the farthest node, second to compute the maximum distance #dsa #gfg #java #graph #bfs #geekstreak2025

🔥 Day 412 of #geekstreak2025 ✅ GFG POTD: Distance of Nearest Cell Having 1 🧠 Used multi-source BFS pushed all 1s as starting points and expanded outward to compute the shortest distance for every cell. clean grid traversal logic using a queue-based approach #dsa #gfg #java

🔥 Day 411 of #geekstreak2025 ✅ GFG POTD: Find K Smallest Sum Pairs 🧠 Used a min-heap to efficiently pick the next smallest pair sum pushing only relevant combinations instead of all possible ones. #dsa #gfg #java #heap #priorityqueue #geekstreak2025

🔥 Day 410 of #geekstreak2025 ✅ GFG POTD: Minimum Cost of Ropes 🧠 Solved using a min-heap (priorityqueue) always connect the two smallest ropes first to minimize total cost. #dsa #gfg #java #heap #priorityqueue #greedy #geekstreak2025

🔥 Day 409 of #geekstreak2025 ✅ GFG POTD: Minimum Steps to Halve Sum 🧠 Used a max-heap (priorityqueue) to repeatedly halve the largest element until total sum dropped to half. #dsa #gfg #java #heap #priorityqueue #greedy #geekstreak2025