Facebook Coding Interview Question | Leetcode 333 | Largest BST Subtree

preview_player
Показать описание
In this video, we introduce how to solve the "Largest BST Subtree" question which is used by big tech companies like Google, Facebook, Amazon in coding interviews. We also cover how to behave during a coding interview, e.g. communication, testing, coding style, etc.

Please subscribe to this channel if you like this video. I will keep updating this channel with videos covering different topics in interviews from big tech companies.

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

Nice explanation. Please raise your volume and consider a lower window size to be easier to read.

SergeNevsky
Автор

The code fail in case
[3, null, 1, 2]

jimsitu