Code
#include <bits/stdc++.h>
using namespace std;

class Solution {
private:
    // Function to sort the 2D array based on frequency in descending order
    void sort2darray(int array2d[2][100], int k) {
        // Bubble sort on frequencies
        for (int i = 0; i < k - 1; i++) {
            for (int j = 0; j < k - 1 - i; j++) {
                // Compare frequency row
                if (array2d[1][j] < array2d[1][j + 1]) {
                    swap(array2d[1][j], array2d[1][j + 1]);  // Swap frequencies
                    swap(array2d[0][j], array2d[0][j + 1]);  // Swap corresponding elements
                }
            }
        }
    }

public:
    // Function to sort elements of array by frequency
    void Sortele(int arr[], int n) {
        // Step 1: Sort the input array
        sort(arr, arr + n);

        // Step 2: Initialize 2D array to store element and frequency
        int arr2d[2][100];
        int k = 0;
        int count = 0;

        // Step 3: Count frequencies and store them
        for (int i = 0; i < n; i++) {
            if (i == 0) {
                arr2d[0][k] = arr[i];
                count = 1;
            } else if (arr[i] == arr[i - 1]) {
                count++;
            } else {
                arr2d[1][k] = count;
                k++;
                arr2d[0][k] = arr[i];
                count = 1;
            }
        }
        arr2d[1][k] = count;
        k++;

        // Step 4: Sort 2D array based on frequency
        sort2darray(arr2d, k);

        // Step 5: Overwrite original array
        k = 0;
        int i = 0;
        while (i < n) {
            while (