Rivigo Interview Experience | Set 1 (On Campus - Software Developer)
Question Details
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 questi...
Full Details
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 https://stackoverflow.com/questions/29236837/find-max-sum-of-elements-in-an-array-with-twist https://www.geeksforgeeks.org/dsa/longest-palindromic-subsequence-dp-12/ https://www.geeksforgeeks.org/dsa/given-an-array-of-numbers-arrange-the-numbers-to-form-the-biggest-number/ 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: 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. 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 2i+1 & 2i+2, here the children will be ki+1, ki+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. :)
About This Question
This is a reported interview question from a rivigo interview for a swe role (intern level) during the oa round reported in 2025.
It covers the following topics: Trees, Dynamic Programming, Binary Tree, Recursion, Arrays .
Difficulty rating: Easy
More Rivigo Interview Questions
About Rivigo Interview Reports
This question was reported by a candidate who interviewed at Rivigo. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.
Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Rivigo are the higher-signal extractions to take from this report.
For broader preparation context, the Rivigo interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.
How To Practice This Type of Question
Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.
Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Rivigo reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Rivigo Round
Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.
The single most predictive failure mode in Rivigo reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.