misceasy
Dynamic Paths
hackthebox
Task: solve 100 rounds of minimum path sum problems over a socket, given grids with right/down movement only. Solution: classic dynamic programming (LeetCode #64) with pwntools automation to parse grid dimensions, compute dp table, and send answers for all 100 rounds.
$ ls tags/ techniques/
dp_grid_traversalminimum_path_sumsocket_automationparsing
🔒
Permission denied (requires tier.pro)
Sign in to access full writeups
Create a free account with GitHub, then upgrade to Pro.
$ssh [email protected]