60 docs tagged with "Binary Search"

This is a solution to the Binary Search problem on LeetCode.

This document provides a solution where we need to design a ticketing system that can allocate seats.

Problem Description

This is a solution to the Count Complete tree nodes

The problem no. is 1351. The Problem is Count Negative Numbers in a Sorted Matrix.

This is a solution to the Count of Range Sum problem on LeetCode

This is a solution to the Data Stream as Disjoint Intervals problem on LeetCode.

This is a solution to the Disconnect Path in a Binary Matrix by at Most One Flip problem on LeetCode.

This is a solution to the Find Beautiful Indices in the Given Array I problem on LeetCode.

Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value.

Given the sorted rotated array nums of unique elements, return the minimum element of this array.

Given the sorted rotated array nums of unique elements, return the minimum element of this array.

A peak element is an element that is strictly greater than its neighbors. Given a 0-indexed integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks. You may imagine that nums[-1] = nums[n] = -∞. In other words, an element is always considered to be strictly greater than a neighbor that is outside the array. You must write an algorithm that runs in O(log n) time.

This is a solution to the Find Right Interval problem on LeetCode.

Given an array of N + 1 size, where each element is between 1 and N. Assuming there is only one duplicate number, your task is to find the duplicate number.

This is a solution to the Find the Square Root problem on Geeks for Geeks.

This tutorial covers the solution to the Floor in a Sorted Array problem from the GeeksforGeeks website, featuring implementations in Python and C++.

This is a solution to the Frequency of the Most Frequent Element problem on LeetCode.

Calculate the total number of friend requests made between persons based on their ages, following specific conditions that determine when a friend request is not sent.

Solution to leetocde 374

This is the solution of question H-Index II on leetcode

This is a solution to the heaters problem on LeetCode.

This is a solution to the House Robber IV problem on LeetCode.

Solution to Leetcode 349. Intersection of Two Arrays

Solution to Leetcode 350. Intersection of Two Arrays II

This is a solution to the Koko Eating Bananas problem on LeetCode

This document provides a solution where we Find the kth ancestor of a given node.

This is a solution to the Kth Missing Positive Number problem on LeetCode.

This document provides a solution where we Return the $k^th$ smallest amount that can be made using these coins.

Find the last day where it is possible to walk from the top to the bottom of a binary matrix by only walking on land cells.

This is a solution to the Magnetic Force Between Two Balls problem on LeetCode.

This is a solution to the Maximize Win From Two Segments problem on LeetCode.

This document provides a solution where we Return an integer denoting the maximum number of groups you can create while satisfying these conditions.

This is a solution to the Maximum Number of Integers to Choose From a Range II problem on LeetCode.

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.

Given the sorted rotated array nums of unique elements, return the minimum element of this array.

Solution to Leetcode 2616. Minimize the Maximum Difference of Pairs

This is a solution to minimum common value in leetcode

Solution to Leetcode 2617. Minimum Number of Visited Cells in a Grid

Problem Description

This is a solution to the My Calendar I problem on LeetCode.

This document provides solutions for the Patching Array problem.

This is a solution to the Path With Minimum Effort problem on LeetCode.

Find the index of the peak element in a mountain array (an array that increases to a peak and then decreases) in O(log(n)) time complexity.

solution to the leetcode problem Random Pick With Weight.

The problem is to reverse the pairs.

Problem

This is a solution to the Search a 2D Matrix II problem on LeetCode.

Given the array nums after the rotation and an integer target, return true if target is in nums, or false if it is not in nums.

Problem Description

You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once. Return the single element that appears only once.

Problem Description

Given an image represented by a binary matrix where 0 is a white pixel and 1 is a black pixel, return the area of the smallest rectangle that encloses all black pixels. The black pixels are connected, and the rectangle must be axis-aligned.

This tutorial covers the solution to the Sorted Array Search problem from the GeeksforGeeks website.

This is a solution to the Split Array Largest Sum problem on LeetCode.

This document provides a solution where we split an array into two non-empty subsets such that both subsets have the same average.

This is a solution to the Sum of Square Numbers problem on LeetCode.

Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number.

Design and implement a TwoSum class.

Solution to Leetcode 1201. Ugly Number III