Longest increasing subsequence

#1

https://ide.codingblocks.com/s/88456 this code is not passing two test cases

#2

int dp[100]={1} wont fill the whole array with 1.
Use memset(dp,1,sizeof(dp)).
when your are iterating inner i loop , rum=n i from 0 to <j not <n;

#4

https://ide.codingblocks.com/s/88456 still getting wrong answer

#5

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.