Subsequence with sum of pairs not divisible by k
Filed under Saavn
The question
Given an array and a number k, form the longest subsequence such that the sum of any pair in that subsequence is not divisible by k.
No write-up yet. Related questions below have one.
Related Saavn questions
Collected from public candidate posts and coding forums. Updated Nov 2026.