Maximum length of Bitonic Sequence

[PrakharRathore123]

Issue Id you have worked upon -

381

Briefly explain your program logic -

1) Calculate the maximum longest increasing subsequence form 0 to n 2)Store the maximum in forward 3)Calculate the maximum longest increasing subsequenec form n-1 to 0 4) Store the maximum in backward

Screenshots(Attach 2 screenshots of your own input and output) -

Checklist:

Eg - If your code follow the below guidelines. Kindly change [] to [x]

All the conditions should be fulfilled for considering your code for merging -

• [x] I have mentioned the question as comment in my solution file.
  

• [x] My code follows the guidelines of this project.
  

• [x] I have performed a self-review of my own code.
  

• [x] I have commented my code.
  

• [x] My code gives the correct output.
  

• [x] I confirm that I have not copied the code from anywhere. In case its found that I have copied even after successful merge then I can be banned from the repository and hacktoberfest.
  

• [x] I affirm that I strictly follow contributing guidelines and code of conduct.

[PrakharRathore123]

@SarthakKeshari Kindly acknowledge this

[PrakharRathore123]

@SarthakKeshari Kindly acknowledge this

[PrakharRathore123]

@SarthakKeshari Kindly acknowledge this I have saved this issue in dynamic programming folder.