Open In App
Related Articles

Rivigo Interview Experience | Set 1 (On Campus – Software Developer)

Improve Article
Save Article
Like Article
Rivigo came at IIT Roorkee for Software Developer Profile on Day1.
Online Test:
Test was conducted on hackerrank. 4 coding questions 90 minutes. I remember 3 out of 4 questions


I gave 3 technical interviews. Most of the questions were easy. Some questions were based on my internship.

No HR interview.
Here are a couple of questions from the interview that I remember:

  1.  Find the second minimum element in an array? It can easily be done by using 2n comparisons but they asked me to reduce the number of comparisons. It can be done in (n+logn) comparisons. (n/2 + n/4 + n/8 +…..) = n comparisons to find the minimum element in the array (divide and conquer approach) ,logn comparisons to find the second minimum.
  2.  You are given a k-ary tree. Each node can have less than or equal to k children. Store the tree in an array such that you can create the tree back from the array. Just like a binary tree where the children are 2*i+1 & 2*i+2, here the children will be k*i+1, k*i+2,…,k*i+k. I was asked to write a working code for all the questions they asked.

Revise all data structures and algorithms. Also, whatever you write in your resume, be thorough with it. 🙂

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above

Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated : 05 Dec, 2016
Like Article
Save Article
Similar Reads
Complete Tutorials