Optym Algorithm Engineer Interview Questions and Answers

2 easy, 1 medium and 1 hard DSA question

Q1. Implement Priority Queue
Ans. 
Priority Queue is a data structure that stores elements based on their priority.
• Use a binary heap to implement a Priority Queue.

• Elements are inserted based on priority and removed in order of priority.

• Example: Inserting elements with priorities 5, 3, 7, 1 would result in removal order of 1, 3, 5, 7.
Answered by AI
Add your answer
Q2. Leetcode easy question on heaps.
Add your answer