Product Development Engineer
Mahindra Comviva
3 rounds | 5 Coding problems
0 views
Interview preparation journey
Preparation
Duration: 4 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip

Tip 1 : Prepare all your projects
Tip 2 : Daily practice of aptitude
Tip 3 : Practice previous years Company questions

Application process
Where: Campus
Eligibility: 6.5 CGPA
Resume tip

Tip 1 : Resume should contains only those skills that you know
Tip 3 : Resume should not be too long

Interview rounds
01
Round
Medium
Online Coding Interview
Duration150 minutes
Interview date6 Sep 2020
Problems2
Rotate array

#### Input Format:

``The first line...``
view more
Problem approach

After rotating d positions to the left, the first d elements become the last d elements of the array

First store the elements from index d to N-1 into the temp array.
Then store the first d elements of the original array into the temp array.
Copy back the elements of the temp array into the original array

#### If there are an odd n...

view more
Problem approach

Traverse linked list using two-pointers. Move one pointer by one and the other pointers by two. When the fast pointer reaches the end, the slow pointer will reach the middle of the linked list.

02
Round
Easy
Face to Face
Duration30 minutes
Interview date12 Sep 2020
Problems2
Remove Duplicates From an Unsorted Linked List

#### You are given a linked list of N nodes. Your task is to remove the duplicate nodes from the linked list such that every element in the linke...

view more
Problem approach

In general, Merge Sort is the best-suited sorting algorithm for sorting linked lists efficiently.
1) Sort the elements using Merge Sort. We will soon be writing a post about sorting a linked list. O(nLogn)
2) Remove duplicates in linear time using the algorithm for removing duplicates in sorted Linked List. O(n)
Please note that this method doesn’t preserve the origin...

view more
Reverse List In K Groups

#### You are given a linked list of 'N' nodes and an integer 'K'. You have to reverse the given linked list in groups of size K i.e if the lis...

view more
Problem approach

Consider every sub-array of size k starting from the beginning of the array and reverse it. We need to handle some special cases. If k is not multiple of n where n is the size of the array, for the last group we will have less than k elements left, we need to reverse all remaining elements. If k = 1, the array should remain unchanged. If k >= n, we reverse all elements present in the array.<...

view more
03
Round
Easy
HR Round
Duration30 minutes
Interview date11 Sep 2020
Problems1
Basic HR questions

Introduce yourself.

Do you have any other offer.

What would do if a person (is your friend) in your team is not working properly . Do you inform your manager about it?

Start a Discussion
Similar interview experiences
Product Development Engineer
4 rounds | 4 problems
Interviewed by Mahindra Comviva
336 views
SDE - 1
3 rounds | 9 problems
Interviewed by Mahindra Comviva
568 views
Product Development Engineer
2 rounds | 6 problems
Interviewed by Mahindra Comviva
0 views
Product Development Engineer
2 rounds | 3 problems
Interviewed by Mahindra Comviva
0 views
Companies with similar interview experiencs
Product Development Engineer
3 rounds | 4 problems
Interviewed by Comviva
420 views