awesome-repositories.com
Blog
awesome-repositories.com

Découvrez les meilleurs dépôts open-source grâce à notre recherche par IA.

ExplorerRecherches sélectionnéesAlternatives open sourceLogiciels auto-hébergésBlogPlan du site
ProjetÀ proposNotre méthodologiePresseServeur MCP
Mentions légalesConfidentialitéConditions d'utilisation
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

3 dépôts

Awesome GitHub RepositoriesArray Selection Algorithms

Algorithms for identifying specific elements within arrays based on rank or value constraints.

Distinct from Sorted Array Searchers: None of the candidates are suitable; they focus on sorting or general searching, whereas this is specifically about selection algorithms for multidimensional arrays.

Explore 3 awesome GitHub repositories matching software engineering & architecture · Array Selection Algorithms. Refine with filters or upvote what's useful.

Awesome Array Selection Algorithms 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.
  • azl397985856/leetcodeAvatar de azl397985856

    azl397985856/leetcode

    55,758Voir sur 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

    Implements the kth largest element selection using sorting, min-heaps, and quick-select algorithms.

    JavaScriptalgoalgorithmalgorithms
    Voir sur GitHub↗55,758
  • mission-peace/interviewAvatar de mission-peace

    mission-peace/interview

    11,306Voir sur GitHub↗

    This project is a comprehensive library of reference implementations for fundamental data structures and algorithms, designed to support technical interview preparation and software engineering assessments. It provides a structured collection of computational techniques for solving complex problems involving arrays, strings, graphs, trees, and mathematical analysis. The library distinguishes itself by offering specialized implementations for advanced topics, including concurrent programming patterns and geometric algorithms. It features thread-safe primitives for managing shared state and tas

    The library identifies the kth largest value within a two-dimensional array that is sorted by both rows and columns.

    Java
    Voir sur GitHub↗11,306
  • sharingsource/logicstack-leetcodeAvatar de SharingSource

    SharingSource/LogicStack-LeetCode

    7,495Voir sur 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

    Transforms array elements into their 1-based sorted ranks using a hash map.

    algorithminterview-practiceinterview-questions
    Voir sur GitHub↗7,495
  1. Home
  2. Software Engineering & Architecture
  3. Array Selection Algorithms

Explorer les sous-tags

  • Rank-Based Selection1 sous-tagAlgorithms for finding an element at a specific rank, such as the kth largest, using heaps or quick-select. **Distinct from Array Selection Algorithms:** Focuses specifically on finding the element at a given rank rather than general array selection constraints.