Kanchan Raikanchanraiii.hashnode.dev·Dec 10, 2024Day 21: 100 Days of DSAWelcome to Day 2 of my 100 Days of DSA challenge! Today, I solved five problems focused on arrays. Here's a quick look at the questions I tackled and how I approached them 🤖✨ Check out my GitHub repository for all my solutions and progress. Let’s ke...100 Days of DSAHeaps
Bonaventure OgetoforHojaLeaks Coding Tutorialshojaleaks.com·Oct 16, 2024Introduction to Heaps - Max Heap vs Min Heap [2024] Guide | Day #15Key Takeaways Learn what heaps are and their fundamental properties Master both Max Heap and Min Heap implementations Understand heap operations with O(log n) time complexity Implement heaps in Python and JavaScript Apply heaps to solve real-wor...10 likesData Structures and AlgorithmsHeaps
Rohit Gawanderohit253.hashnode.dev·Sep 4, 2024Chapter 32: HeapsIntroduction to Priority Queues and Heaps Introduction to Priority Queues (PQ) A Priority Queue (PQ) is a specialized type of queue where each element is assigned a priority. Elements with higher priority are processed before those with lower priorit...DSA(Data Structure and Algorithm) In JAVAapna college
Vineeth Chivukulavineethchivukula.hashnode.dev·Jul 11, 2024Solving Find Median from Data StreamTo see the question, click here. Naive Approach The idea is to store the elements in a list. At each stage of adding an element, we will sort the list because the elements may not be added to the list in a sorted fashion. // TC: O(nlogn) for addNum a...median
Vineeth Chivukulavineethchivukula.hashnode.dev·Jul 9, 2024Understanding Java Heaps for DSAIn Java, heaps are typically implemented using the PriorityQueue class, which is part of the java.util package. A heap is a specialized tree-based data structure that satisfies the heap property. The PriorityQueue class provides an implementation of ...Heaps
Vineeth Chivukulavineethchivukula.hashnode.dev·Jun 25, 2024Understanding Two HeapsTwo Heaps is a pattern used to solve problems that involve maintaining a dynamic set of elements with the ability to find the median, the smallest or largest elements efficiently, or to balance two sets of elements. This pattern typically involves us...heap
![Introduction to Heaps - Max Heap vs Min Heap [2024] Guide | Day #15](https://cdn.hashnode.com/res/hashnode/image/upload/v1728042094371/9fb67c96-0eaf-49c2-96c2-6f24552b689e.png?w=1600&h=840&fit=crop&crop=entropy&auto=compress,format&format=webp)
