/* 1 Two Sum I
 * O(n^2) runtime, O(n) space - Brute force
 */

public class Solution {
  public int[] twoSum(int[] nums, int target) {
    for (int i = 0; i < nums.length; i++) {
      int ni = nums[i];
      for (int j = i + 1; j < nums.length; j++) {
        int nj = nums[j];
        if (ni + nj == target) {
          return new int[] {i, j};
        }
      }
    }
    throw new IllegalArgumentException("No two sum solution");
  }
}
@@ -1,62 +1,26 @@
 /* 1
- Two Sum I%0D%0A * O(n%5E2) runtime, O(n) space - Brute forc
+25.valid_palindrom
 e%0D%0A 
@@ -414,8 +414,10 @@
 %0D%0A  %7D%0D%0A%7D
+%0D%0A

update lc 125