Array Distribution

Problem Statement

Array Distribution Problem Description Given an array of integers numbers , distribute all of its integers between two arrays, first and second , based on the following rules: The first number, numbers[0] , goes to the first array. The second number, numbers[1] , goes to the second array. Each following number, numbers[i] where i > 1 , goes to the array with the higher number of elements that are strictly greater than numbers[i] . In case of a tie, numbers[i] goes to the array with a lower length. If it is still a tie, numbers[i] goes to the first array. Your task is to return a single array - the combination of first and second by appending all elements of second to the end of first . Note: You are not expected to provide the most optimal solution, but a solution with time complexity not worse than O(numbers.length^2) will fit within the execution time limit. Examples Example 1: Input: numbers = [5, 7, 6, 9, 2] Output: [5, 9, 2, 7, 6] Explanation: numbers[0] = 5 goes to the first arra