Comviva Technology Software Developer Interview Questions and Answers

Round duration - 150 minutes
Round difficulty - Medium

In this round, there were 4 sections of MCQs, along with two coding questions. It lasted for 2.5 hours in which the camera was on along with the microphone on the platform AMCAT. One coding question was of hard difficulty level of graph and another was of medium level difficulty question of dynamic programming. MCQ part was quite easy with a timer, on each sub part and can be easily solved.

Q1. 
Count Nodes within K-Distance Problem Statement
Given a connected, undirected, and acyclic graph where some nodes are marked and a positive integer 'K'. Your task is to return the count of nodes such that...read more
Add your answer
Q2. 
Ways To Make Coin Change
Given an infinite supply of coins of each denomination from a list, determine the total number of distinct ways to make a change for a specified value. If making the change isn't ...read more
Ans. 
Given coin denominations and a target value, find the total number of ways to make change.
• Use dynamic programming to keep track of the number of ways to make change for each value up to the target value.

• Iterate through each denomination and update the number of ways to make change for each value.

• Handle base cases such as making change for 0 value.

• Consider all possible combinations of denominations to make change for th...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

There were around 40 people shortlisted after round 1, for the interview, round, in the morning PPT was held, after which the interviews were scheduled, for 30 minutes till 6 pm in the evening, 
my interview was at 4.30 pm 
Interviewer was straight forward, and direct in approach, and did not waste even a single second of his or mine. Sharp after 30 minutes the interview was ended. 
through out the interview, he was friendly, and just observing.
Firstly, 3 coding questions, were asked, then 2 concepts of java and 1 concept of data structures was asked. 
the question related to java were, demon thread and platform independence. In data structures, I was asked to give brief intro regarding the AVL trees.

Q1. 
Count Occurrences of X in Sorted Array
Given a sorted array or list of integers with size N and an integer X, you need to determine how many times X appears in the array/list.
Input:
The first line of t...read more
Ans. 
Count occurrences of a given integer in a sorted array.
• Use binary search to find the first and last occurrence of X in the array.

• Calculate the count by subtracting the indices of the last and first occurrences.

• Handle cases where X is not present in the array.
Answered by AI
Add your answer
Q2. 
Merge Sort Task
Given a sequence of numbers, denoted as ARR, your task is to return a sorted sequence of ARR in non-descending order using the Merge Sort algorithm.
Example:
Explanation:
The Merge Sort...read more
Ans. 
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
• Divide the input array into two halves recursively until each part has a size of '1'.

• Merge the sorted arrays to return one fully sorted array.

• Time complexity of Merge Sort is O(n log n).
Answered by AI
Add your answer
Q3. 
Implement Stack with Linked List
Your task is to implement a Stack data structure using a Singly Linked List.
Explanation:
Create a class named Stack which supports the following operations, each in O(1...read more
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

The interview was scheduled at 4.30 pm again, and due to network issue, my audio was not clear to the interviewer, but the interviewer was highly cooperating, he called me over phone to take the interview, and video was on through the zoom meet only. 
The interview was like a discussion from both ends, which went very satisfying for me as a candidate and the interviewer too.
Before the interview in the morning, we were given the topics on which we had to write 100 words.

Q1. Give me a brief introduction.
Add your answer