Skip to content

Commit b88e600

Browse files
committed
feat: implement two sum using hashmap
1 parent 8912749 commit b88e600

1 file changed

Lines changed: 35 additions & 0 deletions

File tree

TwoSum.java

Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
import java.util.HashMap;
2+
3+
public class TwoSum {
4+
5+
public static void main(String[] args) {
6+
7+
int[] nums = {2, 7, 11, 15, 1, 8, 3, 6};
8+
int target = 9;
9+
10+
HashMap<Integer, Integer> map = new HashMap<>();
11+
12+
for (int i = 0; i < nums.length; i++) {
13+
14+
int need = target - nums[i]; // Number needed to reach target
15+
16+
if (map.containsKey(need)) { // Check if we already have that number
17+
18+
int firstIndex = map.get(need);
19+
int secondIndex = i;
20+
21+
int firstNumber = nums[firstIndex];
22+
int secondNumber = nums[secondIndex];
23+
24+
System.out.println("Numbers: " + firstNumber + " + " + secondNumber);
25+
System.out.println("Indexes: " + firstIndex + ", " + secondIndex);
26+
27+
return;
28+
}
29+
30+
map.put(nums[i], i); // Store number and its index
31+
}
32+
33+
System.out.println("No pair found");
34+
}
35+
}

0 commit comments

Comments
 (0)