More Problems

• Given an array of integers, return the length of the longest strictly increasing subsequence.
• Sort an array of integers by their frequency in decreasing order, breaking ties by the value of the integer.
• Given an array of n distinct integers, check if it is possible to reorder it to form an arithmetic progression.
• Find the kth smallest element in an unsorted array using the quickselect algorithm.
• Find the minimum number of swaps required to sort an array using cycle decomposition.
• Check if it is possible to partition an array into two subarrays where the sum of elements in both is the same.
• Find the longest contiguous subarray with an equal number of even and odd numbers.
• Rearrange an array such that the first half is sorted in ascending order and the second half is sorted in descending order.