CodingQuestions/2Sum.java at master · jaspreetkaur96/CodingQuestions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
publicclassSolution {
// DO NOT MODIFY THE LIST. IT IS READ ONLY
publicArrayList<Integer> twoSum(finalList<Integer> A, intB) {
ArrayList<Integer> ans = newArrayList<>();

Map<Integer, Integer> map = newHashMap<>();
for (inti=0; i<A.size(); i++) {
if (map.containsKey(B-A.get(i))) {
ans.add(map.get(B-A.get(i)) + 1);
ans.add(i+1);
break;
 }
elseif (!map.containsKey(A.get(i))) {
map.put(A.get(i), i);
 }
 }

returnans;
 }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
publicclassSolution {
// DO NOT MODIFY THE LIST. IT IS READ ONLY
publicArrayList<Integer> twoSum(finalList<Integer> A, intB) {
ArrayList<Integer> ans = newArrayList<>();

Map<Integer, Integer> map = newHashMap<>();
for (inti=0; i<A.size(); i++) {
if (map.containsKey(B-A.get(i))) {
ans.add(map.get(B-A.get(i)) + 1);
ans.add(i+1);
break;
 }
elseif (!map.containsKey(A.get(i))) {
map.put(A.get(i), i);
 }
 }

returnans;
 }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
publicclassSolution {
// DO NOT MODIFY THE LIST. IT IS READ ONLY
publicArrayList<Integer> twoSum(finalList<Integer> A, intB) {
ArrayList<Integer> ans = newArrayList<>();

Map<Integer, Integer> map = newHashMap<>();
for (inti=0; i<A.size(); i++) {
if (map.containsKey(B-A.get(i))) {
ans.add(map.get(B-A.get(i)) + 1);
ans.add(i+1);
break;
 }
elseif (!map.containsKey(A.get(i))) {
map.put(A.get(i), i);
 }
 }

returnans;
 }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
publicclassSolution {
// DO NOT MODIFY THE LIST. IT IS READ ONLY
publicArrayList<Integer> twoSum(finalList<Integer> A, intB) {
ArrayList<Integer> ans = newArrayList<>();

Map<Integer, Integer> map = newHashMap<>();
for (inti=0; i<A.size(); i++) {
if (map.containsKey(B-A.get(i))) {
ans.add(map.get(B-A.get(i)) + 1);
ans.add(i+1);
break;
 }
elseif (!map.containsKey(A.get(i))) {
map.put(A.get(i), i);
 }
 }

returnans;
 }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
publicclassSolution {
// DO NOT MODIFY THE LIST. IT IS READ ONLY
publicArrayList<Integer> twoSum(finalList<Integer> A, intB) {
ArrayList<Integer> ans = newArrayList<>();

Map<Integer, Integer> map = newHashMap<>();
for (inti=0; i<A.size(); i++) {
if (map.containsKey(B-A.get(i))) {
ans.add(map.get(B-A.get(i)) + 1);
ans.add(i+1);
break;
 }
elseif (!map.containsKey(A.get(i))) {
map.put(A.get(i), i);
 }
 }

returnans;
 }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
publicclassSolution {
// DO NOT MODIFY THE LIST. IT IS READ ONLY
publicArrayList<Integer> twoSum(finalList<Integer> A, intB) {
ArrayList<Integer> ans = newArrayList<>();

Map<Integer, Integer> map = newHashMap<>();
for (inti=0; i<A.size(); i++) {
if (map.containsKey(B-A.get(i))) {
ans.add(map.get(B-A.get(i)) + 1);
ans.add(i+1);
break;
 }
elseif (!map.containsKey(A.get(i))) {
map.put(A.get(i), i);
 }
 }

returnans;
 }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
publicclassSolution {
// DO NOT MODIFY THE LIST. IT IS READ ONLY
publicArrayList<Integer> twoSum(finalList<Integer> A, intB) {
ArrayList<Integer> ans = newArrayList<>();

Map<Integer, Integer> map = newHashMap<>();
for (inti=0; i<A.size(); i++) {
if (map.containsKey(B-A.get(i))) {
ans.add(map.get(B-A.get(i)) + 1);
ans.add(i+1);
break;
 }
elseif (!map.containsKey(A.get(i))) {
map.put(A.get(i), i);
 }
 }

returnans;
 }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
publicclassSolution {
// DO NOT MODIFY THE LIST. IT IS READ ONLY
publicArrayList<Integer> twoSum(finalList<Integer> A, intB) {
ArrayList<Integer> ans = newArrayList<>();

Map<Integer, Integer> map = newHashMap<>();
for (inti=0; i<A.size(); i++) {
if (map.containsKey(B-A.get(i))) {
ans.add(map.get(B-A.get(i)) + 1);
ans.add(i+1);
break;
 }
elseif (!map.containsKey(A.get(i))) {
map.put(A.get(i), i);
 }
 }

returnans;
 }
}