awesome-repositories.com
博客
awesome-repositories.com

通过 AI 驱动的搜索,发现最优秀的开源仓库。

探索精选搜索开源替代品自托管软件博客网站地图
项目关于排名机制媒体报道MCP 服务器
法律隐私政策服务条款
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

2 个仓库

Awesome GitHub RepositoriesStack Implementations

Practical implementations of last-in-first-out data structures.

Distinct from Data Structure Implementations: Specific implementation of a stack, whereas the parent covers multiple fundamental data structures.

Explore 2 awesome GitHub repositories matching scientific & mathematical computing · Stack Implementations. Refine with filters or upvote what's useful.

Awesome Stack Implementations GitHub Repositories

用 AI 发现最棒的仓库。我们将通过 AI 为您搜索最匹配的仓库。
  • mandliya/algorithms_and_data_structuresmandliya 的头像

    mandliya/algorithms_and_data_structures

    6,145在 GitHub 上查看↗

    This project is a comprehensive collection of C++ libraries and toolkits providing reference implementations for data structures, graph algorithms, and bitwise logic. It serves as a C++ algorithm reference containing over 180 solved coding problems and a specialized toolkit for competitive programming. The repository distinguishes itself through extensive low-level bit manipulation libraries for parity checks, endianness detection, and XOR-based logic. It also provides a wide array of reference solutions for complex algorithmic challenges involving backtracking, graph theory, and dynamic prog

    Provides a LIFO stack implementation supporting push, pop, and peek operations.

    C++algorithmbit-manipulationc
    在 GitHub 上查看↗6,145
  • hoanhan101/algohoanhan101 的头像

    hoanhan101/algo

    3,678在 GitHub 上查看↗

    This project is a Go algorithm implementation library and a reference for data structures. It serves as a collection of solved coding interview problems and an algorithmic pattern collection, providing a reference of over 100 common challenges implemented in Go. The library focuses on specific problem-solving strategies, including sliding windows, two pointers, and dynamic programming. It provides coded examples of standard sorting, searching, and graph traversal techniques to facilitate the study of algorithmic patterns. The repository covers a broad range of capabilities, including array a

    Returns the largest element in a stack in constant time using a secondary stack of maximums.

    Go
    在 GitHub 上查看↗3,678
  1. Home
  2. Scientific & Mathematical Computing
  3. Data Structure Implementations
  4. Stack Implementations

探索子标签

  • Maximum-Tracking StacksImplementations of stacks that provide constant-time access to the maximum element currently stored. **Distinct from Stack Implementations:** Distinct from general stack implementations by adding a secondary stack to track maximums for O(1) retrieval.