2 个仓库
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.
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.
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.