we have an integer N, We have to find the number of all possible distinct binary strings of the length N, which have at least three consecutive 1s. So if n = 4, then the numbers will be 0111, 1110, 1111, so output will be 3.
Can anyone have any idea how to use dynamic programming here. It will be a great help. Thanks for advance.