63 रिपॉजिटरी
Resources and methodologies for mastering data structures and algorithms to improve coding efficiency and interview performance.
Distinguishing note: Focuses on the practice and mastery of algorithmic patterns rather than general software architecture.
Explore 63 awesome GitHub repositories matching software engineering & architecture · Algorithmic Problem Solving. Refine with filters or upvote what's useful.
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,
Provides a comprehensive library of standardized algorithmic implementations and data structures for efficient problem solving.
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 depth-first search to identify and count connected components within 2D grids.
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.
Offers solved algorithmic problems with visual explanations to help users master coding efficiency and interview performance.
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
Provides optimized implementations of algorithmic problems to meet strict competitive programming constraints.
This project is an interactive learning platform designed to help users build proficiency in Python through a structured sequence of programming challenges. It functions as an online coding exercise environment where learners can practice syntax, data structures, and algorithmic logic directly within a web browser. The platform distinguishes itself by utilizing a WebAssembly-based runtime that executes Python code locally in the client. This approach provides an immediate feedback loop for script evaluation and logic testing without requiring the installation of local software or the configur
Offers a structured resource for mastering data structures and procedural logic through programming challenges.
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
Provides an algorithmic solution to the classic egg drop problem to determine the minimum number of attempts.
This project is an automated code assessment tool and educational platform designed for frontend interview preparation. It provides a curated collection of technical challenges that allow developers to practice JavaScript mechanics, algorithmic problem solving, and core software engineering concepts. The platform utilizes a component-driven interface to organize and present educational content, which is managed through markdown-based modeling. It distinguishes itself by integrating automated evaluation systems that analyze user-submitted logic through abstract syntax tree analysis and sandbox
Offers resources and methodologies for mastering data structures and algorithms to improve coding efficiency.
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
Provides a comprehensive guide to mastering algorithmic patterns, graph modeling, and problem-solving techniques for competitive programming.
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
Acts as a toolkit of optimized routines for sorting, searching, and graph traversal.
This project is a library of source code implementations designed to solve algorithmic challenges and mathematical problems. It serves as a collection of solved LeetCode problems, providing a reference for data structure usage and efficient logic. The repository is a polyglot code collection, implementing the same algorithmic logic across various programming environments, including general-purpose languages, SQL for database queries, and Bash for shell scripting. The content covers a broad range of computational tasks, including data querying, text processing, and the implementation of compl
Provides a specialized collection of data structures and algorithms for solving complex computational challenges.
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
Provides resources and methodologies for mastering data structures and algorithms to improve coding efficiency and interview performance.
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
Provides a comprehensive library of reusable code patterns for mastering data structures and algorithms.
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
Provides algorithmic challenges categorized by data structure and technique to improve technical interview performance.
This repository is a collection of solved algorithmic problems and data structure exercises designed for technical interview preparation. It serves as a polyglot reference implementation, providing a set of solved exercises based on a standard textbook to help candidates master the logic and complexity analysis required for coding tests. The project implements the same algorithmic logic across multiple programming languages to demonstrate platform-independent problem solving. This polyglot approach allows for the comparison of implementations across different tech stacks to highlight recurrin
Provides methodologies and reference code for mastering data structures and algorithms to improve coding efficiency.
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
Provides a structured study guide of coding problems categorized by algorithmic strategies.
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
Provides optimized algorithmic solutions for complex computational tasks involving arrays, strings, and graphs.
PythonPark is a comprehensive repository serving as a centralized educational resource for mastering Python programming, machine learning, and artificial intelligence. It functions as a structured curriculum that aggregates study materials, coding challenges, and technical roadmaps designed to guide developers through foundational software engineering concepts and advanced intelligence technologies. The project distinguishes itself by providing hands-on implementation guides that allow users to execute artificial intelligence models directly on their local hardware. By focusing on local execu
Offers study notes and coding challenges to strengthen foundational knowledge in data structures and algorithms.
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
Implements an algorithmic solver that deduces hidden color combinations by eliminating impossible candidates.
This repository is a structured database of coding interview problems designed to support software engineering career development. It functions as a centralized knowledge base that aggregates technical practice questions, mapping them to specific employer requirements and recurring computer science topics. The project distinguishes itself by clustering interview questions into company-specific collections and labeling them by technical domain. This organization allows users to identify recurring algorithmic patterns and analyze the unique testing styles associated with different organizations
Identifies recurring algorithmic themes across company interview sets to improve problem-solving speed.
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
Provides algorithms for solving knapsack problems with various constraints and quantities.