Nodes in complete binary tree (Python interview)

preview_player
Показать описание
Watch someone try to solve the Nodes in a complete Binary Tree problem in Python with an Amazon engineer. This is a mock interview - see if they can find the solution!

TIMESTAMPS
00:00 Intro
03:15 Double an array
17:05 Return the shortest edge of the squares that fit in the given rectangles
38:50 Given a complete binary tree, return the count of all the nodes in the tree
  1. interviewing.io
  2. coding interview
  3. technical interview
  4. programming interview
  5. phone interview
  6. software engineer interview
Рекомендации по теме
L32. Count total 0:16:13

L32. Count total Nodes in a COMPLETE Binary Tree | O(Log^2 N) Approach | C++ | Java

Understanding Complete Binary 0:04:05

Understanding Complete Binary Tree

Nodes in complete 1:01:46

Nodes in complete binary tree (Python interview)

How to solve 0:04:20

How to solve (almost) any binary tree coding problem

Why a full/proper 0:07:52

Why a full/proper binary tree with n leaf nodes must have n-1 internal nodes

All Possible Full 0:13:18

All Possible Full Binary Trees - Memoization - Leetcode 894 - Python

Count Complete Tree 0:13:39

Count Complete Tree Nodes | Leetcode #222

Binary Trees - 0:10:18

Binary Trees - Data Structures Explained

Decision tree from 1:20:40

Decision tree from scratch - theory | ML fundamentals | ML in Julia

Microsoft's Most Asked 0:08:18

Microsoft's Most Asked Question 2021 - Count Good Nodes in a Binary Tree - Leetcode 1448 - Pyth...

Leetcode - Count 0:06:52

Leetcode - Count Complete Tree Nodes (Python)

Check Completeness of 0:07:57

Check Completeness of a Binary Tree - Leetcode 958 - Python

Count Full, Half, 0:03:47

Count Full, Half, Leaf Nodes in Binary Tree | Trees #8

004 Full binary 0:04:59

004 Full binary tree and Complete Binary Tree

Count Complete Tree 0:14:49

Count Complete Tree Nodes (LeetCode 222) | Complete tree examples | Recursive & Iterative

Complete Binary Tree, 0:09:52

Complete Binary Tree, Types of Binary Tree

Binary Tree Algorithms 1:48:53

Binary Tree Algorithms for Technical Interviews - Full Course

LeetCode Count nodes 0:07:56

LeetCode Count nodes in Almost Complete Binary Tree

Count Nodes in 0:17:57

Count Nodes in Complete Binary Tree

LeetCode Check Completeness 0:06:35

LeetCode Check Completeness of a Binary Tree Explained - Java

25.5 Full and 0:24:58

25.5 Full and Complete Binary Trees

Count Complete Tree 0:05:27

Count Complete Tree Nodes | Day 23 | Binary Search | [June LeetCoding Challenge] [Leetcode #222]

Complete Binary Tree 0:02:07

Complete Binary Tree Example

Heap Sort Part 0:02:08

Heap Sort Part 3 - Almost Complete Binary Tree

Комментарии
Автор

The interviewer doesn't even spot the errors lol.
1st problem: in python you can't simply index an empty array.

2nd problem: the if and elif statement check for the same condition. Additionally both paths compare rect[0] to maxVal instead of rect[1] in one and rect[0] in the other


didn't watch the 3rd problem yet

Paloma
Автор

num=[1, 4, 5, 7, 2, 3]
ans=[num[i%len(num)] for i in range(len(num)*2)]

daminehrostami
Автор

Actually the solution to the first problem is not working

VladBurlutsky
Автор

where are they drawing? unable to see anything lol. Whats the point of recording anyway? use a better recorder lol

blasttrash