Open-source alternatives to Hello Algorithm

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

InterviewGuide is a comprehensive technical interview preparation platform that covers the full spectrum of software engineering recruitment, from foundational computer science concepts through to offer negotiation. It provides structured learning paths across algorithms, operating systems, databases, networking, and programming languages, with a particular emphasis on C++ and Go. The platform aggregates real interview experiences and company-specific questions from major tech employers, offering candidates a searchable database of past written exam problems and detailed accounts of actual int

This project is a collection of reference materials and educational guides providing theoretical foundations and practical patterns for algorithms, artificial intelligence, and professional technical interviews. It serves as a computer science study guide and a practical reference for solving computational problems through curated notes. The resources provide a learning path for machine learning, covering the mathematical foundations and architectures used to build large language models. It also functions as a technical interview preparation resource, containing common software engineering an

algorithm-base is an educational library and study guide designed for simulating algorithms and studying data structures. It functions as an execution visualizer that renders step-by-step state changes and pointer updates through animated simulations to illustrate how data movement works. The project distinguishes itself by mapping conceptual logic directly to multi-language source code implementations. It utilizes a comparative analysis framework to evaluate different algorithmic strategies based on stability, time complexity, and space complexity, while organizing problems by underlying mec

This project is a comprehensive reference guide for computer science fundamentals, providing structured summaries of essential data structures and algorithmic principles. It serves as a technical resource for developers to review core programming concepts, memory layouts, and operational characteristics required for software development and technical assessments. The collection distinguishes itself by offering concise, implementation-focused documentation for a wide range of standard techniques. It covers the mechanics of various sorting and searching algorithms, graph and tree traversal stra

CS-Base is a comprehensive educational platform and technical repository designed to support software engineers in mastering backend architecture, artificial intelligence engineering, and career development. It functions as a centralized knowledge hub that combines illustrated theoretical tutorials with practical, project-based learning to bridge the gap between foundational computer science concepts and professional industry requirements. The project distinguishes itself by integrating a robust career mentorship framework with advanced AI engineering resources. It provides users with tools f

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 comprehensive collection of common computer science algorithms and data structures implemented in Swift. It serves as an educational reference and library for studying computational complexity, algorithmic logic, and data structure engineering through practical code examples. The repository provides a wide suite of data structure implementations, including various types of linked lists, heaps, hash tables, and an extensive range of hierarchical trees such as Red-Black, B-Tree, and Splay trees. It also covers diverse sorting and searching techniques, from basic bubble sort to

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

This project is an algorithm interview preparation guide and reference library. It provides a curated collection of solved programming problems and data structure implementations designed for technical interview practice and competitive programming study. The repository distinguishes itself by organizing coding challenges through a system of patterns, difficulty levels, and company-based filtering. It includes instructional resources such as algorithmic concept notes and video explanations to supplement the solution sets. The library covers a wide range of computational areas, including adva

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

CS-Xmind-Note is a collection of structured mind maps and conceptual diagrams serving as a comprehensive knowledge base for computer science fundamentals. It functions as an academic reference and study guide, organizing core subjects into a visual mapping of interdependent technical concepts. The project utilizes an XMind-compatible schema to model complex domains through hierarchical nodes and relational concept mapping. This approach allows for the visual representation of technical layers, linking hardware specifications to software abstractions. The knowledge base covers several primary

This project is a backend engineering interview guide and computer science study resource. It provides a curated collection of technical questions and answers focused on server-side architecture, database optimization, and networking fundamentals to prepare for professional software engineering evaluations. The resource functions as a technical reference for studying ACID properties, transaction isolation, and the optimization of relational and non-relational systems. It includes a software architecture reference for analyzing design patterns, dependency injection, and the structural tradeoff

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 a frontend interview question bank and a comprehensive web development curriculum. It serves as a technical reference and study guide for software engineering candidates, combining a curated collection of interview questions and answers with a broad computer science fundamentals reference. The knowledge base is structured as a markdown-based system, using a folder-based taxonomy and directory hierarchy to organize technical topics. It employs a git-driven workflow to manage contributions and updates to the content, which is delivered as static documentation. The curriculum co

This project is a structured repository of technical interview questions and professional development resources designed for software engineering career advancement. It serves as a comprehensive database of high-frequency assessment materials sourced from real-world candidate experiences at major global technology companies. The collection is organized into a hierarchical directory structure categorized by company names and technical domains to facilitate navigation. By utilizing plain text serialization and static markdown content, the project ensures that all interview data remains human-re

This project is a Go algorithm implementation library designed for technical interview preparation. It provides a collection of common data structures and algorithmic solutions to help practice for software engineering coding assessments. The library includes a custom data structure collection featuring linked lists, stacks, queues, trees, and hash maps. It also implements specific algorithmic solutions, such as A* pathfinding for calculating the shortest path between nodes and a real-time stream processor for computing moving averages and running medians from continuous data inputs.

This project is a collection of condensed technical references and study guides for the C++ language. It serves as a language cheat sheet and programming reference covering core syntax, standards, and data organization patterns. The resource provides specialized guides for algorithm study, data structure reference, and technical interview preparation. It includes materials for reviewing computational complexity and efficient data structure usage for competitive programming. The content covers broad capability areas including object-oriented programming, memory management, and generic program

Daily-Question is a frontend interview preparation platform and technical knowledge base. It provides a structured engineering curriculum consisting of high-frequency interview questions and core technical topics organized by increasing difficulty. The platform includes an interview experience archive that collects real-world reports from technology companies to help users analyze hiring patterns and salary benchmarks. It also serves as a library for web engineering concepts and network protocols, utilizing interactive code examples and diagrams. The project covers broad capability areas inc

Algodeck is an open-source collection of flash cards designed for reviewing algorithms, data structures, and system design concepts, specifically curated for technical interview preparation. The project organizes knowledge into atomic question-and-answer pairs and incorporates spaced repetition scheduling to optimize long-term memory retention. The flash card catalog covers a broad range of computer science topics, including classic sorting algorithms like quicksort and mergesort, data structure operations for arrays, trees, heaps, tries, and graphs, as well as bit manipulation techniques for

This repository is a collection of fundamental computer science concepts and algorithmic implementations designed to serve as an educational resource. It provides a structured library of code that demonstrates universal computational patterns and data structure behaviors across multiple programming languages. The project is organized to facilitate learning through clear, readable reference implementations that prioritize pedagogical clarity over performance optimization. By grouping coding challenges according to underlying algorithmic techniques, the repository helps users identify recurring

This repository is a comprehensive collection of data structures and algorithms implemented in JavaScript, designed primarily as an educational resource for computer science study and technical interview preparation. It provides modular implementations of fundamental programming concepts, allowing developers to explore algorithmic logic and data organization through self-contained, verifiable code examples. The library distinguishes itself by pairing every implementation with formal Big O notation, providing predictable insights into time and space scaling requirements. Each algorithm is stru

This project is a technical interview study guide and computer science knowledge base. It provides a curated collection of technical interview questions and expert explanations focused on preparing for assessments at global IT companies. The repository serves as a coding interview roadmap for mastering algorithmic challenges and complexity analysis, alongside a software architecture reference for design principles and system design strategies. It also includes a web security curriculum covering authentication methods, cryptographic concepts, and common vulnerabilities. Content covers compute

This project is a curated collection of technical reference materials and study guides designed for machine learning interview preparation. It provides comprehensive resources for candidates pursuing engineering roles, focusing on deep learning, production infrastructure, and large-scale system design. The repository distinguishes itself through an architecture that combines theoretical research with industrial case studies. It utilizes a pattern-based approach to system design, breaking down complex deployments—such as recommendation engines, search ranking, and ad click prediction—into reus

This repository is a structured educational archive of classic computer science algorithms and data structures implemented in Python. It serves as a reference library designed for study and technical skill development, providing clean, readable examples of fundamental computational techniques rather than production-ready software components. The project distinguishes itself through its idiomatic approach, utilizing native language features and standard library conventions to demonstrate algorithmic logic clearly. Each implementation is organized into a hierarchical directory structure that mi

This project is an algorithm study resource, a centralized LeetCode solution repository, and a technical interview study guide. It provides Chinese translations of textbooks and guides on data structures and algorithms for academic study and professional preparation. The project distinguishes itself by delivering multi-language solution repositories and translated academic materials through a static site generation model. This architecture enables compile-time content translation and offline-first delivery of educational assets as static files. The repository covers a wide range of algorithm