LeetCode 1482.

2 minute read

Intuition I use dynamic programming on my first thought. It works but turns out to be TLE.

LeetCode 633.

less than 1 minute read

Intuition a^2 + b^2 = c; (a >= 0 & b >= 0 & a,b,c are integers)

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-...