2 个仓库
Dynamic programming algorithms that count the number of distinct paths through a grid moving only down or right.
Distinct from Grid Path Optimizations: Distinct from Grid Path Optimizations: counts all unique paths rather than finding a single optimal path.
Explore 2 awesome GitHub repositories matching scientific & mathematical computing · Unique Path Counting. Refine with filters or upvote what's useful.
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.
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.