LeetCode Hard. 862. Shortest Subarray with Sum at Least K. In-depth explanation.

preview_player
Показать описание
I kept this video too long, I guess. Please if you feel you already understand what I am saying in the video, skip forward. Happy coding💻✨

Timestamps:
0:00 - Problem Statement
1:31 - Explanation of a different problem
6:41 - Intro to explanation of the original problem
12:58 - Driving the main idea
19:46 - Checking two cases
31:48 - Code
34:39 - Explanation of a line from the code (you can skip this)
Рекомендации по теме
Комментарии
Автор

The video is a bit long. But I found it really helpful.

bubblesort
visit shbcf.ru