Day4_LeetCode1.java

class Solution {
    public int[] twoSum(int[] nums, int target) {
        int [] sol = new int [2];
        for (int i=0 ; i < nums.length; i++){
            for (int j=i+1; j < nums.length; j++) {
                if (nums[i]+nums[j]==target){
                    sol[0]=i;
                    sol[1]=j;
                }
            }
        }
        return sol;
    }
}

//more optimized
class Solution {
    public int[] twoSum(int[] nums, int target) { 
        //inspired from exisiting solution
        for (int i=0; i < nums.length; i++) {
            for (int j=i+1; j < nums.length; j++) {
                if (nums[j] + nums[i] == target){
                    return new int[] {i, j};
                }
            }
        }
        return null;
    }
}