Design Circular Queue | Leetcode 622 | LC Medium | Live coding session | April 4 | LEETCODE EXPLORE

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

1) 0:00 Explaining the problem out loud
2) 1:10 Algorithm walkthrough
3) 11:15 Coding it up
4) 20:00 TC/SC

PS : Please increase the speed to 1.25X
Рекомендации по теме
Комментарии
Автор

Someone disliked it even before the video started. Someone wants the notification from me to dislike. Please do something constructive crazy fellow. Guys looks like I need your support again, all I want is genuine feedback.

CodeWithSunchitDudeja
Автор

what I found the most difficult is to write the rear method. After watching your video it cleared all my doubts. Now understood

akhilbhardwaj
Автор

Thank you! The drawing got confusing, maybe use a different drawing tool, but overall you helped me understand the algorithm with ease!

CDJohnson
Автор

Keep it up Sunchit! You are doing great!! One thing I like about your presentation is .. each time you come up with a nice and matching cover picture/gif for the problem.. That looks cool at the beginning.

akshayrc
Автор

Is dequeing just moving the pointer to the next pointer? Do we need to delete the cell after incrementing the index?

etherealscaped
join shbcf.ru