1- Write a program to solve the Longest Common Subsequence problem using dynamic programming as discussed in class. For example, if the input is X = ABCBDAB and Y = BDCABA, then the output of your program should be BCBA.
2- Suppose you are playing a video game in which you must fend off attacks from swarms of robots. The robots arrive over n seconds; in the ith second, xi robots arrive. Based on remote sensing data, you know this sequence x1, x2, . . . , xn in advance.
Hello
I am Java and Algorithm expert and interested in this project. I have reviewed your attachments and confident to handle both questions perfectly.
Please communicate to discuss further.
Regards
Anshu
I saw the project , I can complete it in 60 minutes . I am a professional coder and I am ranked at top 1% in coding websites like codeforces and topcoder (handle name : shank_punk)