From 90fd4931cdd4f3e08502752f55bb907914619c81 Mon Sep 17 00:00:00 2001
From: Piyush6869 <137883301+Piyush6869@users.noreply.github.com>
Date: Tue, 10 Oct 2023 17:10:37 +0530
Subject: [PATCH 1/3] Create  Count of Smaller Numbers After Self

---
 .../Algorithms/Count of Smaller Numbers After Self       | 9 +++++++++
 1 file changed, 9 insertions(+)
 create mode 100644 LeetcodeProblems/Algorithms/Count of Smaller Numbers After Self

diff --git a/LeetcodeProblems/Algorithms/Count of Smaller Numbers After Self b/LeetcodeProblems/Algorithms/Count of Smaller Numbers After Self
new file mode 100644
index 0000000..f64f665
--- /dev/null
+++ b/LeetcodeProblems/Algorithms/Count of Smaller Numbers After Self	
@@ -0,0 +1,9 @@
+def countSmaller(nums):
+    result = []
+    for i in range(len(nums)):
+        count = 0
+        for j in range(i + 1, len(nums)):
+            if nums[j] < nums[i]:
+                count += 1
+        result.append(count)
+    return result

From 08cc947d696d3bbe0a3fe8dbcfa75879d5d03aba Mon Sep 17 00:00:00 2001
From: Piyush6869 <137883301+Piyush6869@users.noreply.github.com>
Date: Wed, 11 Oct 2023 00:05:56 +0530
Subject: [PATCH 2/3] Update Count of Smaller Numbers After Self

---
 .../Count of Smaller Numbers After Self       | 20 +++++++++++++++++++
 1 file changed, 20 insertions(+)

diff --git a/LeetcodeProblems/Algorithms/Count of Smaller Numbers After Self b/LeetcodeProblems/Algorithms/Count of Smaller Numbers After Self
index f64f665..e3a09d1 100644
--- a/LeetcodeProblems/Algorithms/Count of Smaller Numbers After Self	
+++ b/LeetcodeProblems/Algorithms/Count of Smaller Numbers After Self	
@@ -1,3 +1,23 @@
+Question:
+Input: nums = [5,2,6,1]
+Output: [2,1,1,0]
+Explanation:
+To the right of 5 there are 2 smaller elements (2 and 1).
+To the right of 2 there is only 1 smaller element (1).
+To the right of 6 there is 1 smaller element (1).
+To the right of 1 there is 0 smaller element.
+
+Example 2:
+
+Input: nums = [-1]
+Output: [0]
+Example 3:
+
+Input: nums = [-1,-1]
+Output: [0,0]
+
+
+
 def countSmaller(nums):
     result = []
     for i in range(len(nums)):

From b55b84105f20e590277a6118b506795e418887f7 Mon Sep 17 00:00:00 2001
From: Piyush6869 <137883301+Piyush6869@users.noreply.github.com>
Date: Wed, 11 Oct 2023 00:18:11 +0530
Subject: [PATCH 3/3] Update Count of Smaller Numbers After Self

---
 .../Count of Smaller Numbers After Self       | 22 +++++++++++--------
 1 file changed, 13 insertions(+), 9 deletions(-)

diff --git a/LeetcodeProblems/Algorithms/Count of Smaller Numbers After Self b/LeetcodeProblems/Algorithms/Count of Smaller Numbers After Self
index e3a09d1..9563277 100644
--- a/LeetcodeProblems/Algorithms/Count of Smaller Numbers After Self	
+++ b/LeetcodeProblems/Algorithms/Count of Smaller Numbers After Self	
@@ -18,12 +18,16 @@ Output: [0,0]
 
 
 
-def countSmaller(nums):
-    result = []
-    for i in range(len(nums)):
-        count = 0
-        for j in range(i + 1, len(nums)):
-            if nums[j] < nums[i]:
-                count += 1
-        result.append(count)
-    return result
+function countSmaller(nums) {
+    const result = [];
+    for (let i = 0; i < nums.length; i++) {
+        let count = 0;
+        for (let j = i + 1; j < nums.length; j++) {
+            if (nums[j] < nums[i]) {
+                count += 1;
+            }
+        }
+        result.push(count);
+    }
+    return result;
+}