AAaditya SarafAug 31 · 9 min readDP: A complex term for memoizationDynamic Programming can feel confusing because every problem looks different. But many DP problems follow the same patterns. In this blog, we will look at 5 common forms of DP: Knapsack Form Ending tarshawkman.hashnode.dev
SSahil KhuranaJul 14 · 9 min readStatistically Typed vs Dynamically Typed Languages: A Deep Dive Key Takeaways Static typing is the compiler doing your QA before you ship. Not a luxury feature — for anything that lives longer than six months or gets touched by more than two developers, it’s whatinnostaxengineering.hashnode.dev
PPrakhar GuptaJul 9 · 33 min readDP on Strings: A Competitive Programmer's GuideString DP is one of the most frequently tested Dynamic Programming topics in Competitive Programming. Although the problems may look different most of them are built on a small number of recurring patprakhargupta.hashnode.dev
SSahil KhuranaJul 3 · 10 min readDeep Dive into Shopify’s Global Objects in LiquidKey Takeaways Global objects are just there — every Liquid file, zero setup, no imports needed. Cart state, customer info, product details, store settings — it’s all sitting there waiting. Once you kinnostaxengineering.hashnode.dev
AAbstract AlgorithmsJun 18 · 12 min readDynamic Programming Patterns: Solving the 0/1 Knapsack and LCS SeriesTLDR: Dynamic Programming (DP) resolves complex optimization problems by breaking them down into overlapping subproblems, storing results to prevent redundant calculations. This guide introduces the cabstractalgorithms.hashnode.dev
AAlex MateoJun 8 · 9 min readHow to Derive Any DP Table From Scratch (Without Memorizing Solutions)Most DP guides teach you solutions. This one teaches you derivation. There is a meaningful difference between the two. When you memorize a solution, you can reproduce it on the exact problem you practalexmateo.hashnode.dev
BBerkan SesenMay 4 · 14 min readValue Iteration vs Q-Learning: Dynamic Programming Meets RLYou have a map of the frozen lake. Every crack in the ice, every slippery patch, every hole is marked. You can sit at your desk and plan the perfect route before stepping foot on the ice. That is valusesenai.hashnode.dev
EeyanpenMay 4 · 11 min readWhy Does Semantic Chunking Need an Embedding API?Fixed-length chunking requires no external services, yet semantic chunking absolutely needs an Embedding API — why? The Short Answer The core idea of semantic chunking is to split text at semantic boundaries. Determining whether "two pieces of text ...ai-is-coming.hashnode.dev
JJoshitha Priya SApr 30 · 2 min read🐸 Why Greedy Fails in the Frog Jump ProblemAt the very beginning when I came across the problem “Frog Jump”, I thought about using the greedy algorithm right away. As the problem states, we need to determine the minimum energy needed by the frjoshithapriyas.hashnode.dev
SSaipriya M RaviApr 26 · 4 min readDemystifying Dynamic ProgrammingImagine you’re counting the number of stairs in a building. You count to 10. If someone asks, "How many stairs would there be if we added one more?", you don't go back to the bottom and start over. Yosaipriya-builds.hashnode.dev
