yes

96. Missing Evidence

Time Limit: 1 seconds

Memory Limit: 256 MB

Rating: 900

The evidence locker is in disarray, with items scattered everywhere. Somewhere in the chaos are two items that, when combined, unlock a critical clue. Quickly find the two items whose combined weight equals the target value! (Please note that you have to take the first solution combination which comes up.) Input is denoted by: nums: A list of integers representing item weights target: An integer representing the combined weight to match. Your task is to return the indices of the two numbers in nums that add up to the target $K$. You may assume there is exactly one solution, and the same element cannot be used twice. For example, given nums = [2, 7, 11, 15] and $K$ = 9, the output would be [0, 1] because nums[0] + nums[1] = 2 + 7 = 9.

You are given two space-separated integers $N$ and $K$, followed by a line of $N$ space-separated integers that form the array $nums_i$ $1 \le N \le 10^5$ $-10^9 \le nums_i \le 10^9$ $-10^9 \le K \le 10^9$

Output the two integers in the form $[p, q]$, where $p$ and $q$ are integers to be found.

Sample Input 1:
4 9
2 7 11 15

Sample Output 1:
[0, 1]

nums[0] + nums[1] = 2 + 7 = 9

KL Coding Cup March 2025 > Speed Round > Problem 1