Hamiltonian Walks using Bitmask DPHamiltonian Walk is a common application of Bitmask DP. The problem is simple: Given a graph, find the shortest path that visits every vertex exactly once. We can solve this using: Bitmasking to stSep 18 · 9 min readtarshawkman.hashnode.dev
DP: 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 Aug 31 · 9 min readtarshawkman.hashnode.dev
Binary LiftingThe idea is to break a given parameter, say k, into its binary representation, and then traverse over its set bits. Instead of moving one step at a time, we jump in powers of two. This reduces the traJul 29 · 3 min readtarshawkman.hashnode.dev
