Revv Software Developer Interview Questions and Answers

Round duration - 45 minutes
Round difficulty - Easy

This round was telephonic round. The interview lasted for approximately 45 minutes. The interviewer asked me three coding questions. I hustled a bit on 3rd question but after a hint was able to solve it.

Round duration - 120 minutes
Round difficulty - Easy

This round was Online Test on Hackerrank for 120 minutes, it contained 3 questions.

Q1. 
LRU Cache Design Question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key) - Return the value of the key if it exists in the cache; otherw...read more
Ans. 
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
• Use a combination of hashmap and doubly linked list to implement the LRU cache.

• Keep track of the least recently used item and evict it when the cache reaches its capacity.

• Update the position of an item in the cache whenever it is accessed or updated.

• Handle both get and put operations efficiently to main...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This round was face to face Interview at Ola Campus and lasted for 1 hour.

Round duration - 35 minutes
Round difficulty - Easy

This round was again a face to face technical interview, I was just asked one question in this round.

Round duration - 30 minutes
Round difficulty - Easy

Only a question of System Design was asked

Q1. Design a toll booth system for Ola cabs and explain the necessary functions and data structures used in it.
Ans. 
Design a toll booth system for Ola cabs with necessary functions and data structures.
• Use a queue data structure to manage the order of vehicles waiting at the toll booth.

• Implement functions for vehicle entry, toll calculation, and exit.

• Store vehicle information such as license plate number, type of vehicle, and toll amount in a hash map.

• Utilize a priority queue to handle VIP or premium customers efficiently.

• Include a f...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Very general HR questions were asked

Round duration - 60 Minutes
Round difficulty - Medium

It was strictly a DSA round where 2 coding problems asked from me.

Q1. 
Distance To Nearest 1 in a Binary Matrix Problem
Given a binary matrix MAT containing only 0s and 1s of size N x M, find the distance of the nearest cell containing 1 for each cell in the matrix.
The dis...read more
Ans. 
Given a binary matrix, find the distance of the nearest cell having 1 in the matrix for each cell.
• Use BFS to traverse the matrix and find the nearest cell having 1 for each cell.

• Initialize the output matrix with maximum possible distance.

• If the current cell has 1, distance is 0, else update distance based on the nearest cell having 1.
Answered by AI
Add your answer
Q2. 
Arithmetic Subarrays Problem Statement
You are provided with an array A of length N. Your task is to determine the number of arithmetic subarrays present within the array A.
Explanation:
An arithmetic s...read more
Ans. 
Count the number of arithmetic subarrays in an array.
• An arithmetic subarray has 3 or more elements with the same difference between consecutive elements.

• Loop through the array and check for all possible subarrays with 3 or more elements.

• If the difference between consecutive elements is the same, increment the count.

• Return the count for each test case.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Again it was a DSA round.

Q1. 
Maximum Coins Collection Problem
Imagine a two-dimensional grid with 'N' rows and 'M' columns, where each cell contains a certain number of coins. Alice and Bob want to maximize the total number of coins ...read more
Ans. 
Given a matrix of coins, Alice and Bob have to collect maximum coins with certain conditions.
• Alice starts from top left corner and Bob starts from top right corner

• They can move to (i+1, j+1) or (i+1, j-1) or (i+1, j)

• They have to collect all the coins that are present at a cell

• If Alice has already collected coins of a cell, then Bob gets no coins if goes through that cell again
Answered by AI
Add your answer

Q1. It was regarding the tools and technologies we worked on. AWS services we worked on. How deployment happens.
Add your answer
Q2. What was the project you worked on.
Add your answer

One coding and other mcqs on CS concepts

Round duration - 60 minutes
Round difficulty - Medium

This was coding round and was conducted on Google meet with code link shared. Their were 2 interviewers that gave questions and later ran code on sample test cases.

Q1. 
Problem: Permutations of a String
Given a string STR consisting of lowercase English letters, your task is to return all permutations of the given string in lexicographically increasing order.
Explanatio...read more
Ans. 
Return all permutations of a given string in lexicographically increasing order.
• Use backtracking to generate all permutations of the string.

• Sort the permutations to get them in lexicographically increasing order.

• Ensure the string contains unique characters to avoid duplicate permutations.
Answered by AI
Add your answer
Q2. 
Find the Kth Row of Pascal's Triangle Problem Statement
Given a non-negative integer 'K', determine the Kth row of Pascal’s Triangle.
Example:
Input:
K = 2
Output:
1 1
Input:
K = 4
Output:
1 4 6 ...read more
Ans. 
The task is to find the Kth row of Pascal's Triangle given a non-negative integer K.
• Create an array to store the elements of the Kth row of Pascal's Triangle.

• Use the formula C(n, k) = C(n-1, k-1) + C(n-1, k) to calculate each element in the row.

• Return the array containing the Kth row of Pascal's Triangle.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

This was a Machine Coding Round/LLD round followed by HLD round which was taken by Video Conferencing and Screen Sharing.

Round duration - 60 minutes
Round difficulty - Easy

This was the last round. This was HM round followed by the HR round.

Q1. What is Closure
Ans. 
Closure is a function that captures the environment in which it was created, allowing it to access variables from that environment even after the function has finished executing.
• Closure allows a function to access variables from its outer scope even after the function has finished executing.

• It is created when a function is defined within another function and the inner function references variables from the outer functi...read more
Answered by AI
Add your answer
Q2. Flat nested array
Add your answer

Q1. Machine coding questions
Add your answer
Q2. Das based questions
Add your answer

Q1. Simple questions
Add your answer
Q2. Simple questions one on one
Add your answer

Codesignal Round : Implementation based 4 questions. Solved 2.5

Q1. Tell me about your self
Add your answer
Q2. You projects explaination
Add your answer