1 dépôt
Awesome GitHub RepositoriesConstrained Subarray Searches
Algorithms that apply prefix sums with sliding windows or binary search to find subarrays meeting length or sum constraints.
Distinct from Minimum Length Subarray Sums: Distinct from Minimum Length Subarray Sums: covers a broader set of constraints (length, sum, product) beyond just minimum length for a sum threshold.
Explore 1 awesome GitHub repository matching scientific & mathematical computing · Constrained Subarray Searches. Refine with filters or upvote what's useful.
Awesome Constrained Subarray Searches GitHub Repositories
Trouvez les meilleurs dépôts grâce à l'IA.Nous recherchons les dépôts les plus pertinents grâce à l'IA.
- sharingsource/logicstack-leetcode
SharingSource/LogicStack-LeetCode
7,495Voir sur GitHubLogicStack-LeetCode is a curated repository of solved algorithm problems and data structure implementations, primarily drawn from the LeetCode platform. Its core identity is a structured collection of solutions designed to support technical interview preparation and competitive programming practice, with each solution accompanied by complexity analyses to help engineers understand performance trade-offs. The repository distinguishes itself through its breadth of coverage across fundamental algorithmic patterns and data structures. It includes implementations for array manipulation, string pro
Ships solutions for finding subarrays meeting various length and sum constraints using prefix sums and sliding windows.
algorithminterview-practiceinterview-questions
