ขนาดวิดีโอ: 1280 X 720853 X 480640 X 360
แสดงแผงควบคุมโปรแกรมเล่น
เล่นอัตโนมัติ
เล่นใหม่
Sorry EveryoneWhen s[i]!=s[j] then i need to fill longPal[j] = 0 but i fill longPal[j] = prev valueCorrect one is [0 1 0 0 0 1 2 2 0 1 2 2 3 4 5 6 7 0]
no worries... we got your point... sometime it happens .... everything except the lps part was 100% correct .... shoutout to you for your consistency
Thank yo so much ❤️❤️
Hey! you consistency is really amazing
Thank you ❤❤
Your dry run was completely wrong! I checked it using testcase on leetcode.
Yaa bro sorry i has pin a comment for this..
@@codeby_naruto keep working bro 👍
I solved using brute force which is O( N)^2, it passed all the tests cases but Leetcode did not raise TLE, why?
Sometimes it was accepted in 10^8
Sorry Everyone
When s[i]!=s[j] then i need to fill longPal[j] = 0 but i fill longPal[j] = prev value
Correct one is
[0 1 0 0 0 1 2 2 0 1 2 2 3 4 5 6 7 0]
no worries... we got your point... sometime it happens .... everything except the lps part was 100% correct .... shoutout to you for your consistency
Thank yo so much ❤️❤️
Hey! you consistency is really amazing
Thank you ❤❤
Your dry run was completely wrong! I checked it using testcase on leetcode.
Yaa bro sorry i has pin a comment for this..
@@codeby_naruto keep working bro 👍
I solved using brute force which is O( N)^2, it passed all the tests cases but Leetcode did not raise TLE, why?
Sometimes it was accepted in 10^8