educative.io

Can anyone tell me why the time complexity is O(n^2 +2 ^n +l)?

can anyone teach me how it works?


Course: Grokking Coding Interview Patterns in Java - Learn Interactively
Lesson: Solution: Word Break II - Grokking Coding Interview Patterns in Java

Thank you for reaching out to us. We are grateful for your interest in our course. With regards to the time complexity of the problem Word Break II, we have included a detailed complexity analysis in our Solution lesson. You may refer to the Solution lesson of this problem for a comprehensive explanation. If you still have any questions or concerns about the complexity analysis, please don’t hesitate to let us know. We are always here to help you.

1 Like