4 个仓库
Awesome GitHub RepositoriesGrid Path Optimizations
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.
Awesome Grid Path Optimizations GitHub Repositories
用 AI 发现最棒的仓库。我们将通过 AI 为您搜索最匹配的仓库。
- azl397985856/leetcode
azl397985856/leetcode
55,758在 GitHub 上查看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.
JavaScriptalgoalgorithmalgorithms - apachecn/apachecn-algo-zh
apachecn/apachecn-algo-zh
11,140在 GitHub 上查看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.
JavaScriptalgorithmcodingdata-structure - mandliya/algorithms_and_data_structures
mandliya/algorithms_and_data_structures
6,145在 GitHub 上查看This project is a comprehensive collection of C++ libraries and toolkits providing reference implementations for data structures, graph algorithms, and bitwise logic. It serves as a C++ algorithm reference containing over 180 solved coding problems and a specialized toolkit for competitive programming. The repository distinguishes itself through extensive low-level bit manipulation libraries for parity checks, endianness detection, and XOR-based logic. It also provides a wide array of reference solutions for complex algorithmic challenges involving backtracking, graph theory, and dynamic prog
Computes the number of distinct paths in a 2D grid using dynamic programming.
C++algorithmbit-manipulationc - soapyigu/leetcode-swift
soapyigu/LeetCode-Swift
4,958在 GitHub 上查看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.
Swiftalgorithmdata-structuresinterview
