Carelon Global Solutions NON Voice Process Interview Questions and Answers

Round duration - 60 Minutes
Round difficulty - Easy

Q1. 
Spiral Order Traversal of a Binary Tree Problem Statement
Given a binary tree with 'N' nodes, your task is to print the nodes in spiral order traversal.
Example:
Input:
The binary tree is represented i...read more
Ans. 
Print nodes of a binary tree in spiral order traversal.
• Use a queue to perform level order traversal of the binary tree.

• Alternate between printing nodes from left to right and right to left at each level.

• Handle null nodes represented by '-1' appropriately.

• Example: For input '1 2 3 -1 -1 4 5 -1 -1 -1 -1', the output should be '1 3 2 4 5'.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Q1. 
Word Break Problem Statement
You are given a list of N strings called A. Your task is to determine whether you can form a given target string by combining one or more strings from A.
The strings from A c...read more
Ans. 
Given a list of strings, determine if a target string can be formed by combining one or more strings from the list.
• Iterate through all possible combinations of strings from the list to form the target string.

• Use recursion to try different combinations of strings.

• Check if the current combination forms the target string.

• Return true if a valid combination is found, otherwise return false.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Q1. Design an elevator system.
Ans. 
Design an elevator system for efficient vertical transportation.
• Divide building into zones to optimize elevator usage.

• Implement algorithms for efficient elevator scheduling.

• Include safety features like emergency stop buttons and overload sensors.

• Consider user interface for passengers to select floors and monitor elevator status.
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

Yes consist of two code and questions MCQ of ds ,algo,Linz,shell,English and DBMS
Test happens with your webcam access.

Q1. 
Nth Fibonacci Number Problem
Calculate the Nth term in the Fibonacci sequence using the formula: F(n) = F(n-1) + F(n-2) where F(1) = F(2) = 1.
Given a number N, determine the Nth Fibonacci number.
Input...read more
Ans. 
Calculate the Nth Fibonacci number using the given formula and constraints.
• Implement a function to calculate the Nth Fibonacci number using the formula F(n) = F(n-1) + F(n-2) with base cases F(1) = F(2) = 1.

• Use dynamic programming or recursion to efficiently compute the Fibonacci number for large N values.

• Ensure the input N is within the constraints 1 <= N <= 10000.

• Example: For N = 5, the output should be 5 as th
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Hard

Late night around at 8 pm 
Environmental is positive.
Interviewer made me feel positive

Q1. 
Priority Queue Implementation
Ninja is tasked with implementing a priority queue using the Heap data structure. Since Ninja is busy with tournament preparations, your help is requested to complete this ta...read more
Ans. 
Implement a priority queue using Heap data structure with functions like push, pop, getMaxElement, and isEmpty.
• Implement push() function to insert element into the priority queue.

• Implement pop() function to delete the largest element from the queue.

• Implement getMaxElement() function to return the largest element.

• Implement isEmpty() function to check if the queue is empty.
Answered by AI
Add your answer
Q2. You have 3 bulbs outside a room and 3 switches inside the room. The challenge is to determine which switch controls which bulb, with the constraint that you can only enter the bulb room once.
Add your answer

Round duration - 10 Minutes
Round difficulty - Easy

Morning time
Positive environment
Nice interviewer

Round duration - 120minutes
Round difficulty - Easy

It was an online MCQ's + coding round consisting of 20 MCQ’s and 1 coding problem.

Q1. Check whether there exists a loop in the linked list.
Ans. 
Check for a loop in a linked list by using two pointers moving at different speeds.
• Use two pointers, one moving at double the speed of the other.

• If there is a loop, the two pointers will eventually meet at the same node.

• Example: 1 -> 2 -> 3 -> 4 -> 5 -> 2 (loop back to 2), the two pointers will meet at node 2.
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Easy

The interview started at 8:30 pm in cc of Delhi Technological University itself and it was quite late. There was only a single interviewer and he asked me one coding question related to overflow of integers.

Q1. How can you check for integer overflow when multiplying two integers and ensure the result is stored correctly within an integer type?
Ans. 
To check for integer overflow when multiplying two integers, use the properties of integer overflow and check if the result is within the valid range of the integer type.
• Check if the signs of the two integers are the same to avoid overflow in case of multiplication.

• Use the properties of integer overflow to detect if the result exceeds the maximum or minimum value of the integer type.

• Consider using a larger data type or...read more
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

It was quite late . There was only one interviewer and I was asked about my family , education and future plannings and few questions related joining locations and documents etc.