Ways To Cover Distance, is a Dynamic Programming related problem and in this post we will see how we can solve this challenge in C++

given a distance 'd'.Find in how many ways can we cover that distance using only 1,2 and 3 steps. for distance = 4 1+3 != 3+1 steps,so unlike coin change problem this can't be done that way

Please check the main.cpp snippet for the solution.

This solution originally posted at: Github by @susantabiswas