13 docs tagged with "Heap"

There are n different online courses numbered from 1 to n...

You are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k.

The median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value, and the median is the mean of the two middle values.

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).

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.

Design a stack-like data structure to push elements to the stack and pop the most frequent element from the stack.

You are given an array of k linked-lists lists, each linked-list is sorted in ascending order.

Given a string s, rearrange the characters of s so that any two adjacent characters are not the same.

The median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle values.

Smallest Range Covering Elements from K Lists

Given a string s, sort it in decreasing order based on the frequency of the characters. The frequency of a character is the number of times it appears in the string.

Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order.