HyperVerge Account Manager Client Servicing Interview Questions and Answers

2 questions dsa based

Q1. Recursion based coding questions
Add your answer
Q2. Resume , grill on projects
Add your answer

Q1. Why sde inspite of having different background
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. 
Counting Even and Odd Occurrences
You are provided with an array or list of integers named ARR of size N. The task is to determine two things:
1. How many elements appear an odd number of times?
2. How many...read more
Ans. 
Count the number of elements with odd and even occurrences in an array of integers.
• Iterate through the array and use a hashmap to store the count of each element.

• After counting, iterate through the hashmap to determine odd and even occurrences.

• Return the counts of elements with odd and even occurrences.
Answered by AI
Add your answer
Q2. 
Delete Nodes with Greater Values On Right
You are given a singly linked list where each node contains an integer value and a reference to the next node or NULL if it is the last node. The task is to remov...read more
Ans. 
Remove nodes in a singly linked list with a greater value on the right.
• Traverse the linked list and compare each node's value with the values of nodes to its right.

• If a node has a greater value on the right, remove it from the linked list.

• Update the references of the previous node to skip the removed node.
Answered by AI
Add your answer

Q1. Project discussion
Add your answer

Q1. Please introduce yourself .
Add your answer
Q2. Why do you want to join tech mahindra
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

MCQs + coding round

Q1. 
Candies Distribution Problem Statement
Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...read more
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Coding round

Q1. 
Largest Prime Factor Problem Statement
You are given a positive integer n. Your task is to identify the largest prime factor of this given positive integer.
If there is no prime factor for a given intege...read more
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

TR+HR+MR

Q1. 
Swap Two Numbers Problem Statement
Given two integers a and b, your task is to swap these numbers and output the swapped values.
Input:
The first line contains a single integer 't', representing the num...read more
Add your answer

Test has many reasoning and coding question work on building logic and data Structure

Coding round is kind of tough practice dsa questions and build your logic

Round duration - 90 minutes
Round difficulty - Medium

It is from 12 to 1:30 pm. Environment was very friendly and interviewer was very nice.

Q1. 
Nth Term of Geometric Progression Problem
Given the first term A, the common ratio R, and an integer N, your task is to find the Nth term of a geometric progression (GP) series.
Explanation:
The general...read more
Ans. 
Calculate the Nth term of a geometric progression series modulo 10^9 + 7.
• Use the formula A * R^(N-1) to find the Nth term of the GP series.

• Remember to calculate the result modulo 10^9 + 7.

• Handle multiple test cases efficiently to stay within the time limit.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Very friendly environment 

Three questions were assigned to be solved within a two-hour timeframe.

The assessment consists of two multiple-choice question (MCQ) rounds, each lasting 15 minutes, and one essay writing task requiring 400 words to be completed within 25 minutes.