Grokking the Coding Interview: Patterns for Coding Questions
Ask Author
Back to course home

0% completed

Vote For New Content
The solution is not Sliding Window. For example, this is equivalent to Solution ...

Fah Pariyavuth

Feb 24, 2022

The solution is not Sliding Window. For example, this is equivalent to Solution 1 in the equivalent Leetcode problem. Rather we should look to implement Solution 2 which is a true Sliding Window solution and has much better runtime. O(M + N*Len) as opposed to O(N * M * Len) https://leetcode.com/problems/substring-with-concatenation-of-all-words/solution/

31

0

Comments
Comments
M
Mikhail Putilov4 years ago

thanks, man

D
Douglas 3 years ago

Thank you!

C
CaptainKidd 3 years ago

Yes. It doesn't follow any of the established sliding window patterns up until this point. TBF though the leetcode question isn't much better other than sticking with the convention of counting matches. Everything else though is stuff we haven't seen at all in this chap...

M
Master Account2 years ago

Yea - this was not sliding window at all. It is DP.

On this page