Articles by Tag #binarysearch
Browse our collection of articles on various topics related to IT technologies. Dive in and explore something new!
Making binary search slower
Experience the power of binary search with a creative twist! By adding a 1-second delay per iteration, this post visualizes how the algorithm efficiently narrows down massive datasets, making its logarithmic scaling tangible. Perfect for learners and educators!
Off-by-1 again in your LeetCode binary search solution?
“Although the basic idea of binary search is straightforward, the details are surprisingly...
Understanding Binary Search: A Powerful Algorithm for Efficient Searching
Introduction Binary search is an efficient algorithm used to find an element in a sorted array or...
Linear Search vs. Binary Search: A Practical Guide in Go
Hello, in this post I am going to talk about different types of search algorithms. In essence, I am...
Binary Search
Median of two sorted arrays class Solution { public double findMedianSortedArrays(int[] nums1,...
Two best non overlapping events
Problem Recursive approach: leading to TLE TC: O(2^n) exponential, since at every max() call we have...
Segment Tree-01
Segment Tree-1 Segment Tree: Overview of what a Segment Tree is and its importance in data...
Minimum Time to repair cars
Problem TC: O(nlog(k)), where k is the max time in the range between 1 to r*n^2 class Solution { ...
Pattern 5: Binary Search
List of problems I have solved so far Easy Medium Hard List of problems I have...
Maximum Candies Allocated to K Children
Problem //same as coco eating bananas, //capacity to ship packages within d days //aggresive...
House Robber IV
Problem TC: O(nlog(Max(nums))) class Solution { public int minCapability(int[] nums, int k)...