awesome-repositories.com
Blog
awesome-repositories.com

Entdecke die besten Open-Source-Repositories mit KI-gestützter Suche.

EntdeckenKuratierte SuchenOpen-Source-AlternativenSelf-hosted SoftwareBlogSitemap
ProjektÜber unsRanking-MethodikPresseMCP-Server
RechtlichesDatenschutzAGB
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·
cp-algorithms avatar

cp-algorithms/cp-algorithms

0
View on GitHub↗
10,805 Stars·2,075 Forks·C++·CC-BY-SA-4.0·9 Aufrufecp-algorithms.com↗

Cp Algorithms

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 managing string patterns with suffix automata.

The collection covers a broad surface of capabilities, including graph connectivity and spanning trees, spatial analysis and convex hulls, and combinatorial optimization. It also provides reference implementations for various data structures and techniques for range queries and tree decomposition.

Features

  • Algorithmic References - Serves as a comprehensive reference of classic problem-solving techniques and data structures for competitive programming.
  • Algorithm Implementations - Provides practical code implementations of algorithms and design patterns used to solve complex computational problems.
  • Algorithmic Reference Implementations - Serves as a comprehensive collection of algorithmic reference implementations for competitive programming.
  • Graph Theory - Implements core graph theory logic including connectivity, spanning trees, and strongly connected components.

KI-Suche

Entdecke weitere awesome Repositories

Beschreibe in einfachen Worten, was du brauchst — die KI bewertet tausende kuratierte Open-Source-Projekte nach Relevanz.

Start searching with AI
Graph Libraries - Offers detailed implementation guides for graph connectivity, spanning trees, and component analysis.
  • Competitive Programming Repositories - Provides a comprehensive repository of algorithms and data structures specifically for competitive programming.
  • Algorithm and Data Structure Guides - Offers educational guides on common implementations of algorithms and data structures for complex programming tasks.
  • Competitive Programming Training - Provides structured resources and implementations for training in competitive algorithmic programming.
  • Data Structures Reference - Offers a detailed reference and implementation guide for fundamental and advanced data structures.
  • Graph Algorithms - Implements graph theory logic to identify critical components such as bridges and articulation points.
  • Centroid Trees - Constructs hierarchical structures of centroids to facilitate fast queries on tree distances.
  • Bottom-Up Dynamic Programming - Provides detailed implementation guides for bottom-up dynamic programming to optimize memory and time complexity.
  • Computational Geometry Algorithms - Implements advanced geometric algorithms for handling coordinates, convex hulls, and spatial intersections.
  • Dynamic Programming Techniques - Provides detailed guides on top-down and bottom-up dynamic programming optimizations.
  • Geometric Algorithms - Provides a comprehensive reference for computational geometry techniques to handle polygons and spatial intersections.
  • Mathematical Algorithms - Provides programmatic solutions for mathematical problems using number theory, linear algebra, and combinatorics.
  • Mathematical Problem Solving Toolkits - Provides technical guides and solver implementations for number theory, linear algebra, and combinatorics.
  • Combinatorial Optimization Problems - Provides implementations for solving discrete optimization tasks including knapsack and subset sum problems.
  • Computational Geometry - Implements a wide range of computational geometry algorithms including half-plane intersections and planar graphs.
  • Mathematics - Provides a comprehensive resource for programmatically solving problems in number theory, combinatorics, and linear algebra.
  • Range Query Structures - Provides efficient range-based queries and updates using segment trees and sqrt decomposition.
  • Top-Down Dynamic Programming - Provides detailed implementations of top-down dynamic programming using recursive state caching.
  • Caching and Memoization - Implements state caching and memoization to eliminate redundant calculations in recursive algorithms.
  • String Processing Algorithms - Implements suffix automata for efficient string pattern matching and complex string analysis.
  • Centroid-Based Path Analysis - Implements centroid decomposition to process all paths in a tree with logarithmic depth.
  • Bottom Sheets - Implements iterative bottom-up dynamic programming for calculating results from base cases to target values.
  • Connectivity Analysis - Implements logic to calculate edge and vertex connectivity for undirected graphs.
  • Planar Face Identifiers - Traverses edges sorted by polar angle to isolate inner and outer regions of a planar embedding.
  • Sorted Indexing - Provides efficient methods for locating elements within sorted sequences using binary search.
  • Condensation Graphs - Provides a way to collapse strongly connected components of a directed graph into a condensation graph.
  • Tree Traversal & Querying - Implements lowest common ancestor and range minimum query logic for tree structures.
  • Binary Lifting Traversal - Provides implementations of binary lifting for efficient navigation through hierarchical tree structures.
  • Binary Search for Transition Points - Implements binary search techniques to efficiently locate transition points in monotonic functions.
  • Binary Search Techniques - Implements logic to determine where a monotonic boolean predicate changes state over a given range.
  • Diophantine Equation Solvers - Implements techniques to find integer solutions for linear Diophantine equations using continued fractions.
  • Half-Plane Intersections - Implements algorithms for computing half-plane intersections and nearest pair of points in Euclidean space.
  • Geometric Distance Optimizations - Calculates the maximum Manhattan distance between any two points in a set across multiple dimensions.
  • Jump Search Algorithms - Implements optimized traversal using decreasing powers of two to locate elements or ancestors.
  • Numerical Approximation Methods - Provides methods to approximate real values in continuous functions by narrowing search intervals.
  • Bit Manipulation Techniques - Provides a comprehensive set of techniques for manipulating data at the individual bit level.
  • Manhattan Minimum Spanning Trees - Constructs a minimum spanning tree for Manhattan distances by identifying nearest neighbors in eight octants.
  • Approximate Algorithms - Implements probabilistic algorithms like simulated annealing to find near-optimal solutions for complex functions.
  • Lattice Polygon Construction - Implements the construction of Klein polygons to find the convex hull of lattice points.
  • Range DP Optimizations - Implements optimization techniques to reduce the time complexity of range-based dynamic programming.
  • Planar Graph Constructors - Constructs a graph by treating all line segment intersection points as vertices.
  • Planar Graph Face Identification - Implements polar-angle-based edge sorting to identify faces within a planar graph embedding.
  • Knapsack Problem Solving - Provides algorithms for solving knapsack problems with various constraints and quantities.
  • Centroid Decomposition - Implements centroid-based tree decomposition to optimize path queries in large tree structures.
  • Strongly Connected Component Algorithms - Implements algorithms to identify strongly connected components in directed graphs.
  • Learning & Reference - Algorithm and data structure articles

    • Star-Verlauf

    Star-Verlauf für cp-algorithms/cp-algorithmsStar-Verlauf für cp-algorithms/cp-algorithms

    Open-Source-Alternativen zu Cp Algorithms

    Ähnliche Open-Source-Projekte, sortiert nach der Anzahl der gemeinsamen Funktionen mit Cp Algorithms.
    • azl397985856/leetcodeAvatar von azl397985856

      azl397985856/leetcode

      55,758Auf GitHub ansehen↗

      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

      JavaScriptalgoalgorithmalgorithms
      Auf GitHub ansehen↗55,758
    • greyireland/algorithm-patternAvatar von greyireland

      greyireland/algorithm-pattern

      15,465Auf GitHub ansehen↗

      This project is an algorithm template library and coding interview study guide providing reusable code patterns for common data structures and algorithms. It serves as a reference for optimized strategies and a structured learning path to build proficiency in algorithmic problem solving and competitive programming. The library focuses on standardized implementations of key algorithmic patterns, including sliding windows, backtracking, dynamic programming, and binary search. It provides specific templates for managing binary search trees, searching rotated sorted arrays, and executing divide-a

      Goalgoalgorithmleetcode
      Auf GitHub ansehen↗15,465
    • mission-peace/interviewAvatar von mission-peace

      mission-peace/interview

      11,306Auf GitHub ansehen↗

      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

      Java
      Auf GitHub ansehen↗11,306
    • wisdompeak/leetcodeAvatar von wisdompeak

      wisdompeak/LeetCode

      6,186Auf GitHub ansehen↗

      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

      C++
      Auf GitHub ansehen↗6,186
    Alle 30 Alternativen zu Cp Algorithms anzeigen→

    Häufig gestellte Fragen

    Was macht cp-algorithms/cp-algorithms?

    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.

    Was sind die Hauptfunktionen von cp-algorithms/cp-algorithms?

    Die Hauptfunktionen von cp-algorithms/cp-algorithms sind: Algorithmic References, Algorithm Implementations, Algorithmic Reference Implementations, Graph Theory, Graph Libraries, Competitive Programming Repositories, Algorithm and Data Structure Guides, Competitive Programming Training.

    Welche Open-Source-Alternativen gibt es zu cp-algorithms/cp-algorithms?

    Open-Source-Alternativen zu cp-algorithms/cp-algorithms sind unter anderem: azl397985856/leetcode — This project is a curated educational resource and solution repository for algorithmic challenges, specifically… greyireland/algorithm-pattern — This project is an algorithm template library and coding interview study guide providing reusable code patterns for… mission-peace/interview — This project is a comprehensive library of reference implementations for fundamental data structures and algorithms,… wisdompeak/leetcode — This project is a curated library of algorithm implementations and solved programming problems. It serves as a… oi-wiki/oi-wiki — This project is a comprehensive, community-maintained knowledge base and toolkit designed for competitive programming.… kodecocodes/swift-algorithm-club — This project is a comprehensive collection of common computer science algorithms and data structures implemented in…