37 रिपॉजिटरी
Reference collections of common data structures and their algorithmic implementations.
Distinguishing note: Focuses on the educational implementation of data structures rather than database management systems.
Explore 37 awesome GitHub repositories matching data & databases · Data Structure Implementations. Refine with filters or upvote what's useful.
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
Provides modular implementations of fundamental data structures like linked lists, trees, and heaps.
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
Implements priority queues using heap structures for efficient retrieval of minimum or maximum elements.
This project is a comprehensive algorithmic learning repository and competitive programming archive designed to support technical interview preparation and software engineering skill development. It provides a structured collection of verified solutions and implementation patterns, enabling developers to master fundamental computer science concepts through systematic practice and study. The repository distinguishes itself through a solution-centric structure that organizes source code by problem category, algorithm type, and data structure. By mapping specific coding challenges to recurring a
Provides a categorized reference of common data structures and their implementation patterns.
Antigravity-Manager is an artificial intelligence model orchestration platform that functions as a unified gateway for interacting with multiple external service providers. It standardizes heterogeneous vendor data structures into a consistent internal schema, allowing third-party tools to interface with various models through a single, normalized API. The system distinguishes itself through automated infrastructure management, including the lifecycle tracking of service accounts and the secure rotation of authentication credentials. By acting as a middleware layer, it intercepts traffic to p
Routes tasks to optimal backend services based on real-time performance metrics and priority logic.
OpenZeppelin Contracts is a library of modular, secure, and reusable smart contract components designed for the development of decentralized applications. It provides a foundational framework for building standard-compliant contracts, offering battle-tested implementations for token standards, access control, and common utility patterns. The project distinguishes itself through its comprehensive support for complex architectural patterns, including proxy-based upgradeability, role-based access control, and account abstraction. It enables developers to implement modular logic injection via hoo
Implements optimized data structures to handle collections more efficiently than native arrays or mappings.
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
Data Structures maintain ordered pairs of values to efficiently manage state in graph traversal algorithms like Dijkstra.
This project is a comprehensive library of fundamental computer science algorithms and data structures implemented in C. It provides a collection of modular, portable code blocks designed for educational purposes and integration into production software, focusing on procedural execution and direct hardware interaction. The library distinguishes itself through a focus on low-level systems programming, offering memory-efficient implementations of stacks, queues, linked lists, and trees. It includes specialized suites for cryptographic data protection, audio signal processing, and network commun
Provides memory-efficient implementations of fundamental data structures like linked lists, stacks, queues, and trees.
This project serves as a comprehensive, community-driven directory for the .NET ecosystem. It functions as a curated index of high-quality libraries, frameworks, and tools designed to assist developers in identifying recommended solutions for a wide range of project requirements and software engineering tasks. The repository distinguishes itself by providing a categorized catalogue that simplifies the discovery of resources across the entire .NET development lifecycle. By maintaining a standardized collection of community-contributed utilities, it helps developers navigate the ecosystem to fi
Provides collections of common data structures and algorithmic implementations for reference.
This repository provides a collection of verified implementations for fundamental data structures and computational algorithms. It serves as both a practical toolkit for integrating standard procedures into software applications and a reference for understanding core computer science concepts. The library covers a wide range of operations, including sorting, searching, graph traversal, and geometric analysis. Each implementation is designed to be modular and reusable, utilizing generic type parametrization to decouple logic from specific data types while maintaining type safety. The project
Provides verified implementations of fundamental data structures for efficient data organization.
This repository serves as a comprehensive collection of standard computer science algorithms and data structures implemented in the Go programming language. It functions as an educational resource for developers to study idiomatic code examples and master fundamental computational logic through practical, hands-on implementation. The project provides a reference for building and utilizing essential storage containers, such as linked lists, heaps, and hash maps, to organize information efficiently. It also includes a suite of proven mathematical algorithms for performing complex numerical calc
Focuses on the practical implementation of fundamental storage containers to organize information efficiently.
This project is a comprehensive container framework for Go that provides a suite of fundamental data structures and algorithms. It offers a standardized set of tools for managing, sorting, and traversing complex data collections, enabling developers to implement efficient storage and retrieval logic within their applications. The library distinguishes itself through an interface-driven design that allows for interchangeable use of different storage implementations. It supports custom ordering and sorting behavior through external comparison functions, which decouple the data structures from s
Implements a comprehensive suite of fundamental data structures including lists, stacks, queues, trees, and hash maps.
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
Offers a comprehensive library of fundamental data structures including trees, graphs, and linked lists with clear, reference-grade implementations.
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
Provides a reference collection of common data structures like trees, graphs, and linked lists with their complexity analysis.
This is a collection of classic computer science algorithms and data structures implemented from scratch in JavaScript. The project provides reference implementations of fundamental concepts including sorting algorithms, binary search, linked lists, and binary search trees, all built as standalone pure functions with no external dependencies. The implementations cover a range of data structures, including singly-linked, doubly-linked, and circular linked lists with full traversal and mutation operations, as well as binary search trees supporting insertion, deletion, and search. Sorting algori
Implements foundational data structures like linked lists and binary search trees from scratch.
Codeforces-go is a competitive programming algorithm library written in Go, providing a collection of reusable code templates for solving algorithmic problems. It covers core areas including data structures, graph algorithms, dynamic programming, and mathematical computation, with pre-built implementations for segment trees, Fenwick trees, shortest paths, minimum spanning trees, knapsack DP, interval DP, and number theory routines. The library organizes its templates by algorithmic pattern, grouping them into categories such as DP, graph, and math to match common contest question structures.
Provides pre-built implementations of segment trees, Fenwick trees, and union-find for algorithmic problem-solving.
go-datastructures is a collection of thread-safe and lock-free data structures designed for high-performance concurrent applications in Go. It provides a modular library of specialized algorithmic toolsets, including a lock-free collection library and an immutable data structure library. The project distinguishes itself through a suite of persistent AVL trees and hash array mapped tries that use branch-copying to preserve previous versions. It also implements non-blocking hash maps, queues, and tries that enable linearizable snapshots and concurrent updates without the use of mutual exclusion
Provides priority queues with floating-point keys and efficient decrease-key operations for graph algorithms.
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
Implements a comprehensive set of classic data structures including linked lists, trees, and graphs in JavaScript.
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
Implements a comprehensive collection of data structures as JavaScript classes for educational reference.
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
Provides a comprehensive reference collection of fundamental data structure implementations including stacks, queues, and graphs.
यह प्रोजेक्ट एल्गोरिदम इम्प्लीमेंटेशन और हल की गई प्रोग्रामिंग समस्याओं की एक क्यूरेटेड लाइब्रेरी है। यह कॉम्पिटिटिव प्रोग्रामिंग और डेटा स्ट्रक्चर इम्प्लीमेंटेशन के लिए एक संदर्भ रिपॉजिटरी के रूप में कार्य करता है, जो कोडिंग चुनौतियों की एक विस्तृत श्रृंखला के लिए ऑप्टिमाइज़्ड समाधान प्रदान करता है। यह संग्रह कोड उदाहरणों को एल्गोरिदम तकनीक के आधार पर व्यवस्थित करता है, विशेष रूप से समय और स्थान जटिलता को ऑप्टिमाइज़ करने के लिए ट्री, ग्राफ़ और हीप्स के इम्प्लीमेंटेशन पर ध्यान केंद्रित करता है। यह उच्च-प्रदर्शन कोडिंग कार्यों के लिए भाषा-विशिष्ट समाधान प्रदान करता है। रिपॉजिटरी ग्राफ़ ट्रैवर्सल, डायनामिक प्रोग्रामिंग, स्ट्रिंग पैटर्न प्रोसेसिंग और बाइनरी सर्च ऑपरेशंस सहित क्षमताओं के एक विस्तृत सेट को कवर करती है। इसमें रेंज डेटा क्वेरींग, बिट मैनिपुलेशन और कैश व ऑटो-कंप्लीट इंजन जैसे कस्टम डेटा स्ट्रक्चर के डिज़ाइन के लिए इम्प्लीमेंटेशन भी शामिल हैं। अतिरिक्त कवरेज में गणितीय गणना और प्रतियोगिता प्रदर्शन की ट्रैकिंग शामिल है।
Provides a reference library of tree, graph, and heap implementations optimized for time and space complexity.