Time: 45 ms (30.86%), Space: 44.9 MB (77.83%) - LeetHub

Author: Sangram03

0001-two-sum/0001-two-sum.java

@@ -0,0 +1,13 @@
+class Solution {
+    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[i] + nums[j] == target) {
+                    return new int[] {i, j};
+                }
+            }
+        }
+        // Add this line to avoid compilation error
+        return new int[] {}; // or throw new IllegalArgumentException("No solution found");
+    }
+}