Daily challenge for 2026-06-13
529. Sum of Target Matches
Given two integer arrays nums and target, return the sum of all elements in nums that are present in target. Elements in nums should be added to the sum each time they appear, provided they exist in the target array.
Example:
Input: nums = [1, 2, 2, 3], target = [2, 5]
Output: 4
Run this challenge interactively in Python or JavaScript when the app loads.