educative.io

Space complexity of exclusive execution time of functions

The stated time complexity is O(mlog(n+t)), because we process that many characters in the input.

The stated space complexity is O(m), but we store the aforementioned processed characters in our stack. Should the space complexity also be O(mlog(n+t))?


Course: Grokking Coding Interview Patterns in Python - AI-Powered Learning for Developers
Lesson: https://www.educative.io/courses/grokking-coding-interview-patterns-python/solution-exclusive-execution-time-of-functions