The way you explained, is outstanding just keep uploading videos . Its helping us a lot.
@robinsingh20211 ай бұрын
Please keep making such videos!!our basics are getting stronger!
@IshaZakaКүн бұрын
great way of explaning
@pradyumnakhadanga1016Ай бұрын
I am watching all your videos, It is awesome.
@atulsolanki17355 ай бұрын
Great way to explain the problem and solution, to make it very simple and easy to understand. Thank you, Nikhil.
@mounikathalla34406 ай бұрын
great work Nikhil..... thank you for these tutorials....👏👌👌👌
@amitmandal58428 ай бұрын
As usual, you explanation is awesome.. Thanks you Nikhil..😊😊
@Radhe_Krishna22459 ай бұрын
Awesome explanation ❤
@IshaZakaКүн бұрын
plz make more
@pradyumnakhadanga1016Ай бұрын
It can be improved protected static boolean isPollindrom(String str){ int left = 0; int right = str.length()-1; while(left
@charlesopuoro529510 ай бұрын
Thanks always
@nikoo2810 ай бұрын
So nice of you
@myosith47955 ай бұрын
we have to use palindrome concept in many cases ...
@ash87268 ай бұрын
can you make a video on variable-size sliding window algorithm
@nikoo286 ай бұрын
will try to make one on it. did you have a look at the sliding window algorithm already? kzbin.info/www/bejne/a2e3qXuDfJWknrM
@jcv17810 ай бұрын
you didn't explain in the code how to ignore non-alphabetic characters
@nikoo2810 ай бұрын
i wanted to focus on the algorithm to check a palindrome. for your specific condition to check non-alphabetic characters, you can just add some if conditions. Also, it is not possible to account for every different problem. Some might have special symbols, some might allow numbers. Ideally, you should focus on understanding how the algorithm works...how to identify the palindrome...rest is just some decoration with if blocks and conditionals.
@prettymess2110 ай бұрын
The code is not accepted by leetcode
@nikoo2810 ай бұрын
are you sure? I tried again, and it accepts. github.com/nikoo28/java-solutions/blob/master/src/main/java/leetcode/easy/ValidPalindrome.java