You are given an array with duplicates. You have to sort the array with decreasing frequency of elements. If two elements have the same frequency, sort them by their actual value in increasing order.
Ex: [2 3 5 3 7 9 5 3 7]
Output: [3 3 3 5 5 7 7 2 9]
Given 2 sorted lists that are of even and equal size, output the median. If there is no middle number, return the average of the two middle numbers
Implement a sorting algorithm for a single linked list.
Given a sorted array of integers, write a function that will return the number with the biggest number of repetitions.
=====================================================================================================
11/18
write methods and tests for the following.
You are given an array with duplicates. You have to sort the array with decreasing frequency of elements. If two elements have the same frequency, sort them by their actual value in increasing order. Ex: [2 3 5 3 7 9 5 3 7] Output: [3 3 3 5 5 7 7 2 9]
Given 2 sorted lists that are of even and equal size, output the median. If there is no middle number, return the average of the two middle numbers
Implement a sorting algorithm for a single linked list.
Given a sorted array of integers, write a function that will return the number with the biggest number of repetitions.