23232 подписчиков
280 видео
Minimum Distance Between BST Nodes | Amazon Interview Question | Tree | LeetCode 783 | C++
Minimum Absolute Difference in BST | Amazon Interview Question | Tree | LeetCode 530 | C++
Balanced Binary Tree | Amazon Interview Question | Tree | LeetCode 110 | C++
Maximum Depth of N Array Tree | Amazon Interview Question | Tree | LeetCode 559 | C++
Minimum Depth of Binary Tree | Amazon Interview Question | Tree | LeetCode 111 | C++
Minimum Window Substring | Facebook Interview Question | Sliding Window | LeetCode 76 | C++
Sliding Window Maximum | Facebook Interview Question | Sliding Window | LeetCode 239 | C++
Minimum Number of Operations to Make Array Continuous | Binary Search | LeetCode 2009 | C++
Subarray Product Less Than K | Facebook Interview Question | Sliding Window | LeetCode 713 | C++
Validate Binary Search Tree | Amazon Interview Question | Tree | LeetCode 98 | C++
Length of Longest Subarray With at Most K Frequency | Sliding Window | LeetCode 2958 | C++
Count Subarrays Where Max Element Appears at Least K Times | Sliding Window | LeetCode 2962 | C++
Implement Queue Using Stack | Amazon Interview Question | Stack | LeetCode 232 | C++
Serialize & Deserialize BST | Amazon Interview Question | Tree | LeetCode 449 | C++
Unique Path II | Amazon Interview Question | Dynamic Programming | LeetCode 63 | C++
Unique Path III | Amazon Interview Question | Dynamic Programming | LeetCode 980 | C++