It is funny that such an old leetcode problem passes with an incorrect solution 🫨 (Make sure to watch the end) . Segment Tree Crash Course - kzbin.info/www/bejne/hKDJg3x9epyijbc Bit Manipulation Crash Course - kzbin.info/www/bejne/enWsh4eYltmoZ7s
@rahulvarmarudraraju30127 ай бұрын
Tried to come up with a solution but never seen questions like this before. Thanks to you for making this video 😊
@pranavreddy-do9ck7 ай бұрын
isn't the time complexity n^2 since in first for loop there is another for loop inside for each charecter
@dipanjanmandal17717 ай бұрын
Chalo bhaiya ka video a hi gaya
@ARYANMITTAL7 ай бұрын
Yes sir, vo kaafi late ho gya kal sone me, toh aaj pata he nhi chala kaab time nikal gya 🥹🫂
@rsKayiira7 ай бұрын
Excellent explanation
@mugdhashrivastava7 ай бұрын
but where did you master dsa from???
@cenacr0077 ай бұрын
👍
@ABsStudio-s1u7 ай бұрын
❤
@kafuu17 ай бұрын
It is a little bit like design a state machine
@kergeysarjakin55927 ай бұрын
bro at 1:49 bella all are present in label but you wrote only bell
@ARYANMITTAL7 ай бұрын
Haan sir, next iteration me correct kar diya tha 🫡, thank you for bringing out ❤️
@ajaymishra15117 ай бұрын
Loop each n every replace the already considered one