TwoSum.js

/**
 * 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.
 *
 * Given nums = [2, 7, 11, 15], target = 9,
 * Because nums[0] + nums[1] = 2 + 7 = 9,
 * return [0, 1].
 *
 * Result: Accepted
 */

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */
let twoSum = function (nums, target) {
    for (let i = 0; i < nums.length; i++) {
        for (let j = i + 1; j < nums.length; j++) {
            if (target === (nums[i] + nums[j])) {
                return [i, j];
            }
        }
    }

    return [0, 0];
};

if (twoSum([2, 5, 5, 11], 10).toString() === [1, 2].toString()) {
    console.log("pass")
} else {
    console.error("failed")
}