Space Analysis

CORRECTION: Recursive solutions can also have O(n) space for non-binary search style problems where you don't eliminate half of the problem space with each iteration. The classic example here is using recursion to calculate fibonacci numbers.

Run-time analysis is important, but it isn't everything. When it comes to FAANG, run-time on its own can actually be sorely lacking. This lesson teaches you:

• Why space complexity is also important when it comes to data structures and algorithms
• What a great space complexity analysis looks like, explained with an in-depth example
• A common mistake engineers make with space complexity concerning a very common data structures and algorithms pattern