Reverse Only Letters (LeetCode 917) | 2 Different Methods | Stack Data Structure and Two Pointers

preview_player
Показать описание


Chapters:
00:00 - Intro
00:38 - Problem Statement
03:00 - Using a Stack
06:36 - Two Pointer approach
10:07 - Dry-run of Code
12:02 - Final Thoughts

📚 Links to topics I talk about in the video:

📖 Reference Books:

🎥 My Recording Gear:

💻 Get Social 💻

#leetcode #programming #interview
Рекомендации по теме
Комментарии
Автор

Hey! Just one additional info, if you do the two pointers swap in the same array, you will not need an extra space, so the space complexity will be O(1)

ClovisNeto
Автор

I rarely comment on any videos on youtube but here i just cannot stop myself, ,sir you are uploading great content specially the videos in which you guide on how to solve a particular question .your videos are ver helpfull for me and many others too.Just a little suggestion to make a playlist and add these videos in systematic topic wise , ,like this video can be added to stacks and arrays section.Once again i would like to say you are the best

Aditya-mfuo
Автор

Hi Nikhil, it would be great if you explain - count subarrays with fixed bounds problem in leetcode. It is asked in my interview

nandhakumarkr
Автор

Hi nikhil, can you come up with one roadmap video for all your uploaded videos. Probably your videos are shuffelled.

rudreshcm
welcome to shbcf.ru