CommVault Interview Questions, Process, and Tips

Q1. Basic questions on JavaScript and React
Add your answer

Problem solving and JavaScript conceptual implementation

Q1. Coding with behavior
Add your answer

Q1. Design a multithreaded logger system
Ans. 
A multithreaded logger system allows multiple threads to log messages concurrently without blocking each other.
• Use a thread-safe data structure like a concurrent queue to store log messages.

• Implement a logging class with methods for adding log messages and writing them to a file.

• Use synchronization mechanisms like locks or semaphores to ensure thread safety.

• Consider using a separate thread for writing log messages to t...read more
Answered by AI
Add your answer
Q2. How virtual pointers work?
Ans. 
Virtual pointers are used in C++ to implement polymorphism by allowing objects to be accessed through a base class pointer.
• Virtual pointers are used in C++ to achieve runtime polymorphism.

• They are created by adding virtual keyword to a function in a base class.

• Virtual pointers allow objects of derived classes to be accessed through a base class pointer.
Answered by AI
Add your answer

Standard question on linked list and tres

Long coding test for system test lld

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.

Q1. In first round you will be asked about the projects and then followed by a debugging round where you have to find out the bugs in the given program
Add your answer
Q2. Given a program and its expected functionality asked to find the bugs in that program
Add your answer

You will be given a coding problem and 1 hour of time to solve it end to end

Q1. Basic hr questions
Add your answer
Q2. Where do you see yourself in 5 years
Add your answer

Build a slider fuctinality