Find subsets of size 2 and 3 with target sums
Filed under PayU
The question
Given an array of integers, find all subsets of size 2 summing to K and subsets of size 3 summing to K in O(N) time.
No write-up yet. Related questions below have one.
Related PayU questions
Collected from public candidate posts and coding forums. Updated Nov 2026.