How should I practice Find Pair Closest to K (for E5 :)?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Meta online assessment problems in FastPrep.

Is Find Pair Closest to K (for E5 :) associated with Meta?

FastPrep tags this as a Meta coding interview or online assessment practice problem when the problem catalog has that company context.

FastPrep

Problem · Array

Find Pair Closest to K (for E5 :)

● EasyMetaFULLTIMEPHONE SCREEN

See Meta hiring insights

Find and return a pair of integers in a sorted array (all integers are positive) that, when summed up, bring you the closest to the value of k.

Example Input: [5, 8, 14, 17, 25, 40, 43] k: 35 Expected Output: (8, 25) since 8 + 25 = 33 which is closest to 35 (sum could be equals to, smaller or larger than k)

Function Description

Complete the function findPairClosestToK in the editor.

findPairClosestToK has the following parameters:

1. int[] arr: a sorted array of integers
2. int k: the target sum

Returns

int[]: an array of two integers that are closest to the target sum k

The other question was ~~

Examples

01 · Example 1

arr = [5, 8, 14, 17, 25, 40, 43]
k = 35
return = [8, 25]

The pair of integers (8, 25) when summed up, give us 33 which is the closest to the value of k which is 35. The sum could be equal to, smaller or larger than k, but in this case, 33 is the closest sum to k that can be obtained from the given array.