4 Repos
Algorithms for finding optimal paths, such as the longest or shortest, within a two-dimensional grid structure.
Distinct from Shortest Path Algorithms: Focuses on grid-based path optimization specifically within dynamic programming contexts, distinct from general graph shortest path algorithms.
Explore 4 awesome GitHub repositories matching scientific & mathematical computing · Grid Path Optimizations. Refine with filters or upvote what's useful.
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
The project provides algorithmic solutions for finding the longest path in a grid with obstacles.
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
Implements dynamic programming to count unique paths from start to finish in a grid.
Dieses Projekt ist eine umfassende Sammlung von C++-Bibliotheken und Toolkits, die Referenzimplementierungen für Datenstrukturen, Graphenalgorithmen und bitweise Logik bereitstellen. Es dient als C++-Algorithmen-Referenz mit über 180 gelösten Programmieraufgaben und einem spezialisierten Toolkit für Competitive Programming. Das Repository zeichnet sich durch umfangreiche Low-Level-Bibliotheken zur Bit-Manipulation für Paritätsprüfungen, Endianness-Erkennung und XOR-basierte Logik aus. Es bietet zudem eine breite Palette an Referenzlösungen für komplexe algorithmische Herausforderungen in den Bereichen Backtracking, Graphentheorie und dynamische Programmierung. Die Funktionalität umfasst grundlegende lineare und hierarchische Datenstrukturen, einschließlich verketteter Listen, Stacks, Queues und binärer Suchbäume. Es enthält eine vollständige Suite von Graphenalgorithmen für Pfadsuche und Spannbäume, verschiedene Sortier- und Suchmethoden, Matrix-Transformationen sowie Dienstprogramme zur String-Verarbeitung. Darüber hinaus deckt es mathematische Berechnungsfunktionen, verlustfreie Datenkompression und grundlegende kryptografische Chiffren ab.
Computes the number of distinct paths in a 2D grid using dynamic programming.
LeetCode-Swift is a collection of algorithm solutions written in Swift, designed for coding interview preparation. Each solution is implemented as a self-contained function with no external dependencies, making it easy to run and test. The repository organizes solutions by topic and company, and every file includes time and space complexity annotations, allowing quick evaluation of algorithmic efficiency. What sets this repository apart is its flat file structure and the way solutions are tagged with the companies that asked them in interviews, enabling targeted practice. All code resides in
Counts unique paths from top-left to bottom-right in a grid using 2D dynamic programming.