Implement Dynamic Programming and Greedy Algorithm

I have solved all these questions before. Will be able to do it. I have gone through the pdf. Here is my understanding about the same. DP. Part1: You make a table of n*m. Now, dp[n][m] = min(dp[n][m-1],dp[m-1][n]) is last chars are not same, else dp[n-1][m-1]. Now this can be done Part2: I can tell you this on chat. A similar dp. Greedy: We can discuss this on the chat as well. You can trust me completely about this project. I will complete it as soon as possible

I've been a competitive programmer and I've done a lot of problems related to LCS and Greedy algorithms. I've read the PDF and I can get this project completed in 12 hours for 40$. Message me if you'd like me to start working.

I have Read the PDF and understood it. Section A - Dynamic Programming Section B - Greedy Algorithm

I have lots of experience of programming which will surely help me to do mybest with outstanding accuracy.

A proposal has not yet been provided

I am very good in algorithms and can do work as soon as possible

A proposal has not yet been provided

I'am expert in c++