https://www.dincerbakkal.com/tags/heap/ Recent content in Heap on Dinçer Bakkal Hugo -- gohugo.io en-US This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. Mon, 02 Aug 2021 19:12:05 +0300 https://www.dincerbakkal.com/posts/leetcode767/ Mon, 02 Aug 2021 19:12:05 +0300 https://www.dincerbakkal.com/posts/leetcode767/ Return any possible rearrangement of s or return "" if not possible. Input: s = "aab" Output: "aba" Input: s = "aaab" Output: "" We use max heap to solve this question. We need to calculate the frequence of each letter. The we store the letter and frequence as pair based on its frequence in max heap and we pop the first letter and frequence pair from heap as the pre pair and append the letter to result string. https://www.dincerbakkal.com/posts/leetcode215/ Sun, 01 Aug 2021 19:12:05 +0300 https://www.dincerbakkal.com/posts/leetcode215/ Note that it is the kth largest element in the sorted order, not the kth distinct element. Input: nums = [3,2,1,5,6,4], k = 2 Output: 5 Input: nums = [3,2,3,1,2,4,5,5,6], k = 4 Output: 4 You can build a heap from input array and pop the heap until there k element left. Building heap is taking O(nlogn) time complexity. def findKthLargest(self, nums: List[int], k: int) -> int: heapq.heapify(nums) amount = len(nums) while amount > k: heapq. https://www.dincerbakkal.com/posts/leetcode451/ Thu, 29 Jul 2021 19:12:05 +0300 https://www.dincerbakkal.com/posts/leetcode451/ Return the sorted string. If there are multiple answers, return any of them. Input: s = "tree" Output: "eert" Explanation: 'e' appears twice while 'r' and 't' both appear once. So 'e' must appear before both 'r' and 't'. Therefore "eetr" is also a valid answer. Input: s = "cccaaa" Output: "aaaccc" Explanation: Both 'c' and 'a' appear three times, so both "cccaaa" and "aaaccc" are valid answers. Note that "cacaca" is incorrect, as the same characters must be together. https://www.dincerbakkal.com/posts/leetcode347/ Wed, 28 Jul 2021 19:12:05 +0300 https://www.dincerbakkal.com/posts/leetcode347/ Soru Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order. Örnek 1 Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,2] Örnek 2 Input: nums = [1], k = 1 Output: [1] Çözüm First we need count the appearence for each element store it in dictionary. Then we iterate the dictionary, and push the value-key pair (or count-value pair) into heap, if the the heap length less than k. https://www.dincerbakkal.com/posts/leetcode973/ Tue, 27 Jul 2021 19:12:05 +0300 https://www.dincerbakkal.com/posts/leetcode973/ The distance between two points on the X-Y plane is the Euclidean distance (i.e., √(x1 - x2)2 + (y1 - y2)2). You may return the answer in any order. The answer is guaranteed to be unique (except for the order that it is in). Input: points = [[1,3],[-2,2]], k = 1 Output: [[-2,2]] Explanation: The distance between (1, 3) and the origin is sqrt(10). The distance between (-2, 2) and the origin is sqrt(8). https://www.dincerbakkal.com/posts/leetcode621/ Wed, 07 Jul 2021 19:12:05 +0300 https://www.dincerbakkal.com/posts/leetcode621/ Given a characters array tasks, representing the tasks a CPU needs to do, where each letter represents a different task. Tasks could be done in any order. Each task is done in one unit of time. For each unit of time, the CPU could complete either one task or just be idle. However, there is a non-negative integer n that represents the cooldown period between two same tasks (the same letter in the array), that is that there must be at least n units of time between any two same tasks. https://www.dincerbakkal.com/posts/leetcode373/ Fri, 02 Jul 2021 19:12:05 +0300 https://www.dincerbakkal.com/posts/leetcode373/ You are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k. Define a pair (u, v) which consists of one element from the first array and one element from the second array. Return the k pairs (u1, v1), (u2, v2), …, (uk, vk) with the smallest sums. Input: nums1 = [1,7,11], nums2 = [2,4,6], k = 3 Output: [[1,2],[1,4],[1,6]] Explanation: The first 3 pairs are returned from the sequence: [1,2],[1,4],[1,6],[7,2],[7,4],[11,2],[7,6],[11,4],[11,6] Input: nums1 = [1,1,2], nums2 = [1,2,3], k = 2 Output: [[1,1],[1,1]] Explanation: The first 2 pairs are returned from the sequence: [1,1],[1,1],[1,2],[2,1],[1,2],[2,2],[1,3],[1,3],[2,3] and let’s say k=3 https://www.dincerbakkal.com/posts/leetcode378/ Fri, 21 May 2021 20:12:05 +0300 https://www.dincerbakkal.com/posts/leetcode378/ Given an n x n matrix where each of the rows and columns are sorted in ascending order, return the kth smallest element in the matrix. Note that it is the kth smallest element in the sorted order, not the kth distinct element. Input: matrix = [[1,5,9],[10,11,13],[12,13,15]], k = 8 Output: 13 Explanation: The elements in the matrix are [1,5,9,10,11,12,13,13,15], and the 8th smallest number is 13 Input: matrix = [[-5]], k = 1 Output: -5 Use Heap to solve the question.