LeetCode 945.

less than 1 minute read

Intuition After sorting, every index number should become the nearest bigger number to current value

Heap Sort

2 minute read

LeetCode 215.

less than 1 minute read

```java class Solution { public int findKthLargest(int[] nums, int k) { int[] result = mergeSort(0, nums.length-1, nums); return result[nums.length-...

Merge Sort

1 minute read

LeetCode 2037.

1 minute read

```java class Solution { public int minMovesToSeat(int[] seats, int[] students) { int result = 0; int[] sseats = mergeSort(0, seats.lengt...