Filter interviews by
Clear (1)
I applied via LinkedIn and was interviewed in Aug 2024. There was 1 interview round.
OOPs concept stands for Object-Oriented Programming, a programming paradigm based on the concept of objects.
OOPs focuses on creating objects that contain data in the form of attributes and code in the form of methods.
Encapsulation, Inheritance, Polymorphism, and Abstraction are the four main principles of OOPs.
Example: In a banking system, a 'Customer' object can have attributes like name and account number, and method
Pillars of OOPs are Inheritance, Encapsulation, Polymorphism, and Abstraction. Data science involves analyzing and interpreting complex data. ACID stands for Atomicity, Consistency, Isolation, Durability.
Pillars of OOPs: Inheritance, Encapsulation, Polymorphism, Abstraction
Data science: Analyzing and interpreting complex data to gain insights
ACID: Atomicity, Consistency, Isolation, Durability
I applied via Walk-in
I applied via Approached by Company and was interviewed before Jul 2022. There were 3 interview rounds.
Own platform on string based problem
Comviva Technology interview questions for designations
I was interviewed in Sep 2020.
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.
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...
Count nodes within K-distance from marked nodes in a connected, undirected, acyclic graph.
Create an adjacency list to represent the graph.
Use BFS to traverse the graph and calculate distances from marked nodes.
Keep track of visited nodes and distances to avoid revisiting nodes.
Return the count of nodes with distances less than 'K' from all marked nodes.
Handle edge cases like empty graph or marked nodes.
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 ...
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
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.
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.
The first line of t...
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.
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.
The Merge Sort...
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).
Your task is to implement a Stack data structure using a Singly Linked List.
Create a class named Stack
which supports the following operations, each in O(1...
Implement a Stack data structure using a Singly Linked List with operations in O(1) time.
Create a class named Stack with getSize, isEmpty, push, pop, and getTop methods.
Use a Singly Linked List to store the elements of the stack.
Ensure each operation runs in O(1) time complexity.
Handle edge cases like empty stack appropriately.
Example: For input '5 3 10 5 1 2 4', the output should be '10 1 false'.
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.
Tip 1 : Solve all the question with Microsoft, Amazon tags on geeksforgeeks.
Tip 2 : Never give up during the interview, rather just keep trying whether you reach the solution or not.
Tip 3 : Be confident, this is the most important requirement.
Tip 1 : Claim the things, that you have done in actual by your own.
Tip 2 : Never write any false information on the resume, always get it verified with your mates.
Get interview-ready with Top Comviva Technology Interview Questions
Top trending discussions
I applied via Company Website and was interviewed before May 2020. There was 1 interview round.
I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before May 2021. There were 4 interview rounds.
VERBAL QUANT DI/LR and Picture based test
Fibonacci series can be easily implemented using loops in C++ or C.
Declare variables for first two numbers of the series
Use a loop to calculate and print the next number in the series
Repeat the loop until desired number of terms are printed
I applied via Walk-in and was interviewed in Nov 2020. There were 3 interview rounds.
based on 4 interviews
Interview experience
based on 22 reviews
Rating in categories
Technical Lead
401
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Engineer
348
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
315
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Technical Lead
210
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
198
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Wipro
Infosys
Tech Mahindra