ViewTube

Welcome to Day 2 of the Binary Search DSA Series! In this video, we solve LeetCode 704 – Binary Search using Java. Before ...

Welcome to Day 23 of my 30 Days of Becoming a Better Problem Solver series on Tech With Hitesh! Today, I'm solving LeetCode ...

LeetCode 4: Median of Two Sorted Arrays (Hard) Problem: https://leetcode.com/problems/median-of-two-sorted-arrays/ This video ...

Find the integer square root of x (rounded down) without using Math.sqrt(). This is where we start the "Binary Search on Answer" ...

HashMap - Need sorted data search in O(log N)? ➔ Binary Search - Need shortest path on unweighted graph? ➔ BFS (Queue) ...

Problem #333 of the Brute To Best series: Largest BST Subtree. Given the root of a binary tree, return the number of nodes in its ...

#251 Flatten 2D Vector is the two-level version, and #173 Binary Search Tree Iterator uses the same lazy stack. Earlier in the ...

Packages with given weights must be shipped in order, within D days. Every day the ship carries as many packages as it can ...

Problem #349 of the Brute To Best series: Intersection of Two Arrays. Given two integer arrays nums1 and nums2, return their ...

Binary search on the answer is the pattern behind Koko Eating Bananas (LeetCode 875), and this video draws every step of it on ...

Every element in a sorted array appears exactly twice, except one. Find the one that appears once. We solve it three ways: ...

This is the general version of the mountain problem. The array can have several peaks, and a peak can be at the very start or the ...

Binary search finds the position, but inserting in the middle still costs O(n). A BST with subtree sizes can give O(n log n), but it ...

A mountain array strictly increases up to a peak and then strictly decreases. Find the index of the peak. In this video: Brute ...

BINARY SEARCH IN C++ | 30 DSA PROBLEMS | LOGINNLEARN Welcome to a complete **Binary Search in C++** ...

Koko has n piles of bananas and h hours before the guards come back. Each hour she picks one pile and eats up to k bananas ...

#23 Merge k Sorted Lists uses the same k-stream merge, and #1201 Ugly Number III switches to binary search. Earlier in the ...

Binary search on k, where k² is less than or equal to n, is a safe O(log n) alternative. Edge cases: n = 0 returns 0, n = 1 returns 1, ...

PROBLEM DESCRIPTION* Given the root of a binary tree, imagine yourself standing on the **right side** of it, return _the values ...