Sorting Techniques

Given an array nums of size n, return the majority element. The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.

Given an integer array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3].... You may assume the input array always has a valid answer.

Given a list of non-negative integers nums, arrange them such that they form the largest number and return it as a string.

Given the head of a linked list, return the list after sorting it in ascending order using O(n log n) time and O(1) space complexity.

Given an integer array nums, return the maximum difference between two successive elements in its sorted form. If the array contains less than two elements, return 0. You must solve it in linear time.