Create README.md

Author: JawadSher

22 - Backtracking Algorithm Based Problems/README.md

@@ -0,0 +1,40 @@
+<h1 align='center'>BACKTRACKING - ALGORITHM BASED - PROBLEMS</h1>
+
+<p>Backtracking is a systematic method for solving constraint satisfaction problems. This repository is a curated collection of coding problems that leverage the <strong>backtracking algorithm</strong> to explore all possible solutions to a problem efficiently. It is designed to guide learners and developers through the core concepts and applications of backtracking with practical examples.</p>
+
+## What is Backtracking?
+<p>Backtracking is a systematic method for solving constraint satisfaction problems. This repository is a curated collection of coding problems that leverage the <strong>backtracking algorithm</strong> to explore all possible solutions to a problem efficiently. It is designed to guide learners and developers through the core concepts and applications of backtracking with practical examples.</p>
+
+Backtracking is an algorithmic technique for solving problems recursively by trying to build a solution incrementally. When a solution fails to meet the constraints of the problem, the algorithm backtracks and tries another path.
+
+### Key Features of Backtracking:
+- Explores all potential solutions.
+- Avoids unnecessary computations by discarding invalid paths (pruning).
+- Efficient for constraint satisfaction problems like puzzles, games, and optimization tasks.
+
+## Why Use This Repository?
+
+- **Practical Examples**: Problems are explained with examples, input/output formats, and step-by-step solutions.
+- **Structured Layout**: Each problem has its folder containing:
+  - **Code**: Well-documented source code for the solution.
+  - **Explanations**: Clear walkthroughs of the logic.
+  - **References**: Links to LeetCode or GeeksforGeeks for additional practice.
+- **Scalability**: Designed for learners at all levels, from beginners to advanced programmers.
+
+
+## Repository Content
+<p>
+<img src="https://img.shields.io/badge/problems%20count-02-orange?logo=leetcode" alt="LeetCode">
+<img src="https://img.shields.io/badge/problems%20count-02-darkgreen?logo=geeksforGeeks" alt="GeeksforGeeks">
+<img src="https://img.shields.io/badge/total%20problems%20count-03-blue" alt="Problem Count"> 
+</p>
+
+| No. | Problem Name                              | Description                                | LeetCode     | GFG   |
+|-----|------------------------------------------|--------------------------------------------|------------------|-------------|
+| 01  | [Rat in a Maze](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/22%20-%20Backtracking%20Algorithm%20Based%20Problems/01%20-%20Rat%20in%20a%20Maze) | Find paths through a maze using backtracking. | Non             | [Link](https://practice.geeksforgeeks.org/problems/rat-in-a-maze-problem/1) |
+| 02  | [N-Queens](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/22%20-%20Backtracking%20Algorithm%20Based%20Problems/02%20-%20N-Queens) | Place N queens on an N×N chessboard such that no two queens attack each other. | [Link](https://leetcode.com/problems/n-queens/) | [Link](https://practice.geeksforgeeks.org/problems/n-queen-problem0315/1) |
+| 03  | [Sudoku Solver](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/22%20-%20Backtracking%20Algorithm%20Based%20Problems/03%20-%20Sudoku%20Solver) | Solve a partially filled Sudoku board using backtracking. | [Link](https://leetcode.com/problems/sudoku-solver/) | Non        |
+
+
+---
+Happy Coding! 😊