cpp VS Daily-Coding-DS-ALGO-Practice

} For C(n=5, k=2), the code above produces the following output: Top-down DP: -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 2 -1 -1 -1 -1 -1 -1 -1 3 3 -1 -1 -1 -1 -1 -1 4 6 -1 -1 -1 -1 -1 -1 -1 10 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 C(n=5, k=2): 10 Bottom-up DP: 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 1 2 1 -1 -1 -1 -1 -1 1 3 3 -1 -1 -1 -1 -1 1 4 6 -1 -1 -1 -1 -1 1 5 10 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 C(n=5, k=2): 10 The time complexity is O(n * k) and the space complexity is O(n * k). In the case of top-down DP, solutions to sub-problems are stored (memoized) as needed, whereas in the bottom-up DP, the entire table is computed starting from the base case. Note: a small DP table size (V=8) was chosen for printing purposes, a much larger table size is recommended. Code All code is available at: https://github.com/vsmolyakov/cpp To compile C++ code you can run the following command:

At the time when I Joined the Programme I didn't know a lot about Opensource. I just know that what is commit, pull request, issue, how to create repository but not have implemented as I should. While the program runs I contribute to Daily-Algo-Pratice, Hacking-Script and makesmatheasy and I found my many mistake which are pointed by my mentor. As well as due to the Programme I became more active on GitHub and solved many problem and create many projects which helps me a lot to learn about many expects of programming that how a great project is arranged and etc. Before the programme I have listen about Summer of code(SOC) but never Participated. It was a great experienced through out the programme

And some example projects build your own X Coding practice project based learning