CommVault Interview Questions, Process, and Tips for Freshers

Data structures were there for both the questions. Linked list and tree questions where asked

Long coding high level

Q1. Benefits and all only about the company
Add your answer

Round duration - 65 Minutes
Round difficulty - Hard

There were 15 MCQS you have to do in 25 Minutes and 3 Coding questions you have to do in 40 minutes. They also give a demo test link to get you use to the environment.

Q1. 
Sliding Maximum Problem Statement
Given an array of integers ARR of length 'N' and a positive integer 'K', find the maximum elements for each contiguous subarray of size K.
Example:
Input:
ARR = [3, 4,...read more
Ans. 
Find maximum elements for each subarray of size K in a given array of integers.
• Iterate through the array and maintain a deque to store the indices of elements in decreasing order.

• Pop elements from the deque if they are out of the current window.

• Keep track of the maximum element in each subarray of size K.
Answered by AI
Add your answer
Q2. 
Jump Game Problem Statement
In this problem, you are given an array ARR consisting of N integers. Your task is to determine the minimum number of jumps required to reach the last index of the array N - 1....read more
Ans. 
The problem involves finding the minimum number of jumps required to reach the last index of an array, where each element represents the maximum distance that can be jumped from that index.
• Start from index 0 and keep track of the farthest index that can be reached from each position.

• Update the current farthest index as the maximum of current farthest index and i + ARR[i].

• Increment the jump count when the current index ...read more
Answered by AI
Add your answer
Q3. 
Longest Palindromic Substring Problem Statement
You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...read more
Ans. 
Given a string, find the longest palindromic substring, prioritizing the one with the smallest start index.
• Iterate through the string and expand around each character to find palindromes

• Keep track of the longest palindrome found and its starting index

• Return the longest palindromic substring with the smallest start index
Answered by AI
View 2 more answers

Round duration - 180 Minutes
Round difficulty - Hard

It was more of Design + Data structure round. They give access to their server and ask us to do code there.

Round duration - 90 minutes
Round difficulty - Medium

It was a mcq+coding round. There were 2 coding questions of medium difficulty. It was around 3 P.M.

Q1. 
Count Substrings with K Distinct Characters
Given a lowercase string 'STR' and an integer K, the task is to count all possible substrings that consist of exactly K distinct characters. These substrings ar...read more
Ans. 
Count substrings with exactly K distinct characters in a given lowercase string.
• Iterate through all substrings of length K and count distinct characters.

• Use a set to keep track of distinct characters in each substring.

• Increment count if number of distinct characters equals K.
Answered by AI
Add your answer
Q2. 
Collect Maximum Coins from Matrix
You are provided with a matrix consisting of 'M' rows and 'N' columns. Each cell in this matrix either contains a coin or is empty.
Your task is to collect the maximum n...read more
Ans. 
Given a matrix with coins and empty cells, collect maximum coins from boundary cells and adjacent cells.
• Iterate through the boundary cells and collect coins from them and their adjacent cells

• Keep track of visited cells to avoid collecting the same coin multiple times

• Use depth-first search or breadth-first search to explore adjacent cells
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

It was held after the debugging round at around 1 PM. The interviewer briefed me about the problem and then asked me to code in visual studio code.

Q1. 
Optimize Memory Usage Problem Statement
Alex wants to maximize the use of 'K' memory spaces on his computer. He has 'N' different document downloads, each with unique memory usage, and 'M' computer games,...read more
Ans. 
Maximize memory usage by pairing downloads and games within memory limit 'K'.
• Sort the downloads and games in descending order.

• Iterate through the downloads and games to find the pairs within memory limit 'K'.

• Return the pairs that maximize memory usage.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Hard

It was immediately after the second interview round. Total 6 students were shortlisted from various colleges for this round. It was at around 4 PM. There were 2 interviewers and asked questions from OS, DBMS, DS and project related questions from resume.