LeetCode 69 – Python 3 (Week 5 – 10)

Solution 1 is straightforward. Solution 2 uses binary search. Solution 3 uses Newton’s Iteration. Solution 1 Time complexity is O(n). Space complexity is O(1). Solution 2 Time complexity is O(logn). Space complexity is O(1). Solution 3 Time complexity is O(1). Space complexity is O(1). Solution 4 Time complexity is O(logn). Space complexity is O(1).

Design a site like this with WordPress.com
Get started