Grokking Dynamic Programming Patterns for Coding Interviews
Vote

0% completed

​

Solution: Longest Bitonic Subsequence

.....

.....

.....

Like the course? Get enrolled and start learning!
A

Anonymous

· 2 years ago

For [9,8,1,7,6,5,4,3,2,1] it returnes 9 should be 8

A

Anonymous

· 4 years ago

One thing that is hit or miss in these solutions is the time & space complexity analysis. Sometimes it's there, sometimes it's not.

I realize we should be able to figure it out, but I would much appreciate a textbook time & space complexity to compare my guessed complexity to. Thanks!

Show 1 reply

Reading Progress

0%

Vote for new content