How this analysis was created: This summary and feature list are AI-generated from collected project material and can contain mistakes. Stars, license and language are imported from GitHub. Inclusion does not mean that we have tested or audited this project. Check the source documentation for any feature you depend on. Learn more on our About page.
Codeforces-go is a competitive programming algorithm library written in Go, providing a collection of reusable code templates for solving algorithmic problems. It covers core areas including data structures, graph algorithms, dynamic programming, and mathematical computation, with pre-built implementations for segment trees, Fenwick trees, shortest paths, minimum spanning trees, knapsack DP, interval DP, and number theory routines.
The main features of endlesscheng/codeforces-go are: Template Libraries, Data Structure Implementations, Competitive Programming Repositories, Competitive Programming Templates, Dynamic Programming Patterns, Graph Algorithm Routines, Mathematical Algorithms, Algorithmic Patterns.
Projects with overlapping indexed features include: omonimus1/competitive-programming — This repository serves as a comprehensive resource for competitive programming and technical interview preparation. It… mandliya/algorithms_and_data_structures — This project is a comprehensive collection of C++ libraries and toolkits providing reference implementations for data… cp-algorithms/cp-algorithms — This project is a comprehensive reference for algorithms and data structures used to solve complex computational… wisdompeak/leetcode — This project is a curated library of algorithm implementations and solved programming problems. It serves as a… chanda-abdul/several-coding-patterns-for-solving-data-structures-and-algorithms-problems-during-interviews — This repository is a curated guide and implementation library of coding patterns used to solve data structures and… oi-wiki/oi-wiki — This project is a comprehensive, community-maintained knowledge base and toolkit designed for competitive programming.…
This repository serves as a comprehensive resource for competitive programming and technical interview preparation. It provides a structured collection of source code implementations for fundamental data structures and classic algorithmic problems, designed to help developers master core computer science concepts and efficient coding strategies. Beyond standard problem-solving, the project distinguishes itself by integrating software design patterns into its algorithmic implementations. It demonstrates how to apply structural and behavioral patterns—such as decorators, observers, and singleto
This project is a comprehensive reference for algorithms and data structures used to solve complex computational problems in competitive programming. It serves as a technical resource for implementing advanced mathematical programming, computational geometry, and graph theory. The repository provides detailed implementation guides for diversifying algorithmic techniques, including top-down and bottom-up dynamic programming optimization, number theory, and linear algebra. It features specific guides for complex tasks such as constructing planar graphs, solving linear Diophantine equations, and
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
This project is a curated library of algorithm implementations and solved programming problems. It serves as a reference repository for competitive programming and data structure implementations, providing optimized solutions for a wide range of coding challenges. The collection organizes code examples by algorithmic technique, specifically focusing on the implementation of trees, graphs, and heaps to optimize time and space complexity. It provides language-specific solutions used for high-performance coding tasks. The repository covers a broad set of capabilities, including graph traversals