awesome-repositories.com
المدونة
MCP
awesome-repositories.com

اكتشف أفضل مستودعات المصادر المفتوحة باستخدام بحث مدعوم بالذكاء الاصطناعي.

استكشفعمليات بحث منسقةبدائل مفتوحة المصدربرمجيات ذاتية الاستضافةالمدونةخريطة الموقع
المشروعخادم MCPحولكيفية ترتيب النتائجالصحافة
قانونيالخصوصيةالشروط
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

3 مستودعات

Awesome GitHub RepositoriesContinuous Subarray Counting

Methods for calculating the total count of contiguous subarrays ending at each index.

Distinct from Subarray Sum Algorithms: Focuses on the total count of continuous subarrays rather than just those satisfying a specific sum range.

Explore 3 awesome GitHub repositories matching scientific & mathematical computing · Continuous Subarray Counting. Refine with filters or upvote what's useful.

Awesome Continuous Subarray Counting GitHub Repositories

اعثر على أفضل المستودعات باستخدام الذكاء الاصطناعي.سنبحث عن أفضل المستودعات المطابقة باستخدام الذكاء الاصطناعي.
  • azl397985856/leetcodeالصورة الرمزية لـ azl397985856

    azl397985856/leetcode

    55,758عرض على GitHub↗

    This project is a curated educational resource and solution repository for algorithmic challenges, specifically focused on LeetCode problems. It serves as a technical reference for common data structures and algorithmic patterns, providing verified code implementations across multiple programming languages alongside detailed logic and complexity analysis. The repository functions as a comprehensive study guide for competitive programming and technical interview preparation. It includes specialized learning tools such as an Anki flashcard dataset for spaced repetition and a browser extension t

    Determines the total number of contiguous subarrays within an array by summing occurrences.

    JavaScriptalgoalgorithmalgorithms
    عرض على GitHub↗55,758
  • sharingsource/logicstack-leetcodeالصورة الرمزية لـ SharingSource

    SharingSource/LogicStack-LeetCode

    7,495عرض على GitHub↗

    LogicStack-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

    Uses prefix products with a sliding window to count subarrays whose product meets or exceeds a threshold.

    algorithminterview-practiceinterview-questions
    عرض على GitHub↗7,495
  • chanda-abdul/several-coding-patterns-for-solving-data-structures-and-algorithms-problems-during-interviewsالصورة الرمزية لـ Chanda-Abdul

    Chanda-Abdul/Several-Coding-Patterns-for-Solving-Data-Structures-and-Algorithms-Problems-during-Interviews

    4,129عرض على GitHub↗

    This repository is a curated guide and implementation library of coding patterns used to solve data structures and algorithms problems. It serves as a technical interview study resource, providing a comprehensive set of strategies and computational logic examples for optimizing time and space complexity. The project focuses on standardized algorithmic patterns, including sliding windows, two pointers, and dynamic programming. It features specific implementations for a wide range of challenges, such as LeetCode problem solutions and specialized techniques like cyclic sort and bitwise XOR opera

    Implements a sliding window to find contiguous subarrays with a product less than a target value.

    algorithmscoding-interviewsdata-structures
    عرض على GitHub↗4,129
  1. Home
  2. Scientific & Mathematical Computing
  3. Subarray Sum Algorithms
  4. Continuous Subarray Counting

استكشف الوسوم الفرعية

  • Subarray Product Filtering3 وسوم فرعيةAlgorithms for identifying contiguous subarrays whose elements multiply to a value below a target. **Distinct from Continuous Subarray Counting:** Focuses on products of elements rather than counting subarrays or summing elements.