Can we solve it by bitmasking?

#1

I first applied brute force using bitset .Can i use dp with bitset in this problem??

#2

hello @namanjain7206
yeah this problem has a dp solution.
hint->it is variation of Longest increasing subsequence problem

#3

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.