https://leetcode.com/problems/two-sum/

two-sum.js

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */
var twoSum = function(nums, target) {
    for (let [i1, v1] of nums.entries()) {
        for (let [i2, v2] of nums.entries()) {
            if (i1 !== i2) {
                if (v1+v2 === target) return [i1, i2]
            }
        } 
    }
};

public int[] twoSum(int[] nums, int target) {
    for (int i = 0; i < nums.length; i++) {
        for (int j = i + 1; j < nums.length; j++) {
            if (nums[j] == target - nums[i]) {
                return new int[] { i, j };
            }
        }
    }
    throw new IllegalArgumentException("No two sum solution");
}

• I liked this solution written in java