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 st9 min read·tarshawkman.hashnode.devSep 18
DP: A complex term for memoizationLearn the 5 common Dynamic Programming patterns, how to identify them, build DP states and transitions, and optimize your DP solutions.9 min read·tarshawkman.hashnode.devAug 31
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 tra3 min read·tarshawkman.hashnode.devJul 29
