Filter interviews by
Boosting algorithms improve model accuracy by combining weak learners into a strong learner through sequential training.
AdaBoost: Adjusts weights of misclassified instances to focus on difficult cases.
Gradient Boosting: Optimizes a loss function by adding weak learners sequentially.
XGBoost: An efficient implementation of gradient boosting with regularization to prevent overfitting.
LightGBM: A gradient boosting fra...
Pandas loc is label-based indexing, while iloc is integer-based indexing for selecting data in DataFrames.
loc uses row and column labels for selection. Example: df.loc[0, 'column_name']
iloc uses integer positions for selection. Example: df.iloc[0, 1]
loc can accept boolean arrays for filtering. Example: df.loc[df['column_name'] > 10]
iloc only accepts integer indices. Example: df.iloc[0:5] selects the first five ...
This function checks if a number is prime by testing divisibility from 2 to the square root of the number.
A prime number is greater than 1 and has no divisors other than 1 and itself.
To check if a number n is prime, test divisibility from 2 to sqrt(n).
If n is divisible by any number in this range, it is not prime.
Example: 5 is prime (divisors: 1, 5), while 4 is not (divisors: 1, 2, 4).
This function calculates and prints the sum of all possible subarrays of a given list.
A subarray is a contiguous part of an array.
The function iterates through all possible starting points of subarrays.
For each starting point, it calculates the sum of subarrays ending at each subsequent index.
Example: For array [1, 2, 3], subarrays are [1], [1,2], [1,2,3], [2], [2,3], [3]. Their sums are 1, 3, 6, 2, 5, 3.
The time ...
Extract highest scores and calculate growth for students across subjects over two years.
Use a data structure (like a DataFrame) to store student names, subjects, and scores.
Group data by student and subject to find the maximum score for each subject.
Example: If Student A has scores [80, 90, 85, 70, 95] in subjects [Math, Science, English, History, Art], the highest score is 95 in Art.
For growth calculation, compar...
Find the first character that repeats in a given string.
Iterate through the string and keep track of characters seen so far.
If a character is already seen, return it as the first repeating character.
If no repeating character is found, return null.
Inheritance is a mechanism in OOP where a new class is derived from an existing class.
Allows for code reusability and saves time
Derived class inherits properties and methods of base class
Can override base class methods in derived class
Can have multiple levels of inheritance
Example: class Dog extends Animal {}
SQL queries can be written to manipulate and retrieve data from two related tables.
Use JOIN to combine data from both tables. Example: SELECT * FROM table1 JOIN table2 ON table1.id = table2.foreign_id;
Use WHERE clause to filter results. Example: SELECT * FROM table1 WHERE condition;
Use GROUP BY to aggregate data. Example: SELECT column, COUNT(*) FROM table1 GROUP BY column;
Use INSERT to add new records. Example: I...
OOP concepts include encapsulation, inheritance, polymorphism, and abstraction, essential for structured programming.
Encapsulation: Bundling data and methods. Example: class `Car` with properties like `speed` and methods like `accelerate()`.
Inheritance: Deriving new classes from existing ones. Example: `class SportsCar(Car)` inherits properties and methods from `Car`.
Polymorphism: Using a single interface to repre...
Normalization is the process of organizing data in a database to reduce redundancy and dependency.
1NF (First Normal Form) - Each column in a table must have atomic values.
2NF (Second Normal Form) - A table must be in 1NF and all non-key attributes must be dependent on the primary key.
3NF (Third Normal Form) - A table must be in 2NF and all non-key attributes must be independent of each other.
4NF (Fourth Normal For...
Boosting algorithms improve model accuracy by combining weak learners into a strong learner through sequential training.
AdaBoost: Adjusts weights of misclassified instances to focus on difficult cases.
Gradient Boosting: Optimizes a loss function by adding weak learners sequentially.
XGBoost: An efficient implementation of gradient boosting with regularization to prevent overfitting.
LightGBM: A gradient boosting framewor...
Pandas loc is label-based indexing, while iloc is integer-based indexing for selecting data in DataFrames.
loc uses row and column labels for selection. Example: df.loc[0, 'column_name']
iloc uses integer positions for selection. Example: df.iloc[0, 1]
loc can accept boolean arrays for filtering. Example: df.loc[df['column_name'] > 10]
iloc only accepts integer indices. Example: df.iloc[0:5] selects the first five rows.
This function checks if a number is prime by testing divisibility from 2 to the square root of the number.
A prime number is greater than 1 and has no divisors other than 1 and itself.
To check if a number n is prime, test divisibility from 2 to sqrt(n).
If n is divisible by any number in this range, it is not prime.
Example: 5 is prime (divisors: 1, 5), while 4 is not (divisors: 1, 2, 4).
This function calculates and prints the sum of all possible subarrays of a given list.
A subarray is a contiguous part of an array.
The function iterates through all possible starting points of subarrays.
For each starting point, it calculates the sum of subarrays ending at each subsequent index.
Example: For array [1, 2, 3], subarrays are [1], [1,2], [1,2,3], [2], [2,3], [3]. Their sums are 1, 3, 6, 2, 5, 3.
The time compl...
Extract highest scores and calculate growth for students across subjects over two years.
Use a data structure (like a DataFrame) to store student names, subjects, and scores.
Group data by student and subject to find the maximum score for each subject.
Example: If Student A has scores [80, 90, 85, 70, 95] in subjects [Math, Science, English, History, Art], the highest score is 95 in Art.
For growth calculation, compare sco...
Clocks and calendars
Puzzles
Coding and decoding
Blood relations
Seating arrangements
Cause and effect
Series completion
Binary logic
I appeared for an interview before May 2024, where I was asked the following questions.
I applied via Campus Placement and was interviewed in May 2022. There were 2 interview rounds.
Find the first character that repeats in a given string.
Iterate through the string and keep track of characters seen so far.
If a character is already seen, return it as the first repeating character.
If no repeating character is found, return null.
I appeared for an interview in Oct 2020.
Round duration - 100 minutes
Round difficulty - Medium
It basically consisted of a 2hr test(approx) on AMCAT. The test consisted of 2 coding question and 20 questions of quantitative, reasoning and technical question based on DBMS, DS and small C coding.
You are given an array ARR
of long type, which represents an elevation map where ARR[i]
denotes the elevation of the ith
bar. Calculate the total amount of rainwater t...
Calculate the total amount of rainwater that can be trapped within given elevation map.
Iterate through the array to find the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped above each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water above each bar to get the total trapped water for the elevation map.
Round duration - 30 minutes
Round difficulty - Medium
The 2nd Round was technical interview round.
It started with the usual “Tell me something about yourself”. Then he asked questions based on resume, like I had mentioned that I am familiar with Concepts of Data Science and Machine, so he asked a few questions on them. Then he asked about OOPS concepts and he also asked few questions on my project.
Round duration - 45 minutes
Round difficulty - Easy
Round duration - 15 minutes
Round difficulty - Easy
The HR was pretty chill and she asked questions like:-
Tell Me something about yourself.
Do you plan to do Masters
All about my resume
About my club and project.
Tip 1 : Focus on concept clearity and practice topic wise DSA questions on regular basis.
Tip 2 : Do atleast 2 projects and have detailed knowlede about the projects.
Tip 3 : Have a good grasp of Concepts of OOPS.
Tip 1 : Put those things on resume which you are confident about.
Tip 2 : Have at least two projects on resume, out of which one should be your main project and the other can be your secondary one.
Tip 3 : Do not put false things on resume.
I appeared for an interview 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.
I applied via Campus Placement and was interviewed in Oct 2021. There was 1 interview round.
I am a detail-oriented engineer with a passion for problem-solving and innovation.
I have a strong background in mechanical engineering and have worked on projects ranging from designing automotive components to developing medical devices.
I am skilled in using CAD software such as SolidWorks and have experience with 3D printing and prototyping.
I am a quick learner and enjoy taking on new challenges, whether it's learnin...
Inheritance is a mechanism in OOP where a new class is derived from an existing class.
Allows for code reusability and saves time
Derived class inherits properties and methods of base class
Can override base class methods in derived class
Can have multiple levels of inheritance
Example: class Dog extends Animal {}
Normalization is the process of organizing data in a database to reduce redundancy and dependency.
1NF (First Normal Form) - Each column in a table must have atomic values.
2NF (Second Normal Form) - A table must be in 1NF and all non-key attributes must be dependent on the primary key.
3NF (Third Normal Form) - A table must be in 2NF and all non-key attributes must be independent of each other.
4NF (Fourth Normal Form) - ...
OOP concepts include encapsulation, inheritance, polymorphism, and abstraction, essential for structured programming.
Encapsulation: Bundling data and methods. Example: class `Car` with properties like `speed` and methods like `accelerate()`.
Inheritance: Deriving new classes from existing ones. Example: `class SportsCar(Car)` inherits properties and methods from `Car`.
Polymorphism: Using a single interface to represent ...
SQL queries can be written to manipulate and retrieve data from two related tables.
Use JOIN to combine data from both tables. Example: SELECT * FROM table1 JOIN table2 ON table1.id = table2.foreign_id;
Use WHERE clause to filter results. Example: SELECT * FROM table1 WHERE condition;
Use GROUP BY to aggregate data. Example: SELECT column, COUNT(*) FROM table1 GROUP BY column;
Use INSERT to add new records. Example: INSERT...
I am a highly motivated engineer with a passion for problem-solving and innovation.
I have a degree in Mechanical Engineering from XYZ University
I have worked as a design engineer at ABC Company for 3 years
I am proficient in CAD software such as SolidWorks and AutoCAD
I have experience in project management and leading cross-functional teams
I am always seeking to learn and improve my skills
I am meticulous because I pay attention to details and strive for perfection.
The picture frame on the wall is slightly crooked
There is a stain on the carpet near the door
The bookshelf is dusty and needs to be cleaned
The lamp on the desk is missing a light bulb
There are fingerprints on the window
I am impressed with the company's reputation and growth potential.
I have researched the company and its achievements.
I am excited about the opportunity to work with a talented team.
I believe the company's values align with my own.
I am impressed with the company's commitment to innovation and technology.
I am confident that I can contribute to the company's success.
I have the necessary skills, experience, and passion to excel in this role.
I have a strong background in engineering with a degree from a top university.
I have several years of experience in the field, including working on complex projects.
I am a quick learner and am always looking to expand my knowledge and skills.
I am passionate about engineering and am committed to delivering high-quality work.
I am a team player and...
I see myself in a leadership role, managing a team and contributing to the growth of the company.
Managing a team of engineers
Contributing to the growth of the company through innovative ideas and solutions
Continuing to learn and develop new skills
Taking on more responsibilities and challenges
Building strong relationships with colleagues and clients
Top trending discussions
posted on 20 Feb 2021
I applied via Recruitment Consultant and was interviewed before Feb 2020. There were 4 interview rounds.
I applied via Recruitment Consultant and was interviewed in Jul 2020. There were 3 interview rounds.
Some of the top questions asked at the Comviva Technology interview for freshers -
The duration of Comviva Technology interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 3 interview experiences
Difficulty level
Duration
based on 868 reviews
Rating in categories
Technical Lead
504
salaries
| ₹11.4 L/yr - ₹20 L/yr |
Senior Engineer
356
salaries
| ₹5.3 L/yr - ₹12.5 L/yr |
Senior Software Engineer
346
salaries
| ₹5.9 L/yr - ₹14 L/yr |
Senior Technical Lead
270
salaries
| ₹17.2 L/yr - ₹29 L/yr |
Software Engineer
212
salaries
| ₹3.9 L/yr - ₹13.5 L/yr |
ITC Infotech
3i Infotech
Sify Technologies
Microland