package
0.0.0-20241220224003-b7cf03a90b2b
Repository: https://github.com/szhou12/leetcode-go.git
Documentation: pkg.go.dev
# README
2875. Minimum Size Subarray in Infinite Array
Solution idea
Sliding Window + Modulo (cyclic)
Time complexity = $O(n)$
Resource
- Prefix Sum + Modulo: 【每日一题】LeetCode 2875. Minimum Size Subarray in Infinite Array