Owen Liu

Full-Stack Software Engineer, loves mountain climbing and exploring new things.

Dynamic Programming

less than 1 minute read

Problems LeetCode 375. Guess Number Higher or Lower II LeetCode 376. Wiggle Subsequence LeetCode 396. Rotate Function LeetCode 413. Arithmetic Slice...

LeetCode 96.

1 minute read

Question Given an integer n, return the number of structurally unique BST's (binary search trees) which has exactly n nodes of unique values from 1 to n.

LeetCode 279.

less than 1 minute read

Complexity Time complexity: O(nsqrt(n))*

LeetCode 57.

less than 1 minute read

Complexity Time complexity: O(n)

LeetCode 56.

less than 1 minute read

Complexity Time complexity: O(nlogn)