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.
data-structures-questions is a collection of fundamental computer science data structures and sorting algorithms written from scratch in Go for technical interview preparation. The repository functions as a curated collection of programming problems and reference solutions designed to help software engineers prepare for technical coding interviews, as well as a library of custom data structures showcasing memory layout and algorithmic efficiency.
The main features of keke-li/data-structures-questions are: Data Structure Implementations, Coding Interview Preparation, Go Data Structure Implementations, Sorting Algorithms, Low-Level Primitive Nodes, Pointer Memory Management, Language Runtime Type Inspection, Complexity Analysis.
Projects with overlapping indexed features include: ua-nick/data-structures-and-algorithms — This repository is a collection of fundamental data structures and classic algorithms implemented in Go, designed for… kevin-wayne/algs4 — algs4 is a Java data structures library and algorithm reference collection designed as the source code for a standard… mission-peace/interview — This project is a comprehensive library of reference implementations for fundamental data structures and algorithms,… humanwhocodes/computer-science-in-javascript — This is a collection of classic computer science algorithms and data structures implemented from scratch in… jack-lee-hiter/algorithmsbypython — AlgorithmsByPython is a reference library and educational repository providing runnable Python implementations of… hit-alibaba/interview — This project is a comprehensive technical interview preparation guide and computer science knowledge base. It serves…
This repository is a collection of fundamental data structures and classic algorithms implemented in Go, designed for educational study and technical skill development. It provides a comprehensive library of standard storage primitives and computational procedures intended to demonstrate efficient data organization and logic. The project distinguishes itself through a focus on core design principles, utilizing language-level type parameters and interface-based polymorphism to maintain type safety and modularity. Implementations rely on iterative logic and direct memory management via pointers
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
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
AlgorithmsByPython is a reference library and educational repository providing runnable Python implementations of computer science fundamentals. It serves as a comprehensive guide for algorithmic patterns, core data structures, and solutions for competitive programming and technical interview challenges. The project distinguishes itself by offering a wide array of reference implementations, including a dedicated set of solutions for common LeetCode problems. It focuses on translating theoretical computational logic into practical Python code for educational and practical use. The repository