---
title: "Aaditya Saraf (@aadityasaraf) | Hashnode"
description: "huehuehue. Read the latest articles by Aaditya Saraf on Hashnode."
url: "https://hashnode.com/@aadityasaraf"
---

@aadityasaraf

# Aaditya Saraf

@aadityasaraf · nanya · Joined October 2025

huehuehue

### [Hamiltonian Walks using Bitmask DP](https://tarshawkman.hashnode.dev/hamiltonian-walks-using-bitmask-dp?utm_source=hashnode&utm_medium=feed)

Hamiltonian 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 st

9 min read · [tarshawkman.hashnode.dev](https://tarshawkman.hashnode.dev/hamiltonian-walks-using-bitmask-dp?utm_source=hashnode&utm_medium=feed)

[Sep 18](https://hashnode.com/posts/hamiltonian-walks-using-bitmask-dp/6aaccb6fc72fa9a8dcee3de2)

### [DP: A complex term for memoization](https://tarshawkman.hashnode.dev/dynamic-programming-5-common-dp-patterns?utm_source=hashnode&utm_medium=feed)

Learn 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.dev](https://tarshawkman.hashnode.dev/dynamic-programming-5-common-dp-patterns?utm_source=hashnode&utm_medium=feed)

[Aug 31](https://hashnode.com/posts/dynamic-programming-5-common-dp-patterns/6a95cd4a1aca28c7d5b33807)

### [Binary Lifting](https://tarshawkman.hashnode.dev/binary-lifting?utm_source=hashnode&utm_medium=feed)

The 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 tra

3 min read · [tarshawkman.hashnode.dev](https://tarshawkman.hashnode.dev/binary-lifting?utm_source=hashnode&utm_medium=feed)

[Jul 29](https://hashnode.com/posts/binary-lifting/6a6a559be2a3a4fbe070824e)