Become a leader in the IoT community!

Join our community of embedded and IoT practitioners to contribute experience, learn new skills and collaborate with other developers with complementary skillsets.

Step 1 of 5

CREATE YOUR PROFILE *Required

OR
Step 2 of 5

WHAT BRINGS YOU TO DEVHEADS? *Choose 1 or more

Connect & collaborate 🀝with other tech professionals
Learn & Grow πŸ“š
Contribute Experience & Expertise πŸ”§
Step 3 of 5

WHAT'S YOUR INTEREST OR EXPERTISE? *Choose 1 or more

Hardware Design πŸ’‘
Embedded Software πŸ’»
Edge Networking ⚑
Step 4 of 5

Personalize your profile

Step 5 of 5

Read & agree to our COMMUNITY RULES

  1. We want this server to be a welcoming space! Treat everyone with respect. Absolutely no harassment, witch hunting, sexism, racism, or hate speech will be tolerated.
  2. If you see something against the rules or something that makes you feel unsafe, let staff know by messaging @admin in the "support-tickets" tab in the Live DevChat menu.
  3. No age-restricted, obscene or NSFW content. This includes text, images, or links featuring nudity, sex, hard violence, or other graphically disturbing content.
  4. No spam. This includes DMing fellow members.
  5. You must be over the age of 18 years old to participate in our community.
  6. You agree to our Terms of Service (https://www.devheads.io/terms-of-service/) and Privacy Policy (https://www.devheads.io/privacy-policy)
By clicking "Finish", you have read and agreed to the our Terms of Service and Privacy Policy.

Solves a Sudoku puzzle

What will be the output of this code?

“`C++
#include
#include
using namespace std;

bool isSafe(vector>& grid, int row, int col, int num) {
// Check if the number is already present in the current row or column
for (int i = 0; i < 9; ++i) { if (grid[row][i] == num || grid[i][col] == num) { return false; } } // Check if the number is already present in the current 3x3 subgrid int startRow = row - row % 3; int startCol = col - col % 3; for (int i = 0; i < 3; ++i) { for (int j = 0; j < 3; ++j) { if (grid[i + startRow][j + startCol] == num) { return false; } } } return true; } bool solveSudoku(vector>& grid) {
int row, col;
bool isFilled = true;
for (row = 0; row < 9; ++row) { for (col = 0; col < 9; ++col) { if (grid[row][col] == 0) { isFilled = false; break; } } if (!isFilled) { break; } } if (isFilled) { return true; // Grid is completely filled } for (int num = 1; num <= 9; ++num) { if (isSafe(grid, row, col, num)) { grid[row][col] = num; if (solveSudoku(grid)) { return true; } grid[row][col] = 0; // Backtrack } } return false; // No solution found } void printGrid(vector>& grid) {
for (int i = 0; i < 9; ++i) { for (int j = 0; j < 9; ++j) { cout << grid[i][j] << " "; } cout << endl; } } int main() { vector> grid = {
{5, 3, 0, 0, 7, 0, 0, 0, 0},
{6, 0, 0, 1, 9, 5, 0, 0, 0},
{0, 9, 8, 0, 0, 0, 0, 6, 0},
{8, 0, 0, 0, 6, 0, 0, 0, 3},
{4, 0, 0, 8, 0, 3, 0, 0, 1},
{7, 0, 0, 0, 2, 0, 0, 0, 6},
{0, 6, 0, 0, 0, 0, 2, 8, 0},
{0, 0, 0, 4, 1, 9, 0, 0, 5},
{0, 0, 0, 0, 8, 0, 0, 7, 9}
};

if (solveSudoku(grid)) {
cout << "Solution:\n"; printGrid(grid); } else { cout << "No solution exists.\n"; } return 0; } ```

CONTRIBUTE TO THIS THREAD

Browse other Product Reviews tagged 

Leaderboard

RANKED BY XP

All time
  • 1.
    Avatar
    @Nayel115
    1620 XP
  • 2.
    Avatar
    @UcGee
    650 XP
  • 3.
    Avatar
    @melta101
    600 XP
  • 4.
    Avatar
    @chitour
    600 XP
  • 5.
    Avatar
    @lifegochi
    250 XP
  • 6.
    Avatar
    @Youuce
    180 XP