Awesome GitHub RepositoriesRandomization Algorithms

This project is a comprehensive, community-maintained knowledge base and toolkit designed for competitive programming. It serves as a centralized repository for algorithmic theory, data structures, and mathematical techniques, providing a structured reference for informatics and collegiate programming competitions. The project distinguishes itself by integrating educational content with a robust suite of automation utilities. It provides a complete workflow for competitive programming, including tools for automated test case generation, solution verification, and direct interaction with onlin

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

algs4 is a Java data structures library and algorithm reference collection designed as the source code for a standard computer science textbook curriculum. It provides a comprehensive suite of fundamental implementations for sorting, searching, and core data organization. The project serves as a graph theory framework, offering tools for representing directed and undirected graphs and performing complex traversals and pathfinding. It also includes a broad sorting algorithm suite and a specialized library of Java data structures, including stacks, queues, priority queues, and symbol tables. I

LogicStack-LeetCode is a curated repository of solved algorithm problems and data structure implementations, primarily drawn from the LeetCode platform. Its core identity is a structured collection of solutions designed to support technical interview preparation and competitive programming practice, with each solution accompanied by complexity analyses to help engineers understand performance trade-offs. The repository distinguishes itself through its breadth of coverage across fundamental algorithmic patterns and data structures. It includes implementations for array manipulation, string pro

This is a collection of classical algorithms and data structures implemented as a header-only C++ library. It provides a suite of tools for general algorithm implementation, including data structure management, graph theory analysis, and string processing. The library is distinguished by its specialized toolkits for cryptographic hashing and encoding, featuring implementations of MD5, SHA-1, and Base64. It also includes advanced capabilities for high-performance string processing via suffix trees and arrays, as well as computational number theory for primality testing and arbitrary-precision

Radash este o bibliotecă de utilitare funcționale TypeScript concepută pentru transformarea datelor, validare și gestionarea fluxurilor de lucru. Oferă o colecție de funcții helper tipizate pentru a manipula array-uri, obiecte și șiruri de caractere. Proiectul dispune de un toolkit de flux de lucru asincron pentru gestionarea promisiunilor, reîncercărilor și limitelor de concurență, alături de o suită de validatoare booleene pentru verificarea tipurilor primitive, obiectelor și promisiunilor. De asemenea, implementează modele de programare funcțională, cum ar fi compunerea funcțiilor, aplicarea parțială și modele de răspuns de tip error-first. Biblioteca acoperă o arie largă de capabilități, inclusiv gestionarea stării obiectelor cu deep cloning și merging, manipulări complexe de array-uri și formatarea șirurilor. În plus, oferă instrumente pentru optimizarea execuției, cum ar fi limitarea ratei (rate limiting) și caching-ul rezultatelor.