• cs interview
  • Introduction
  • Java
    • Multithreading
      • Joining Threads
      • Synchronized
      • Producer-Consumer
    • static vs non static
    • JVM
    • JDK vs JRE vs JVM
    • JIT compiler
    • Garbage Collection
      • Ways to make an object eligible for GC
      • Island of Isolation
    • Spring
      • Dependency Injection
      • Requestbody vs Requestparam
    • Generic
    • Pass by Value
  • Data Structure
    • LinkedList vs ArrayList vs Vector
    • HashMap vs HashTable
    • Implement a HashMap
    • Heap
    • HashMap vs TreeMap
  • Algorithm
    • Two Pointers
      • No.15 3sum
    • Backtracking
    • Linked List
      • No.141 Linked List Cycle
      • No.206 Reverse Linked List
    • Math
      • No.319 Bulb Switcher
    • DFS
      • 339.Nested List Weight Sum
  • Database
    • ACID
    • optimistic locking vs pessimistic locking
    • inner join vs outer join
    • primary key vs foreign key
    • write through vs write behind
    • index
    • MongoDB
      • Create and Drop Database
      • Spring MongoDB
  • OOP
    • Interface vs Abstract Class
    • Polymorphism
    • Inheritance vs Composition
  • Operating System
    • deadlock
    • context switch
    • process vs thread
  • Behavior Questions
    • 1. Why do you fit this position ?
  • Design Pattern
Powered by GitBook

Heap

How do I use a priorityqueue in Java

https://stackoverflow.com/questions/683041/how-do-i-use-a-priorityqueue

How can building a heap be O(n) time complexity?

https://stackoverflow.com/questions/9755721/how-can-building-a-heap-be-on-time-complexity

results matching ""

    No results matching ""