Emirates NBD Technology Consultant Interview Questions and Answers

3 questions - DFS, Greedy and Priority Queue

Q1. Implement max heap, basically how priority queue is implemented
Ans. 
Max heap is a data structure where the parent node is always greater than or equal to its child nodes.
• Start by creating an array to store the elements of the max heap.

• Insert elements into the array and maintain the heap property by swapping elements if necessary.

• Implement functions like insert, extractMax, and heapify to maintain the max heap structure.

• Example: If we have elements 10, 7, 15, 3, 8, the max heap would be
Answered by AI
Add your answer
Q2. Question on my projects and DBMS
Add your answer

Q1. Find second largest number in an array.
Ans. 
Find the second largest number in an array of strings.
• Convert the array of strings to an array of integers.

• Sort the array in descending order.

• Return the second element in the sorted array.
Answered by AI
Add your answer
Q2. Find missing number
Add your answer

Q1. General HR questions
Add your answer
Q2. My future goals
Add your answer