← Qualcomm questions

Find Triplet Summing to K in Original Ascending Order

Filed under Qualcomm

Given an array of integers, find if there exists a triplet (arr[i], arr[j], arr[k]) such that i < j < k and arr[i] + arr[j] + arr[k] == K.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Qualcomm questions

Collected from public candidate posts and coding forums. Updated Nov 2026.