Skip to content

Commit b10f4e8

Browse files
add 2395
1 parent 2b2e6b5 commit b10f4e8

File tree

2 files changed

+21
-1
lines changed

2 files changed

+21
-1
lines changed

README.md

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,8 @@ _If you like this project, please leave me a star._ ★
88

99
| # | Title | Solutions | Video | Difficulty | Tag
1010
|------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|-------------
11-
| 2380 |[Time Needed to Rearrange a Binary String](https://leetcode.com/problems/time-needed-to-rearrange-a-binary-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2380.java) || Medium ||
11+
| 2395 |[Find Subarrays With Equal Sum](https://leetcode.com/problems/find-subarrays-with-equal-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2395.java) || Easy ||
12+
| 2380 |[Time Needed to Rearrange a Binary String](https://leetcode.com/problems/time-needed-to-rearrange-a-binary-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2380.java) || Medium ||
1213
| 2379 |[Minimum Recolors to Get K Consecutive Black Blocks](https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2379.java) || Easy ||
1314
| 2367 |[Number of Arithmetic Triplets](https://leetcode.com/problems/number-of-arithmetic-triplets/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2367.java) || Easy ||
1415
| 2363 |[Merge Similar Items](https://leetcode.com/problems/merge-similar-items/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2363.java) || Easy ||
Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
package com.fishercoder.solutions;
2+
3+
import java.util.HashSet;
4+
import java.util.Set;
5+
6+
public class _2395 {
7+
public static class Solution1 {
8+
public boolean findSubarrays(int[] nums) {
9+
Set<Integer> sums = new HashSet<>();
10+
for (int i = 0; i < nums.length - 1; i++) {
11+
int sum = nums[i] + nums[i + 1];
12+
if (!sums.add(sum)) {
13+
return true;
14+
}
15+
}
16+
return false;
17+
}
18+
}
19+
}

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy