Commvault interview experience Real time questions & tips from candidates to crack your interview

SDE - Intern

Commvault
upvote
share-icon
2 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 6 Months
Topics: Data Structures, Algorithms, OOPS, DBMS, OS, DP
Tip
Tip

Tip 1 : Do as much as coding question you can do.
Tip 2 : Do some projects also.
Tip 3 : Revise and clear your basic concepts too.

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1 : Mention only things related to job profile only.
Tip 2 : Make it page pager.

Interview rounds

01
Round
Hard
Online Coding Interview
Duration65 Minutes
Interview date10 Feb 2022
Coding problem3

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.

1. Sliding Maximum

Moderate
25m average time
85% success
0/80
Asked in companies
AmazonAmerican ExpressSquadstack

You are given an array 'ARR' of integers of length 'N' and a positive integer 'K'. You need to find the maximum elements for each and every contiguous subarray of size K of the array.

For example
'ARR' =  [3, 4, -1, 1, 5] and 'K' = 3
Output =  [4, 4, 5]

Since the maximum element of the first subarray of length three ([3, 4, -1]) is 4, the maximum element of the second subarray of length three ([4, -1, 1]) is also 4 and the maximum element of the last subarray of length three ([-1, 1, 5]) is 5, so you need to return [4, 4, 5]. 
Problem approach

It was a standard problem so I know the exact solution, you can simply use dequeue + two pointers to solve this questions.

Try solving now

2. Jump Game

Moderate
15m average time
85% success
0/80
Asked in companies
Deutsche BankGoldman SachsAmazon

You have been given an array 'ARR' of ‘N’ integers. You have to return the minimum number of jumps needed to reach the last index of the array i.e ‘N - 1’.


From index ‘i’, we can jump to an index ‘i + k’ such that 1<= ‘k’ <= ARR[i] .


'ARR[i]' represents the maximum distance you can jump from the current index.


If it is not possible to reach the last index, return -1.


Note:
Consider 0-based indexing.
Example:
Consider the array 1, 2, 3, 4, 5, 6 
We can Jump from index 0 to index 1
Then we jump from index 1 to index 2
Then finally make a jump of 3 to reach index N-1

There is also another path where
We can Jump from index 0 to index 1
Then we jump from index 1 to index 3
Then finally make a jump of 2 to reach index N-1

So multiple paths may exist but we need to return the minimum number of jumps in a path to end which here is 3.
Problem approach

I did it by using DP, again it was a standard problem.

Try solving now

3. Longest Palindromic Substring

Moderate
20m average time
80% success
0/80
Asked in companies
SAP LabsGoldman SachsAcko

You are given a string 'str' of length 'N'.


Your task is to return the longest palindromic substring. If there are multiple strings, return any.


A substring is a contiguous segment of a string.


For example :
str = "ababc"

The longest palindromic substring of "ababc" is "aba", since "aba" is a palindrome and it is the longest substring of length 3 which is a palindrome. 

There is another palindromic substring of length 3 is "bab". Since starting index of "aba" is less than "bab", so "aba" is the answer.
Problem approach

I solve it by using dp in O(n^2) time complexity.

Try solving now
02
Round
Hard
Video Call
Duration180 Minutes
Interview date23 Feb 2022
Coding problem1

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

1. Design Question

They give a predefined file system project in which we have to write functionalities like to create/move/delete/copy a file. I have to use predefined classes to write my functionalities and build the file structure. They also ask to maintain multiple versions and restoring them for the same file.

Problem approach

I made tree type data structure to build the file system but only able to write create and delete functionalities in the given time.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Which SQL clause is used to specify the conditions in a query?

Choose another skill to practice
Similar interview experiences
company logo
Fullstack Developer
4 rounds | 4 problems
Interviewed by Commvault
1835 views
0 comments
0 upvotes
company logo
SDE
4 rounds | 5 problems
Interviewed by Commvault
6734 views
0 comments
0 upvotes
company logo
SDE - 1
5 rounds | 8 problems
Interviewed by Commvault
1743 views
0 comments
0 upvotes
company logo
Associate Engineer
3 rounds | 7 problems
Interviewed by Commvault
2022 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
15520 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
15387 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
10166 views
2 comments
0 upvotes