Microsoft Coding Interview Question | Leetcode 124 | Binary Tree Maximum Path Sum

In this video, we introduce how to solve the "Binary Tree Maximum Path Sum" question which is used by big tech companies like Google, Facebook, Amazon, Microsoft, Apple 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. Problem classification (e.g. data structure, algorithm, company, leetcode) and video link: https://docs.google.com/spreadsheets/d/14aVAyDsQmz50TxhldNV5lmsyvYOJrAT9gzi7sGfMu9k/edit#gid=0