Return root node given shuffled nodes - SWE Interview (with Principal Software Engineer)

Ace your interviews with Exponent’s software engineering interview course: https://bit.ly/40PaS9Y

In this video, principal software engineer Simon answers the SWE coding interview question: "Given a list of shuffled binary tree nodes, including nodes with left and right pointers, validate whether the nodes form a binary tree."

Want more software engineering content?
Move All Zeros To End Of Array:    • Coding Mock Interview - Move All Zeros To ...  
Technical interview question at Google:    • Video  
Technical interview questions at Google:    • Google Software Engineering Interview: Bin...  
Design TikTok with Google SWE:    • System Design Mock Interview: Design TikTo...  
Negotiation tips:    • How to Negotiate Your Tech Salary Simulati...  

👉 Subscribe to our channel: http://bit.ly/exponentyt
🕊️ Follow us on Twitter: http://bit.ly/exptweet
💙 Like us on Facebook for special discounts: http://bit.ly/exponentfb
📷 Check us out on Instagram: http://bit.ly/exponentig
📹 Watch us on TikTok: https://bit.ly/exponenttiktok

ABOUT US:
Did you enjoy this video? Want to land your dream career? Exponent is an online community, course, and coaching platform to help you ace your upcoming interview. Exponent has helped people land their dream careers at companies like Google, Microsoft, Amazon, and high-growth startups. Exponent is currently licensed by Stanford, Yale, UW, and others.

Our courses include interview lessons, questions, and complete answers with video walkthroughs. Access hours of real interview videos, where we analyze what went right or wrong, and our 1000+ community of expert coaches and industry professionals, to help you get your dream job and more!