Open In App

Nutanix Interview Experience | Set 4

Improve
Improve
Like Article
Like
Save
Share
Report

Round 1: 3 Questions

Q1. https://www.geeksforgeeks.org/program-for-nth-fibonacci-number/

Q2. Broadcast Tree Algorithm and its order given at

http://mpitutorial.com/tutorials/mpi-broadcast-and-collective-communication/No code for it.

Q3. Given an array of billion of numbers. Billions of queries are generated with parameters as starting and an ending index. Both these indices lie within that array. Find the maximum number between these two indices in less than O(N).


Last Updated : 31 Mar, 2023
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads