Subscribe to unlock.

Thanks for using smurfing.ai! To view this problem you need an active premium subscription.

Problem: Longest Subsequence with at Most K Different Adjacent Pairs