Grid Challenge Discussions | | HackerRank
We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Grid Challenge
  2. Discussions

Grid Challenge

  • dotaikhoa
     + 0 comments

    c++ solution because strings are essentially vectors of chars, we can sort them alphabetically using built in sort function. then we check all columns for any pair of consecutive characters that are not in ascending order

    string gridChallenge(vector<string> grid) {
    bool ok = true;
    int n = grid.size();
    
    for (int i = 0; i < n; i++) {
        sort(grid[i].begin(), grid[i].end());    
    }
    
    for (int i = 1; i < n; i++) {
        for (int j = 0; j < n; j++) {
            ok &= (grid[i-1][j] <= grid[i][j]);
        }
    }
    
    return ok ? "YES" : "NO";
}