2982. Find Longest Special Substring That Occurs Thrice II | 3 Approaches | HashMap | Arrays

[@insofcury]

Great Intuition

[@LinhHoang-ml1qo]

Very great explaination for observasion in optimise approach, thank you for your content❤‍🔥

[@sarankumaar6009]

great explanation thanks for the video :)

[@nocodelimits]

I think need to watch this Video Twice kal ka be thoda sa tough chala gya explanation mere liye🫡

[@kannank4269]

explaination 🔥

[@ahappyperson6530]

Please explain the EDITORIAL solution with O(1) space complexity

[@screensipsofficial]

Great video 👌🏻

[@laghavmohan7210]

Maybe I am wrong here, isn't the time complexity of second approach (optimised bf) is O(n*n*log(n)), because insertion in map is log(n) and not n? Also if we use unordered_map instead of map, won't it be O(n*n)? Btw great solution! never thought O(n) was even possible

[@rajdippal51]

How did you came up with this type of solution 😐, very hard to observe

[@sourabhvishwakarma6274]

CFBR

[@Anonymous____________A721]

Niceeee

[@ARYANMITTAL]

🫡🫡❤️