Kth Largest Sum in a Binary Tree - Leetcode 2583 - Python

Показать описание

0:00 - Read the problem
0:30 - Drawing Explanation
6:49 - Coding Explanation

leetcode 2583

#neetcode #leetcode #python

NeetCodeIO

Рекомендации по теме

Комментарии

Google interview tomorrow. Thanks for all your help. Wish me luck🤞

michaelwang

Thanks @NeetCodeIO again for the crystal-clear explanation 💖
Btw, I found out this simple optimization make me beating 100% solution yay:
if len(heap) < k: heapq.heappush(heap, sum)
elif len(heap) >= k and sum > heap[0]: heapq.heappop(heap) heapq.heappush(heap, sum)
Simply put, add the sum conditionally instead of checking the size after pre-add the sum to the heap.

Have a good day!

jhlee

You can actually improve the overall time complexity further, from O(n+hlogk) to O(n+n) on average. You can use quickselect on the list of sums, which gives a linear kth element on average.
In an interview, you might choose to go with the minheap, because its very simple to implement and explain, but if the interviewer will then ask "How can you improve this further, to linear time", you should mention that Quickselect (which is Quick Sort, minus the sort part, since you just look for the kth element) has a linear time complexity on average, but worst case of O(n^2).
FAANG will, and do, ask you this.

JustSomeYTChannel

Thanks once again for the great explanation, I totally didn't think about using a min heap! Even though I found that my times were about the same between the min heap approach and the sorting approach, I suspect that was because the list only needs to be sorted once for this problem. If there was a problem that required getting the kth largest value multiple times (eg. if it had asked to return a list of kth largest values, one for each level of the tree), then the min heap approach would likely be noticably more efficient.

jamestwosheep

I've been watching so many videos of yours that my own solution before watching this video was nearly exact to yours, even same variable names, besides the return statement, I had return min_heap[0] if len(min_heap) >= k else -1

jayjw

Does anyone have any idea about what difficulty level dsa questions are usually asked for the roles of ml engineer, AI engineer etc.
And what topics are asked usually?

sumitsp

Kth Largest Sum in a Binary Tree - Leetcode 2583 - Python

Kth Largest Sum in a Binary Tree - Leetcode 2583 - Python

Heap: Kth Largest sum in a contiguous Subarray solved using heap.

KTH LARGEST SUM IN A BINARY TREE | LEETCODE 2583 | PYTHON BFS SOLUTION

[Leetcode Weekly 335] Kth Largest Sum in a Binary Tree

Kth Largest Sum in a Binary Tree - Leetcode 2583 - Java

#330 Kth Largest Sum in a Binary Tree | LeetCode POTD | GFG POTD | 22-10-2024

Kth Largest Sum in a Binary Tree | Tree | LinkedIn Interview Question | LeetCode 2583 | C++

2583. Kth Largest Sum in a Binary Tree | LeetCode Daily Challenge | Priority Queue | BFS | Codefod

2583. Kth Largest Sum in a Binary Tree (Leetcode Medium)

2583. Kth Largest Sum in a Binary Tree | LeetCode 2583 | Kth Largest Sum in a Binary Tree

2583. Kth Largest Sum in a Binary Tree - Day 22/31 Leetcode October Challenge

Kth Largest Element in an Array - Quick Select - Leetcode 215 - Python

Kth Largest Sum in a Binary Tree

2583. Kth Largest Sum in a Binary Tree | Weekly Contest 335 | LeetCode | DCC NIT-A

Kth Largest Sum in a Binary Tree | Leetcode 2583

BS 19. Painter's Partition and Split Array - Largest Sum

#2583 Kth Largest Sum in a Binary Tree - LeetCode Solutions [Medium]

solving leetcode in assembly 2583. Kth Largest Sum in a Binary Treeassembly

Kth Largest Sum in a Binary Tree | Detailed Approach | Leetcode 2583 | 10mintuesCS | Java

Leetcode : 2583 Kth Largest Sum in a Binary Tree

LEETCODE 2583 - Kth LARGEST SUM IN A BINARY TREE | Malayalam

ASMR LeetCode: Kth Largest Sum in a Binary Tree | Chill Coding

Kth Largest Sum in a Binary Tree || LeetCode

Leetcode 2583. Kth Largest Sum in a Binary Tree