1 dépôt
Awesome GitHub RepositoriesMaximum-Tracking Stacks
Implementations 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.
Explore 1 awesome GitHub repository matching scientific & mathematical computing · Maximum-Tracking Stacks. Refine with filters or upvote what's useful.
Awesome Maximum-Tracking Stacks 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.
- hoanhan101/algo
hoanhan101/algo
3,678Voir sur GitHubThis 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
