Uncategorized – Page 29 – 步步发财

Two Sum III – Data structure design – Python 3 (Week 14 – 17)

Flatten Binary Tree to Linked List – Python 3 (Week 14 – 16)

Lowest Common Ancestor II – Python 3 (Week 14 – 15)

Lowest Common Ancestor of a Binary Tree – Python 3 (Week 14 – 14)

Time, Space O(n).

Minimum Subtree – Python 3 (Week 14 – 13)

Time, Space O(n).

Balanced Binary Tree – Python 3 (Week 14 – 12)

Time, Space O(d).

Serialize and Deserialize Binary Tree – Python 3 (Week 14 – 11)

Time, Space O(n).

Sequence Reconstruction – Python 3 (Week 14 – 10)

Time, Space O(n^2).

Maximum Average Subarray II – Python 3 (Week 14 – 09)

Time O(log (max(nums)-min(nums))*n). Space O(log (max(nums)-min(nums))).

Copy Books – Python 3 ( Week 14 – 08)

Time O(log(end – start) * number of book ). Space O(log(end -start)).

Design a site like this with WordPress.com