2161. Partition Array According to Given Pivot

class Solution {
    public int[] pivotArray(int[] nums, int pivot) {
        int n = nums.length;
        int[] result = new int[n];

        int index = 0;

        // Elements less than pivot
        for (int num : nums) {
            if (num < pivot) {
                result[index++] = num;
            }
        }

        // Elements equal to pivot
        for (int num : nums) {
            if (num == pivot) {
                result[index++] = num;
            }
        }

        // Elements greater than pivot
        for (int num : nums) {
            if (num > pivot) {
                result[index++] = num;
            }
        }

        return result;
    }
}

class Solution:
    def pivotArray(self, nums, pivot):

        result = []

        for num in nums:
            if num < pivot:
                result.append(num)

        for num in nums:
            if num == pivot:
                result.append(num)

        for num in nums:
            if num > pivot:
                result.append(num)

        return result

class Solution {
public:
    vector<int> pivotArray(vector<int>& nums, int pivot) {

        vector<int> result;

        for (int num : nums) {
            if (num < pivot)
                result.push_back(num);
        }

        for (int num : nums) {
            if (num == pivot)
                result.push_back(num);
        }

        for (int num : nums) {
            if (num > pivot)
                result.push_back(num);
        }

        return result;
    }
};

var pivotArray = function(nums, pivot) {

    const result = [];

    for (const num of nums) {
        if (num < pivot) {
            result.push(num);
        }
    }

    for (const num of nums) {
        if (num === pivot) {
            result.push(num);
        }
    }

    for (const num of nums) {
        if (num > pivot) {
            result.push(num);
        }
    }

    return result;
};