Trees in Interviews: Preparing for an Algorithmic Interview (for One Big Company)
summary
Covers common binary-tree problems asked in technical interviews at major Big Tech companies in Russia, focusing on preparation strategies and typical algorithmic tasks. Uses examples and explanations of binary tree concepts and solutions to help candidates practice for hiring interviews.
AI-written summary · about
chapters (17)
- 0:00Introduction
- 1:52Why trees
- 3:39Tree terminology
- 10:43Average tree
- 11:47PreOrder traversal
- 23:56InOrder traversal
- 26:51PostOrder traversal
- 41:00Level Order pattern
- 50:02Zigzag Level Order
- 52:37Right-side visibility
- 1:06:01Symmetric tree
- 1:16:51Identical tree
- 1:18:41Q&A
- 1:23:49Interview algorithms needed
- 1:37:56Interview tips
- 1:49:13Platform prep
- 1:55:16Conclusion
related talks
59mTop 10 Algorithms for Coding Interviews
25mFrom Rabbi to Coder: How To Prepare for the Technical Interview
01h 12mDiscussion: Algorithms and Interviews
49mLet’s Talk Technical Interviews
46mHow to Make the Interview Work for You
18mPreparing for Technical Interviews Without Dying Trying
46mIncreasing Effectiveness As A Technical Candidate/Interviewer
17mDe-Coding The Technical Interview Process
