Dynamic Programming – How many ways to connect the pipes? May 18, 2016 algorithms, dynamic programming 12 Comments This is an interesting problem that can be solved using Dynamic Programming (DP). The question is to count how many ways to connect the pipes like the following (Pipes … [Continue Reading...]