20 مستودعات
Educational resources for learning algorithms and data structures.
Distinguishing note: Focuses on learning materials.
Explore 20 awesome GitHub repositories matching education & learning resources · Algorithm and Data Structure Guides. Refine with filters or upvote what's useful.
This project is a curated knowledge repository designed to support the professional development of software engineers. It functions as a comprehensive index of industry best practices, methodologies, and design principles, providing a structured roadmap for those seeking to improve their technical skills, architectural decision-making, and career trajectory. The repository distinguishes itself through a community-driven approach, relying on peer-reviewed contributions to maintain an up-to-date collection of resources. It organizes vast amounts of technical information into a hierarchical taxo
Provides educational resources for mastering algorithms and data structures.
This project is a comprehensive technical knowledge base and study guide focused on data structures, algorithms, and computer science fundamentals. It provides a curated collection of tutorials and educational resources designed to support technical growth and academic learning. The repository distinguishes itself through a heavy emphasis on visual learning, utilizing mind maps, diagrams, and illustrated breakdowns to explain complex algorithmic logic. It further supports career readiness by providing a repository of company-specific interview questions and real-world candidate experiences.
Provides a structured learning path to master data structures and algorithms through visual guides and solved challenges.
This project is a comprehensive JavaScript programming tutorial and language reference. It serves as a web development education resource providing instruction on modern language fundamentals, object-oriented design, and advanced asynchronous programming patterns. The resource functions as both a frontend development guide and a technical reference. It covers core language features such as closures, prototypes, promises, and typed arrays, while providing practical lessons on managing browser data and handling network requests. The content spans several key capability areas, including browser
Teaches how to process and transform common data structures like arrays and strings using native JavaScript logic.
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
Provides curated guides and practical code examples for mastering fundamental algorithms and data structures.
Fx is a command-line processing suite designed for the transformation, conversion, exploration, and visualization of structured data. It functions as a terminal-based utility that handles both automated shell pipelines and interactive navigation of complex, nested data hierarchies. The tool distinguishes itself by integrating a JavaScript-based engine that executes user-provided logic to filter, map, or modify data fields within a sandboxed runtime. It maintains a responsive interface by decoupling data processing from the display loop, allowing users to explore large datasets through an inte
Applies custom logic to filter, map, or modify information fields using concise expressions.
This project is a vanilla JavaScript reference guide and implementation collection designed to replace legacy libraries with native browser patterns. It provides a set of native JavaScript patterns for selecting, modifying, and navigating HTML elements, alongside a web API implementation guide for handling events and styles. The project serves as a reference for implementing asynchronous JavaScript patterns using native promises and fetch for remote data and background tasks. It also includes a client-side utility collection for performing data transformations, type validation, and element me
Provides techniques for manipulating and transforming arrays and strings using built-in JavaScript methods.
This project is a comprehensive technical interview preparation resource and computer science interview guide. It serves as an educational reference for developers to study core software engineering fundamentals and common coding patterns required for employment screenings. The repository provides detailed guides and references covering data structures and algorithms, networking and security, operating systems, and web development. It specifically focuses on the implementation and complexity analysis of sorting, searching, and graph algorithms. The material encompasses a wide breadth of comp
A guide to implementing and analyzing common sorting, searching, and graph algorithms with a focus on time and space complexity.
This tool is a command-line processor designed for querying, updating, and transforming structured data files. It functions as a versatile engine for manipulating YAML, JSON, TOML, and XML documents, allowing users to perform complex operations directly from the terminal. By utilizing a path-based expression language, it enables precise navigation and modification of data structures within configuration files and infrastructure-as-code workflows. What distinguishes this tool is its ability to perform in-place document mutations while preserving original formatting, comments, and metadata. It
Provides a command-line interface for querying, updating, and converting structured data files.
LearningNotes هي قاعدة معرفية تقنية ودليل دراسي هندسي يركز على داخليات إطار عمل Android، وبنية النظام، وتحسين أداء الهاتف المحمول. تعمل كمرجع لتحليل تسلسل تمهيد Android، وتمهيد العملية، وتهيئة خدمة النظام. يوفر المشروع أدلة مفصلة حول أداء الهاتف المحمول، بما في ذلك استراتيجيات تقليل آثار الذاكرة، وتحديد تسريبات الذاكرة، وتحسين فك تشفير الصور. كما يغطي التواصل بين العمليات في Android باستخدام AIDL ومحرك نواة Binder، بالإضافة إلى أدلة هندسة البرمجيات لفصل منطق الأعمال عن واجهات المستخدم من خلال أنماط مثل MVVM و MVP. بعيداً عن تطوير الهاتف المحمول، يتضمن المستودع قاعدة معرفية لعلوم الحاسوب للتحضير للمقابلات التقنية، تغطي هياكل البيانات، والخوارزميات، ومفاهيم نظام التشغيل. كما يتميز بمرجع عملي للتحكم في الإصدار Git، يوضح بالتفصيل إدارة المستودع، والمزامنة، وسير عمل التفرع.
Provides educational resources and practice for solving classic coding challenges via core data structures and algorithms.
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
Offers educational guides on common implementations of algorithms and data structures for complex programming tasks.
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
Contrasts the time and space complexity of linked lists versus arrays for insertion and deletion operations.
AlgoNote is an algorithm and data structure tutorial and computer science study manual. It serves as a technical library of algorithm implementations and data structure patterns, providing a comprehensive learning guide focused on technical interview preparation. The project functions as a LeetCode solution guide, containing analyzed and implemented solutions for over one thousand coding challenges. All implementations are written in Python to provide a consistent coding reference. The resource covers the study of algorithm fundamentals, the resolution of diverse coding challenges, and prepa
Serves as a comprehensive learning guide for mastering core algorithms and data structures.
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
Provides a structured course with practical examples and LeetCode practice for mastering data structures and algorithms.
Carp is a statically typed Lisp compiler that compiles Lisp-like syntax directly to C source code, enabling seamless integration with existing C libraries and low-level system programming. It manages memory deterministically at compile time using ownership tracking and linear types, eliminating garbage collection pauses and runtime overhead while ensuring type safety through an inferred static type system. The language distinguishes itself through compile-time macro expansion and metaprogramming capabilities, allowing code generation and transformation before final binary output. It enforces
Converts one dynamic data literal into another while preserving element order.
This repository is a comprehensive collection of fully worked solutions to exercises and problems from the standard algorithms textbook by Cormen, Leiserson, Rivest, and Stein (CLRS). It serves as an educational reference for algorithm design and analysis, providing step-by-step reasoning, pseudocode, and mathematical proofs for a wide range of topics. The content spans core computer science areas: algorithm analysis with asymptotic notation, recurrence solving, and amortized cost analysis; data structure implementation and operations for binary search trees, red-black trees, B-trees, Fibonac
A reference that provides detailed answers and derivations for topics like sorting, graph algorithms, dynamic programming, and advanced data structures.
هذا المشروع عبارة عن مجموعة مرجعية لأساسيات علوم الكمبيوتر، توفر دليل دراسة وأوراق غش للخوارزميات وهياكل البيانات. يعمل كمورد للتحضير للمقابلات التقنية، حيث يجمع بين المعرفة النظرية وأنماط التنفيذ العملية لتحديات البرمجة. يتضمن المحتوى دليلاً مقارنًا لتحليل كفاءة وخصائص المصفوفات، والقوائم المرتبطة، وجداول التجزئة، وأشجار البحث الثنائية. يوفر ملخصات للمفاهيم الأكاديمية بما في ذلك تعقيد الوقت والمساحة، وطرق الفرز، واستراتيجيات البحث. تغطي المواد أنماط الخوارزميات، وتنفيذات البحث والفرز، والترميز المقارب. يتم تنظيم المعلومات عبر قاعدة معرفية قائمة على markdown مع خرائط مواضيع هرمية.
Ships a comparative guide for analyzing the efficiency and characteristics of fundamental data structures.
هذا المشروع هو دليل تحضير لمقابلات الخوارزميات ومكتبة مرجعية. يوفر مجموعة منسقة من المشكلات البرمجية المحلولة وتنفيذ هياكل البيانات المصممة لممارسة المقابلات التقنية ودراسة البرمجة التنافسية. يتميز المستودع بتنظيم تحديات البرمجة من خلال نظام من الأنماط، ومستويات الصعوبة، والتصفية القائمة على الشركات. يتضمن موارد تعليمية مثل ملاحظات المفاهيم الخوارزمية وشروحات الفيديو لتكملة مجموعات الحلول. تغطي المكتبة مجموعة واسعة من المجالات الحسابية، بما في ذلك هياكل البيانات المتقدمة لاستعلامات النطاق والبادئة، وخوارزميات اجتياز الرسم البياني وأقصر مسار، ومجموعات مشكلات متنوعة تركز على البرمجة الديناميكية، والتراجع، والاستراتيجيات الجشعة. كما يوفر تطبيقات للهياكل الأساسية مثل الأكوام، وخرائط التجزئة، والقوائم المرتبطة، والمكدسات، والطوابير.
Provides detailed instructional materials and review notes for learning algorithms and data structures.
This repository is a collection of JavaScript coding challenges and a comprehensive interview guide. It provides reference implementations and educational examples designed to help developers master language fundamentals and prepare for technical interviews. The project covers a wide array of specialized implementations, including functional programming patterns like currying and partial application, as well as asynchronous patterns for concurrency control. It also includes practical examples of Document Object Model manipulation and the implementation of common data structures such as stacks
Demonstrates techniques for extracting and modifying collection elements using mapping and chaining methods.
This project is an algorithm learning platform and computer science educational resource. It serves as a technical interview study guide, providing structured lessons on data structures and sorting methods. The site is a markdown-based static site that converts technical documentation and algorithmic explanations into static HTML pages. It functions as a system for markdown content publishing to deliver educational material. The platform covers algorithm complexity analysis, problem solving workflows, and general computer science education. It utilizes a component-based UI structure with fil
Serves as a structured educational platform for studying computer science data structures and sorting methods.
هذا المستودع عبارة عن مجموعة من هياكل البيانات الأساسية والخوارزميات الكلاسيكية المنفذة بلغة Go، والمصممة للدراسة التعليمية وتطوير المهارات التقنية. يوفر مكتبة شاملة من بدائيات التخزين القياسية والإجراءات الحسابية التي تهدف إلى إظهار التنظيم الفعال للبيانات والمنطق. يتميز المشروع بالتركيز على مبادئ التصميم الأساسية، باستخدام معلمات النوع على مستوى اللغة وتعدد الأشكال القائم على الواجهة للحفاظ على سلامة النوع والمعيارية. تعتمد التنفيذات على المنطق التكراري وإدارة الذاكرة المباشرة عبر المؤشرات، مع إعطاء الأولوية للكفاءة الهيكلية وتنظيم الكود الواضح والقابل للصيانة. تغطي المكتبة نطاقاً واسعاً من موضوعات علوم الحاسوب الأساسية، بما في ذلك تقنيات البحث والفرز ومطابقة أنماط السلاسل المختلفة. تعمل هذه التنفيذات كمورد لتحليل الأداء، وممارسة الأنماط الخوارزمية، والتحضير للتقييمات التقنية.
Acts as a comprehensive library of fundamental data structures and classic algorithms for study.