A LeetCode problem “Two Sum” implemented with JavaScript and MaxMSP separately – [Patch a dirty #005]

I’m practising my programming skills on LeetCode.  This demo implemented the Two Sum:  Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use the same element twice. Example: Given nums = [2, 7, 11, 15], target = 9,  Because nums[0] + nums[1] = 2