Oct 10, 2023 · Oct 10, 2023 · Oct 10, 2023 · Oct 10, 2023 · Oct 10, 2023
diff --git a/LeetcodeProblems/Algorithms/Count of Smaller Numbers After Self b/LeetcodeProblems/Algorithms/Count of Smaller Numbers After Self
 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]



 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;
 }
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,33 @@
		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]



		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;
		}