Double Helix Problem – Dynamic Programming Solutions
This is a C++ Program that Solves Double Helix Problem using Dynamic Programming technique. Problem Description Two finite, strictly increasing, integer sequences are given. Any common integer between the two sequences constitute an intersection point. You can ‘walk” over these two sequences in the following way: 1. You may start at the beginning of any … Read more