I applied through college or university. The process took 2 days. I interviewed at Commvault (Bengaluru) in Aug 2023
Interview
1. An online coding round, with 3 DP problems and 12 MCQs 2. 8 hour long coding challenge, based on system design, operating systems and Data structures and algorithms 3. Technical Interview 4. H R interview
Interview questions [1]
Question 1
1. OS based design of a process scheduling algorithm with memory management and paging.
I applied through other source. The process took 3 days. I interviewed at Commvault (Bengaluru) in Feb 2023
Interview
It was an interview on Geek Assess platform, the platform is very difficult to get used you You will not be shown any terminal output or errors in your code, you must write error free code for complex problems I knew all three problems, but couldnt even complete one properly, simply because the interface took alot of getting used to Do cpp pointers very very thoroughly, every single question used pointers in some funny way or the other
Interview questions [1]
Question 1
Maximum distance between two given nodes in a Binary Tree
I applied through college or university. The process took 1 week. I interviewed at Commvault (Chittoor)
Interview
Campus placement - I appeared in the Online Test of Commvault. 15 MCQ questions in 25 Minutes. 3 Coding Questions in 40 minutes. Standard Leetcode Medium-Hard questions and less time alloted.
Interview questions [1]
Question 1
Q1. Alternate Reversing of a batch of size n in a linked list. A linked list is given and a value 'm' is given. You have to reverse first m elements then leave m elements as it is then reverse the next m elements and so on till the end. Q2. DP Question - A number line and a number n (target) is given and we start from 0. In the kth step, we can go k step back or forward. We have to reach 'n' in minimum steps. Q3. In this question, two numbers 'n' and 'k' are given. We have to find number of n size arrays in which value at 'i+1' index is greater or equal to two times of value at 'i'.