Valid Palindrome | Leet code 125 | Theory explained + Python code | August Leet code challenge

preview_player
Показать описание
This video is a solution to Leet code 125, Valid Palindrome. I first explain what a Hash set is and how we could solve this question then I implement the solution using Python code.

Comment below if you have a better solution to this problem!

Let me know if you have any feedback and don't forget to subscribe for more videos!

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

At 7:25 how did you edit both parts of the if condition .upper() simultaneously?

abhishekshah
join shbcf.ru