33:33
Count Non-Decreasing Subarrays After K Operations (LeetCode Hard)
4:40
How the English language would sound if silent letters weren’t silent - BBC
14:24
3430 Maximum and Minimum Sums of at Most Size K Subarray (LeetCode Hard)
20:38
Notation Big-O - Pour les entretiens techniques
25:50