From 8ec6f2a7bbec5500fddcd7d720c48e86b9d4ab6b Mon Sep 17 00:00:00 2001
From: Aditi Bansal <142652964+Aditi22Bansal@users.noreply.github.com>
Date: Sun, 21 Jul 2024 22:11:48 +0530
Subject: [PATCH] Update 3161-Block Placement Queries.md

---
 .../lc-solutions/3100-3199/3161-Block Placement Queries.md      | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/dsa-solutions/lc-solutions/3100-3199/3161-Block Placement Queries.md b/dsa-solutions/lc-solutions/3100-3199/3161-Block Placement Queries.md
index 661f6803d..96ca7b94d 100644
--- a/dsa-solutions/lc-solutions/3100-3199/3161-Block Placement Queries.md	
+++ b/dsa-solutions/lc-solutions/3100-3199/3161-Block Placement Queries.md	
@@ -12,7 +12,7 @@ tags:
 description: "This document provides solutions to a problem using the Fenwick Tree (Binary Indexed Tree) data structure, implemented in C++, Java, and Python."
 ---
 
-## Problem
+## Problem 
 The problem requires efficiently processing a series of queries that involve updating and retrieving maximum values within a range. The solution uses the Fenwick Tree (Binary Indexed Tree) data structure to achieve this efficiently.
 
 ## Solution