TiagoDynamic Programming: Longest Increasing Subsequence (LIS)This article will walk you through how to solve another classic DP problem: Longest Increasing Subsequence (LIS). To make it a bit more…Feb 3, 20194Feb 3, 20194
TiagoDynamic Programming: Cutting SticksThis article will walk you through a problem called Cutting Sticks¹ from UVA (Universidad de Valladolid)’s problem set². Read the original…Jan 8, 20193Jan 8, 20193
TiagoDynamic Programming: An induction approachDynamic Programming (DP) is a generic programming technique that uses memorisation in order to solve problems that can be broken down into…Dec 27, 20186Dec 27, 20186