@@ -0,0 +1,603 @@
+package com.anuragkapur.leetcode;%0A%0A/**%0A * @author anuragkapur%0A */%0Apublic class TwoSum %7B%0A%0A    /**%0A     * Running time: O(n%5E2)%0A     *%0A     * @param nums%0A     * @param target%0A     * @return%0A     */%0A    public int%5B%5D twoSum(int%5B%5D nums, int target) %7B%0A%0A        int answer%5B%5D = new int%5B2%5D;%0A%0A        for(int i=0; i%3Cnums.length; i++) %7B%0A            for(int j=i+1; j%3Cnums.length; j++) %7B%0A                if(nums%5Bi%5D+nums%5Bj%5D == target) %7B%0A                    answer%5B0%5D = i+1;%0A                    answer%5B1%5D = j+1;%0A                    return answer;%0A                %7D%0A            %7D%0A        %7D%0A%0A        return null;%0A    %7D%0A%7D%0A

Add solution to problem #1