<p>Given an integer array <code>nums</code>, return<em> an integer array </em><code>counts</code><em> where </em><code>counts[i]</code><em> is the number of smaller elements to the right of </em><code>nums[i]</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [5,2,6,1]
<strong>Output:</strong> [2,1,1,0]
<strong>Explanation:</strong>
To the right of 5 there are <b>2</b> smaller elements (2 and 1).
To the right of 2 there is only <b>1</b> smaller element (1).
To the right of 6 there is <b>1</b> smaller element (1).
To the right of 1 there is <b>0</b> smaller element.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [-1]
<strong>Output:</strong> [0]
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> nums = [-1,-1]
<strong>Output:</strong> [0,0]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>-10<sup>4</sup> &lt;= nums[i] &lt;= 10<sup>4</sup></code></li>
</ul>

class Solution:
    def countSmaller(self, nums: List[int]) -> List[int]:
        ansArr = [0] * len(nums)
        main = [(nums[i], i) for i in range(len(nums))]
        def mergesort(start, end):
            if start >= end - 1:
                return main[start:end]
            mid = (start + end) // 2
            left, right = mergesort(start, mid), mergesort(mid, end)
            currArr = []
            i, j, count = 0, 0, 0
            while i < len(left) and j < len(right):
                if left[i][0] > right[j][0]:
                    count += 1
                    currArr.append(right[j])
                    j += 1
                else:
                    ansArr[left[i][1]] += count
                    currArr.append(left[i])
                    i += 1
            while i < len(left):
                currArr.append(left[i])
                ansArr[left[i][1]] += count
                i += 1
            while j < len(right):
                currArr.append(right[j])
                j += 1
            return currArr
        mergesort(0, len(nums))
        return ansArr






        
        



1739