CPMagical CP Library

Problem solution · C++

Sequential Grid Path Cover

Sequential Grid Path Cover: a C++ solution using depth-first search. Learn the idea, check the complexity, and read the full code, with credit to Kamyu LeetCode Solutions.

Technique
Depth-first search
Source
Kamyu LeetCode Solutions
Length
46 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Depth-first search

For Sequential Grid Path Cover, the implementation follows one branch at a time, making it suitable for components, trees, backtracking, or dependency exploration.

  1. Define the state carried into one recursive or stack frame.
  2. Mark or choose the current state before exploring children.
  3. Combine child results or undo the choice when the branch finishes.

Code notes

  • 46 lines of C++ from the credited upstream file sequential-grid-path-cover.cpp.
  • The implementation visibly relies on sequence storage.
  • 3 loop blocks detected.

Complexity

Count unique states for graph traversal; for backtracking, count the branching factor and maximum depth.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from Kamyu LeetCode Solutions by kamyu104 and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeSequential Grid Path Cover · C++C++
Use this to learn the idea, then write your own version.
// Time:  O(m * n * 3^(m * n))// Space: O(m * n) // backtrackingclass Solution {public:    vector<vector<int>> findPath(vector<vector<int>>& grid, int k) {        static const vector<pair<int, int>> DIRECTIONS = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};         vector<vector<int>> result;        const function<bool (int, int, int)> backtracking = [&](int i, int j, int curr) {            const int v = grid[i][j];            if (v && v != curr) {                return false;            }            grid[i][j] = -1;            result.emplace_back(vector<int>{i, j});            if (size(result) == size(grid) * size(grid[0])) {                return true;            }            const int new_curr = v == curr ? curr + 1 : curr;            for (const auto& [di, dj] : DIRECTIONS) {                const int ni = i + di, nj = j + dj;                if (!(0 <= ni && ni < size(grid) && 0 <= nj && nj < size(grid[0]) && grid[ni][nj] != -1)) {                    continue;                }                if (backtracking(ni, nj, new_curr)) {                    return true;                }            }            result.pop_back();            grid[i][j] = v;            return false;        };         for (int i = 0; i < size(grid); ++i) {            for (int j = 0; j < size(grid[0]); ++j) {                if (backtracking(i, j, 1)) {                    return result;                }            }        }        return result;    }};

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗