4 repositorios
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.
Este proyecto es una colección integral de librerías y toolkits de C++ que proporcionan implementaciones de referencia para estructuras de datos, algoritmos de grafos y lógica de bits. Sirve como una referencia de algoritmos en C++ que contiene más de 180 problemas de programación resueltos y un toolkit especializado para programación competitiva. El repositorio se distingue por sus extensas librerías de manipulación de bits de bajo nivel para comprobaciones de paridad, detección de endianness y lógica basada en XOR. También proporciona una amplia gama de soluciones de referencia para desafíos algorítmicos complejos que involucran backtracking, teoría de grafos y programación dinámica. La superficie de capacidades cubre organizadores de datos lineales y jerárquicos fundamentales, incluyendo listas enlazadas, pilas, colas y árboles de búsqueda binaria. Incluye un conjunto completo de algoritmos de grafos para búsqueda de caminos y árboles de expansión, varios métodos de ordenamiento y búsqueda, transformaciones de matrices y utilidades de procesamiento de cadenas. Además, cubre funciones computacionales matemáticas, compresión de datos sin pérdida y cifrados criptográficos básicos.
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.