DSA-30 is now live!

DSA-30

GitHubGitHub
  • Home
  • Getting Started
    • TODO
    • Introduction
    • Practice Questions
    • TODO
    • Introduction
      • Basics
      • Basic Operations
        • Problem List
        • Reverse an Array
        • Find Kth Max and Min Element
        • Sort an Array without using Sorting Algorithm
        • Move Negative Elements to one side of the Array
      • Basics
      • Basic Operations
        • Problem List
    • TODO
    • Introduction
    • Singly Linked List
    • Circular Linked List
    • Doubly Linked List
    • Circular Doubly Linked List
      • Problem List
      • Middle of the Linked List
      • Linked List Cycle
      • Convert Binary Number in a Linked List to Integer
      • Remove Duplicates from Sorted List
      • Merge Two Sorted Lists
      • Multiply Two Numbers Represented as Linked Lists
      • Intersection of Two Linked Lists
      • Delete Node in a Linked List
      • Palindrome Linked List
    • TODO
    • Introduction
      • Basic Operations
      • Basic Operations
    • TODO
    • Introduction
    • Basic Questions
      • Problem List
    • TODO
    • Introduction
    • Basic Questions
      • Problem List
      • Balanced Binary Tree
      • Convert Sorted Array to Binary Tree
      • Same Tree
      • Symmetric Tree
    • TODO
    • Introduction
    • Basic Questions
      • Problem List
    • TODO
    • Introduction
    • Basic Questions
      • Problem List
    • TODO
    • Introduction
    • Basic Questions
      • Problem List
    • TODO
    • Introduction
    • Basic Questions
      • Problem List
    • Home
    • Getting Started
    • TODO
    • Introduction
    • Deep Dive
    • Basic Questions
      • Problem List
      • Search Insert Position
      • Search in Rotated Sorted Array
  • DSA-30

On This Page

  • Definition

DSA-30 is yet to be an open-source project. If you find a bug or want to suggest a feature, please mail me.

Edit this page
Day 7 - Heaps and Priority QueuesIntroduction

Heaps and Priority Queues

Definition

GIF
void func() {
    // Some code
    func(); // Function call
    // Some code
}
TODOBasic Questions

MIT 2026 © Nextra.