From 8cfad660d2c1a9e0bda3c3aefa024c4d3770f1a6 Mon Sep 17 00:00:00 2001
From: SUBHAMAY__GANGULY <71601569+STREIN-11@users.noreply.github.com>
Date: Fri, 18 Oct 2024 20:59:03 +0530
Subject: [PATCH] Update Minimum_number.cpp

---
 Daily/Minimum_number.cpp | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/Daily/Minimum_number.cpp b/Daily/Minimum_number.cpp
index 02bde100..834addfe 100644
--- a/Daily/Minimum_number.cpp
+++ b/Daily/Minimum_number.cpp
@@ -2,6 +2,11 @@
 You are given an array arr of n elements. In one operation you can pick two indices i and j, such that arr[i] >= arr[j] and
  replace the value of arr[i] with (arr[i] - arr[j]). You have to minimize the values of the array after performing any number
  of such operations.
+
+
+
+
+ 
 Example 1:
 Input:
 n = 3