You are given an array nums of length n and a positive integer k. A subarray of nums is called good if the absolute difference between its first and last element is exactly k, in other words, the subarray nums[i..j] is good if |nums[i] - nums[j]| == k. Return the maximum sum of a good subarray of nums. If there are no good subarrays, return 0.
active 2024-03-27 → 2024-05-20 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 55 days from 2024-03-27 to 2024-05-20. Pushes: 1 total, peak 1 in a day. Pull requests: 2 total, peak 1 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 0 total, peak 0 in a day.
- Pushes
- Pull requests
- Issues
- Comments
- Stars
Top contributors
Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| mvaibhav06 | 2 | 1 | 1 | 0 |
| TaylorPhelps | 1 | 0 | 1 | 0 |
Recent activity
Latest issues, pull requests and releases
- Pull request#1mvaibhav062024-05-20 12:40
- Pull request#1TaylorPhelps2024-05-19 01:54
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.