A interesting problem. I followed the hint, using nC2 where n is the length of the continuous substring. There is also a much more elegant sliding window solution. What's funny is, I got the pattern but I forgot how to slide the window, so I missed the better solution. But anyway, using math is still enough to figure out the problem.
active 2023-11-09 → 2023-11-09 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 1 days from 2023-11-09 to 2023-11-09. Pushes: 1 total, peak 1 in a day. Pull requests: 0 total, peak 0 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 |
|---|---|---|---|---|
| DawnAve | 1 | 1 | 0 | 0 |
Recent activity
Latest issues, pull requests and releases
No issue or PR events — this repo's activity is pushes only.
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.