Your question is Two-Sum Problem. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
While preparing a Box storage report, you receive an array of file sizes and a target combined size. Return the indices of the two files whose sizes add up to the target.
Use each array element at most once. You may assume every valid input has exactly one solution. Return the indices in increasing order. If no pair exists, return an empty list.
Implement two_sum(nums, target):
nums is a list of integers representing file sizes.target is an integer representing the required combined size.i and j such that nums[i] + nums[j] == target.i < j.def two_sum(nums, target):