Aaveg Management Services Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Medium

Timing was fine - It was in the afternoon
Interviewer was friendly and helpful

Q1. 
Find Duplicates in an Array
Given an array ARR of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...read more
Ans. 
Find duplicates in an array of integers within a specified range.
• Iterate through the array and keep track of the count of each element using a hashmap.

• Return elements with count greater than 1 as duplicates.

• Handle edge cases like empty array or no duplicates found.

• Example: For input [0, 3, 1, 2, 3], output should be [3].
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

- Timing was fine - Afternoon
- Interviewer was friendly

Q1. How would you design a caching library?
Ans. 
Designing a caching library involves considering data storage, retrieval, expiration policies, and cache invalidation strategies.
• Define the caching requirements such as data size, access patterns, and expiration policies.

• Choose a suitable data structure for caching like LRU, LFU, or a simple key-value store.

• Implement cache eviction policies to handle memory constraints and optimize performance.

• Consider thread safety an...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

- Timing was fine - Afternoon
- Interviewer was friendly

Q1. What is the number of edges in a 10x10 cube?
Ans. 
A 10x10 cube has 600 edges.
• A cube has 12 edges, so a 10x10 cube would have 12 edges on each of its 6 faces.

• 12 edges x 6 faces = 72 edges for the entire cube.

• However, each edge is shared by two faces, so we need to divide by 2 to get the total number of unique edges.

• 72 edges / 2 = 36 unique edges on the outer surface of the cube.

• Since the cube has 10x10x10 = 1000 unit cubes, each with 12 edges, we need to subtract the e...read more
Answered by AI
Add your answer

Q1. To find the kth minimum element from BST
Ans. 
To find the kth minimum element from a Binary Search Tree (BST)
• Perform an in-order traversal of the BST to get elements in sorted order

• Return the kth element from the sorted list

• Time complexity: O(n) where n is the number of nodes in the BST
Answered by AI
Add your answer
Q2. Basic OOPs question like inheritance encapsulation
Add your answer

Q1. In a BST two numbers are swapped find swapped nos.
Ans. 
To find swapped numbers in a BST, perform inorder traversal and keep track of previous node.
• Perform inorder traversal of the BST

• Keep track of the previous node while traversing

• If at any point, the current node's value is less than the previous node's value, those are the swapped numbers
Answered by AI
Add your answer
Q2. What you did in college projects
Add your answer

Q1. Puzzles: find the fastest 3 horses in 25 horse race with a race and 5 horses can be run at a time
Add your answer
Q2. Weakness and strength. how a friend will describe you
Add your answer

Bsaic questions about python and other

Python basic questions

Q1. Case studies and technical questions
Add your answer

Written and programming tests for problem statements.

You can select any industry-related problem and develop a project based on it.

Some logical problems will be provided and need to be solved.

Q1. HR will take personal interview
Add your answer

Percentage, Profit & Loss,

List, for loop, try-except block, Recursion, Sort the numbers without using inbuilt functions

One hour for date-time serialization.

1 hour
pattern program

Aptitude test and a three-hour examination on fundamentals of programming languages, databases, and machine learning.