Binary Tree Questions for Technical Interviews - Google, Facebook, Amazon, Microsoft
155.7 هزار بار بازدید -
12 ماه پیش
-
This 5+ hours long video
This 5+ hours long video is all you need to be able to solve any binary tree interview question.
In this tutorial, we will dive into one of the most crucial topics to prepare for coding interviews: binary trees. Acquire profound insights and strategies to tackle interview questions from FAANG companies in this 5+ hours course.
Take part in the learning in public initiative! Share your learnings on LinkedIn and Twitter with #DSAwithKunal & don't forget to tag us!
👉 Resources
- Join Replit: http://join.replit.com/kunal-kushwaha
- Lecture code: https://replit.com/@KunalsReplit/Tree...
- Complete Java DSA playlist: Java + DSA + Interview Preparation Co...
- Code, Assignments, & Notes: https://github.com/kunal-kushwaha/DSA...
➡️ Connect with me: http://kunalkushwaha.com
👨💻 Join WeMakeDevs: http://wemakedevs.org
======================================================================
Timestamps:
0:00:00 Introduction
0:06:20 Breadth First Search (BFS)
0:20:04 Q1 : Binary Tree Level Order Traversal
0:28:01 Q2 : Average of Levels in Binary Tree
0:34:08 Q3 : Level Order Successor of a node
0:42:10 Q4 : Binary Tree Zigzag Level Order Traversal
0:54:11 Q5 : Binary Tree Level Order Traversal II
0:55:16 Q6 : Populating Next Right Pointers in Each Node
1:11:13 Q7 : Binary Tree Right Side View
1:14:52 Q8 : Cousins in Binary Tree
1:28:06 Q9 : Symmetric Tree
1:42:45 Depth First Search (DFS)
1:52:10 Q10 : Diameter of Binary Tree
2:08:08 Q11 : Invert Binary Tree
2:24:01 Q12 : Maximum Depth of Binary Tree
2:27:07 Q13 : Convert Sorted Array to Binary Search Tree
2:28:05 Q14 : Flatten Binary Tree to Linked List
2:27:54 Q15 : Validate Binary Search Tree
2:57:43 Q16 : Lowest Commom Ancestor of a Binary Tree
3:08:44 Q17 : Kth Smallest Element in a BST
3:18:28 Q18 : Construct Binary Tree from Preorder and Inorder Traversal
3:31:20 Q19 : Serialize and Deserialize Binary Tree
3:48:54 Q20 : Path Sum
3:55:56 Q21 : Sum Root to Leaf Numbers
4:05:11 Q22 : Binary Tree Maximum Path Sum
4:19:50 Q23 : Path Exists in Binary Tree from Root to Leaf
4:26:24 Q24 : Path Exists in Binary Tree at Any Nodes
4:45:27 Top 50 Tree Coding Problems on GeeksForGeeks
4:48:00 Depth First Search (DFS) using Stack
4:56:28 Resources
#trees #placement #dsa #computerscience #faang
In this tutorial, we will dive into one of the most crucial topics to prepare for coding interviews: binary trees. Acquire profound insights and strategies to tackle interview questions from FAANG companies in this 5+ hours course.
Take part in the learning in public initiative! Share your learnings on LinkedIn and Twitter with #DSAwithKunal & don't forget to tag us!
👉 Resources
- Join Replit: http://join.replit.com/kunal-kushwaha
- Lecture code: https://replit.com/@KunalsReplit/Tree...
- Complete Java DSA playlist: Java + DSA + Interview Preparation Co...
- Code, Assignments, & Notes: https://github.com/kunal-kushwaha/DSA...
➡️ Connect with me: http://kunalkushwaha.com
👨💻 Join WeMakeDevs: http://wemakedevs.org
======================================================================
Timestamps:
0:00:00 Introduction
0:06:20 Breadth First Search (BFS)
0:20:04 Q1 : Binary Tree Level Order Traversal
0:28:01 Q2 : Average of Levels in Binary Tree
0:34:08 Q3 : Level Order Successor of a node
0:42:10 Q4 : Binary Tree Zigzag Level Order Traversal
0:54:11 Q5 : Binary Tree Level Order Traversal II
0:55:16 Q6 : Populating Next Right Pointers in Each Node
1:11:13 Q7 : Binary Tree Right Side View
1:14:52 Q8 : Cousins in Binary Tree
1:28:06 Q9 : Symmetric Tree
1:42:45 Depth First Search (DFS)
1:52:10 Q10 : Diameter of Binary Tree
2:08:08 Q11 : Invert Binary Tree
2:24:01 Q12 : Maximum Depth of Binary Tree
2:27:07 Q13 : Convert Sorted Array to Binary Search Tree
2:28:05 Q14 : Flatten Binary Tree to Linked List
2:27:54 Q15 : Validate Binary Search Tree
2:57:43 Q16 : Lowest Commom Ancestor of a Binary Tree
3:08:44 Q17 : Kth Smallest Element in a BST
3:18:28 Q18 : Construct Binary Tree from Preorder and Inorder Traversal
3:31:20 Q19 : Serialize and Deserialize Binary Tree
3:48:54 Q20 : Path Sum
3:55:56 Q21 : Sum Root to Leaf Numbers
4:05:11 Q22 : Binary Tree Maximum Path Sum
4:19:50 Q23 : Path Exists in Binary Tree from Root to Leaf
4:26:24 Q24 : Path Exists in Binary Tree at Any Nodes
4:45:27 Top 50 Tree Coding Problems on GeeksForGeeks
4:48:00 Depth First Search (DFS) using Stack
4:56:28 Resources
#trees #placement #dsa #computerscience #faang
12 ماه پیش
در تاریخ 1402/06/09 منتشر شده
است.
155,703
بـار بازدید شده