PGPrakhar Guptainprakhargupta.hashnode.dev·4d ago · 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 pat00
SKSahil Khuranaininnostaxengineering.hashnode.dev·Jul 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 k00
AMAlex Mateoinalexmateo.hashnode.dev·Jun 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 pract00
BSBerkan Seseninsesenai.hashnode.dev·May 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 valu00
Eeyanpeninai-is-coming.hashnode.dev·May 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 ...00
JPJoshitha Priya Sinjoshithapriyas.hashnode.dev·Apr 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 fr00
SMSaipriya M Raviinmytechtales.hashnode.dev·Apr 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. Yo00
IOIyanuloluwa Okinbaloyeiniyanuokin.hashnode.dev·Apr 12 · 23 min readVITERBI ALGORITHM FOR PART OF SPEECH TAGGINAs we might be aware by now the Viterbi algorithm is one of the most powerful of the machine learning algorithms present in Natural Language Processing, I'm going to demonstrate how it can be used in 10
RCRashmitha Challaininsidethealgorithm.hashnode.dev·Apr 9 · 6 min readFrom Brute Force to Binary Search: Mastering Longest Increasing SubsequenceHello coders, Let's solve a problem today, don't worry about the pattern or solution just bring a book and a pen or open a whiteboard to illustrate. Problem for the day: Alex an adventurous traveller,00
Ttracelitinblog.tracelit.dev·Apr 9 · 1 min readLeetCode 746: Min Cost Climbing Stairs — Step-by-Step Visual TraceEasy — Dynamic Programming | Array The Problem Find the minimum cost to reach the top of a staircase where you can climb either 1 or 2 steps at a time, and each step has an associated cost. You can start from either step 0 or step 1. Approach Use dyn...00
