Binary Tree Cameras | Leetcode 968 | Leecode Hard | Live coding session

preview_player
Показать описание
Here is the solution to "Binary Tree Cameras" leetcode question. Hope you have a great time going through it.

🔥 Chapters
1) 0:00 Explaining the problem out loud
2) 1:10 Algorithm walkthrough
3) 2:00 Test case walk through
3) 8:00 Coding it up

Check this out 🔽🔽🔽🔽

🔥🔥🔥🔥👇👇👇 For discussion/feedback/humour/doubts/new openings

👉 Solutions

🔥🔥🔥🔥👇👇👇 For discussion/feedback/humour/doubts/new openings

🔴 Checkout the series: 🔥🔥🔥

🔥🔥🔥 Leetcode Monthly Contest Playlist

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

thank you decoded! great explanation as always!

shrimpo
Автор

I actually thought the same way, but couldn't figure out how to do that. Great explanation sir.

NihalSingh-lden
Автор

I don't know by when will I be able to build the ease with which you code it up. But great solution @Coding Decoded.

tanyagupta
Автор

The order of "if"s matters here

eastwoodsamuel
Автор

Isn't it equals to count of nodes having leaf child ?

anujchauhan
Автор

somehow I didn't understand the solution explaintion. 😓

santoshvarma
welcome to shbcf.ru