From d66280abe4091b75a9773687104f125c31417fea Mon Sep 17 00:00:00 2001
From: Ajay Dhangar <99037494+ajay-dhangar@users.noreply.github.com>
Date: Fri, 8 Nov 2024 21:50:19 +0530
Subject: [PATCH] Update Tiling-problem.md

---
 docs/backtracking algorithms/Tiling-problem.md | 5 +----
 1 file changed, 1 insertion(+), 4 deletions(-)

diff --git a/docs/backtracking algorithms/Tiling-problem.md b/docs/backtracking algorithms/Tiling-problem.md
index 69fbe732d..9da612fa0 100644
--- a/docs/backtracking algorithms/Tiling-problem.md	
+++ b/docs/backtracking algorithms/Tiling-problem.md	
@@ -1,12 +1,9 @@
 ---
-
-id:  tiling-problem-domino-tiling
+id: tiling-problem-domino-tiling
 sidebar_position: 6
 title: Tiling-problem 
 sidebar_label: Tiling Problem
-
 ---
-## Definition 📖
 
 The **Tiling Problem** involves determining the number of ways to tile a given grid using dominoes (or similar tiles) of a fixed size. Specifically, in the **Domino Tiling** problem, the goal is to tile a `2 x n` grid using `1 x 2` dominoes. The dominoes can be placed either horizontally or vertically.