Add C++ Solution for LeetCode Problem 36: Valid Sudoku

[richochetclementine1315]

🚀 Add C++ Solution for LeetCode Problem 36: Valid Sudoku

📌 Problem Statement

LeetCode 36 – Valid Sudoku
Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:

• Each row must contain the digits 1-9 without repetition.
• Each column must contain the digits 1-9 without repetition.
• Each of the nine 3x3 sub-boxes must contain the digits 1-9 without repetition.

🛠️ Proposal

I would like to contribute a C++ solution for this problem.
The solution will include:

• Clean and readable code with proper variable naming.
• Inline comments explaining each line.
• Efficient use of boolean arrays for constraint checking.
• Edge case handling.

📄 Note:
The intuition, approach, and time & space complexity analysis will be documented in the README.md file located in the same directory as the solution code.

🔗 Resources

• Problem Link: Leetcode 36 – Valid Sudoku

Please let me know if I can proceed with this contribution.

Thanks!

[KartikeyaNainkhwal]

Hii ,I’d like to work on this.