Heap

You are given an m x n matrix grid consisting of positive integers.

You are given an integer array nums, an integer k, and an integer multiplier.

You are given an integer array nums and an integer k.

You are given an array nums of n integers and two integers k and x.

You are given a positive integer num.

You are given an array of integers stones where stones[i] is the weight of the ith stone.

You are given a non-negative integer array nums.

You have a water dispenser that can dispense cold, warm, and hot water.

You are given a 0-indexed integer array nums of even length and there is also an empty array arr.

Given an array nums, you can perform the following operation any number of times: Return the minimum number of operations needed to make the array non-decreasing.

You are given an integer array score of size n, where score[i] is the score of the ith athlete in a competition.

You are given an integer array gifts denoting the number of gifts in various piles.

Your country has an infinite number of lakes.

There is a car with capacity empty seats.

There are n cities connected by some number of flights.

You are given two integer arrays, nums1 and nums2, both of length n, along with a positive integer k.

You are given a string s and an integer repeatLimit.

You are given a 0-indexed integer array nums.

Given a 2D integer array nums, return all elements of nums in diagonal order as shown in the below images.

You are given two integers n and m that consist of the same number of digits.

In a warehouse, there is a row of barcodes, where the ith barcode is barcodes[i].

You are given a 2D integer array intervals where intervals[i] = [lefti, righti] represents the inclusive interval [lefti, righti].

You are given an m x n binary matrix grid and an integer health.

Given a sorted integer array arr, two integers k and x, return the k closest integers to x in the array.

You are given two integer arrays nums1 and nums2 sorted in non-decreasing order and an integer k.

You are given a 2D matrix of size m x n, consisting of non-negative integers.

There is a dungeon with n x m rooms arranged as a grid.

There is a dungeon with n x m rooms arranged as a grid.

You are given an array nums consisting of positive integers.

You are given an array of strings nums and an integer k.

You are given a 0-indexed 2D matrix grid of size n x n, where (r, c) represents: You are initially positioned at cell (0, 0).

You are given an integer array heights representing the heights of buildings, some bricks, and some ladders.

You are given an m x n integer matrix grid​​​.

You are given a 0-indexed integer array nums and an integer k.

Given an array of points where points[i] = [xi, yi] represents a point on the X-Y plane and an integer k, return the k closest points to the origin (0, 0).

You are given a 0-indexed 2D integer array grid of size m x n that represents a map of the items in a shop.

There is an infinite 2D plane.

You are given a sorted integer array arr containing 1 and prime numbers, where all the integers of arr are unique.

Given an integer array nums and an integer k, return the kth largest element in the array.

Given an n x n matrix where each of the rows and columns is sorted in ascending order, return the kth smallest element in the matrix.

You are given a string s.

Given an array of integers nums and an integer limit, return the size of the longest non-empty subarray such that the absolute difference between any two elements of this subarray...

A string s is called happy if it satisfies the following conditions: Given three integers a, b, and c, return the longest possible happy string.

You are given a 0-indexed array nums of size n consisting of positive integers.

You are given a 0-indexed array nums consisting of positive integers.