Longest increasing subsequence problem

I need to ask that in a lis problem how can we print the lis array by doing some modification in the below code…
Code link:: https://ide.codingblocks.com/s/110298

Hello @sunny.kumar2016,

You can use two variables right and left to store the index of required array.
Then, using those index, print the array.

This is what you have explained before in the maximum subarray sum video.

I have written the necessary comments in the code:

Hope, this would help.
Give a like, if you are satisfied.

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.