LeetCode 395. Longest Substring with At Least K Repeating Characters

preview_player
Показать описание

Рекомендации по теме
Комментарии
Автор

spent a lot of time with this problem and with your video as well. The sliding window approach is pretty difficult for me, just not that experienced yet, but the recursive one is pretty understandable. You explained it pretty good, thanks for your video! even after a few years of recording it you help people :))

andrewknyazkov
Автор

not an intuitive algo but you explained it very well

pwnweb
Автор

Sir I am not getting why the time complexity for divide and conquer solution is o(n2), I am thinking it will be greater than that. Can you explain how it is o(n2)

sainikhilpalukuri
Автор

Best explanation for sliding window solution

duchungtran