Open-source alternatives to Leetcode

This project is a LeetCode solution repository containing a collection of algorithmic and database problem solutions. It serves as an algorithm implementation guide and a competitive programming reference, providing optimized code to demonstrate data structure usage and efficient coding patterns. The repository includes solutions for complex computational challenges implemented in multiple programming languages and a collection of SQL queries for data retrieval and manipulation across various difficulty levels. These resources are designed for competitive programming study and technical inter

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

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

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 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

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

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

This project is a curated collection of solved algorithmic challenges and reference implementations. It serves as a study guide for software engineering, providing a library of data structure and algorithm problems used to analyze efficient problem-solving techniques. The repository functions as a solution reference for coding challenges across multiple programming languages. It includes source code examples and conceptual hints designed for technical interview preparation and the study of common coding patterns. The content is organized as a static source code repository with language-speci

LeetCode-Go is a competitive programming repository and Go algorithm library. It provides a collection of optimized solutions for LeetCode challenges, focusing on time and space complexity. The project serves as a reference for data structures and algorithms implemented in Go. It covers algorithm problem solving and performance optimization to meet strict memory and runtime constraints. The repository includes capabilities for technical interview preparation and the application of Go language idioms to complex computing problems. Each solution is paired with a test suite to verify correctnes

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 curated reference library of algorithmic patterns, data structure implementations, and system design notes. It serves as a Java algorithmic problem set and a competitive programming guide, providing a collection of solutions for coding challenges from platforms like LeetCode and LintCode. The library is distinguished by its comprehensive set of Java implementations for advanced data structures and algorithmic strategies. It includes detailed references for solving complex problems with accompanying time and space complexity analysis. The project covers a broad surface of co

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

This repository is a comprehensive resource for software engineering career development and technical interview preparation. It provides a structured collection of learning materials, algorithmic patterns, and system design guides designed to assist developers in mastering the core competencies required for professional engineering roles. The project distinguishes itself through a pattern-based content taxonomy that groups diverse technical challenges by underlying algorithmic strategies. This approach allows users to identify and apply reusable solutions during high-pressure assessments. It

30-seconds-of-code is a comprehensive knowledge base and programming snippet library designed to support software engineering education and professional development. It provides a curated collection of reusable code units and technical guides that help developers master core language mechanics, design patterns, and architectural philosophies. The project distinguishes itself by offering a wide-ranging library of algorithmic solutions and web development patterns that are organized into modular, independently testable units. It emphasizes functional programming paradigms and declarative logic,

This project is a comprehensive repository of verified computational implementations designed to serve as an educational resource for computer science and algorithmic problem solving. It provides a structured collection of code examples that cover fundamental data structures, mathematical operations, and core programming concepts, allowing users to study the logic and complexity behind various computational methods. The repository distinguishes itself through a modular, reference-based implementation pattern that organizes code into logical namespaces. This approach facilitates independent ex

CodingInterviewChinese2 is a collection of source code implementations for common algorithmic challenges and data structures designed for technical coding interviews. It serves as an algorithm interview solution set and a technical interview study guide, providing C++ programming examples that demonstrate the logic and efficiency required for software engineering roles. The repository functions as a competitive programming study guide and a data structures reference. It provides solved programming exercises and technical interview code samples to help users master the problem-solving patterns

This project is a JavaScript algorithm library and computer science reference. It provides a collection of standard computational logic patterns and data structure implementations, including linked lists, trees, and graphs, for both educational and practical use. The codebase serves as a technical interview study guide, offering a practical resource for practicing common coding challenges and data structure manipulations. It is designed for computer science education, allowing users to study how classic algorithms work by reviewing and running implementations of established logic patterns. T

This repository serves as a collection of common coding challenges and data structure implementations designed to assist software engineers in preparing for technical interviews. It functions as a study guide for mastering fundamental computer science concepts and standard algorithmic patterns using Python. The project organizes source files into a hierarchical directory structure, grouping problems by category or data structure type to facilitate navigation. By maintaining these implementations as raw script files, the repository allows users to execute code directly within their local Pytho

leetcode_101 is a curated library of algorithmic problem sets and a repository of solved LeetCode challenges. It serves as a technical interview guide by providing code implementations for common software engineering interview questions. The project supports a technical interview preparation workflow, focusing on LeetCode problem solving and the study of standardized code solutions for data structures and algorithms. It is designed to facilitate coding skill development and the study of technical interview problems. The repository utilizes markdown-based content authoring and a static-file d

This repository provides a collection of fundamental data structures implemented in Java, designed to serve as an educational resource for understanding core computer science concepts. It includes standard implementations of trees, graphs, queues, and heaps, intended to help developers study the internal mechanics and performance characteristics of these structures. The library emphasizes the use of generics to maintain type safety across different data types and utilizes interface-driven design to ensure consistent method signatures. By building these components from scratch, the project dem

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

LeetCode-Book is a curated study resource and markdown algorithm guide designed for technical interview preparation. It serves as a multi-language code library that provides solutions and explanations for coding challenges to help users study data structures and algorithmic principles. The project is delivered as a Docusaurus documentation website, which transforms a directory of version-controlled markdown files into a structured and searchable online technical resource. The repository covers an algorithm study workflow that includes tracking LeetCode problems and following curated study pl

CLRS is an algorithm implementation library and reference providing code solutions for the classic computer science problems and theoretical concepts found in Introduction to Algorithms. It serves as a computer science study guide and a set of textbook exercise solutions used for academic study and the verification of time and space complexity. The project is a multi-language algorithm library, implementing theoretical algorithms across several programming languages to demonstrate cross-language application and behavior. This approach allows for the study of different memory management and sy

This project is a programming education resource and a collection of vintage game ports. It provides a library of classic computer game implementations and algorithmic problems translated into modern memory-safe scripting languages for educational study and execution. The collection focuses on the implementation of game logic and the practice of fundamental computer science algorithms. It includes diverse examples of procedural content generation, such as random mazes and text-based art, alongside mathematical visualizations. The project covers a wide array of simulation categories, includin

This repository is a structured curriculum and collection of programming exercises designed to build proficiency in Python. It serves as an algorithmic problem-solving resource, offering a series of tasks that range from basic to intermediate levels to help developers master language syntax and logical thinking. The collection distinguishes itself through pattern-based solution decomposition, where complex challenges are broken down into multiple algorithmic approaches. This methodology allows learners to analyze different strategies for achieving code efficiency and understanding core progra

This project is a computer science educational resource and library providing implementations of data structures and algorithms in JavaScript. It serves as an algorithm implementation reference and a toolkit for building foundational data containers, including a collection of sorting algorithms and a guide for learning time and space complexity. The project differentiates itself by pairing class-based implementations with Big O analysis to illustrate asymptotic complexity. It includes a non-linear data structure toolkit featuring self-balancing trees, hash maps, and graphs, alongside comparis

This project is a structured study guide and repository designed to assist with technical interview preparation. It organizes coding problems into a taxonomy based on shared algorithmic strategies, allowing users to master fundamental computer science concepts through a curated learning path. The resource emphasizes pattern recognition by mapping specific problem constraints to optimal data structures and computational approaches. By categorizing challenges according to their underlying logic, it enables a systematic approach to developing problem-solving skills for technical assessments. Th