Partition Array According to Given Pivot

lcpy gen -n 2161   # by problem number
lcpy gen -s partition_array_according_to_given_pivot   # by problem name

Input: nums = [9,12,5,10,14,3,10], pivot = 10
Output: [9,5,3,10,10,12,14]
Explanation: The elements 9, 5, and 3 are less than the pivot so they are on the left side of the array. The elements 12 and 14 are greater than the pivot so they are on the right side of the array. The relative ordering of the elements less than and greater than pivot is also maintained. [9, 5, 3] and [12, 14] are the respective orderings.

Input: nums = [-3,4,3,2], pivot = 2
Output: [-3,2,4,3]
Explanation: The element -3 is less than the pivot so it is on the left side of the array. The elements 4 and 3 are greater than the pivot so they are on the right side of the array. The relative ordering of the elements less than and greater than pivot is also maintained. [-3] and [4, 3] are the respective orderings.

class Solution:
    # Time: O(n)
    # Space: O(n)
    def pivot_array(self, nums: list[int], pivot: int) -> list[int]:
        less: list[int] = []
        equal: list[int] = []
        greater: list[int] = []
        for num in nums:
            if num < pivot:
                less.append(num)
            elif num > pivot:
                greater.append(num)
            else:
                equal.append(num)
        return [*less, *equal, *greater]