Zenith Computers Interview Questions and Answers

Round duration - 120 Minutes
Round difficulty - Medium

This was an online MCQ + coding round where we had 1 hour to solve the MCQ's and another 1 hour to solve 2 coding
questions. The MCQ's were related to both General and Technical Aptitude.

Q1. 
Path Sum Calculation
You are provided with the root node of a binary tree containing 'N' nodes and an integer value 'TARGET'. Your task is to determine the number of leaf nodes for which the sum of the no...read more
Ans. 
Calculate the number of leaf nodes in a binary tree with a path sum equal to a given target.
• Traverse the binary tree from root to leaf nodes while keeping track of the sum along the path.

• Recursively check if the current node is a leaf node and if the sum equals the target.

• Increment a counter if the conditions are met and return the counter as the result.
Answered by AI
Add your answer
Q2. 
Check If Numbers Are Coprime
Determine if two given numbers 'a' and 'b' are coprime, meaning they have no common divisors other than 1.
Input:
t
a_1 b_1
a_2 b_2
...
a_t b_t
Output:
true / false
...
Exampl...read more
Ans. 
Check if two numbers are coprime by finding their greatest common divisor (GCD) and determining if it is 1.
• Calculate the GCD of the two numbers using Euclidean algorithm.

• If GCD is 1, the numbers are coprime; otherwise, they are not.

• Iterate through all pairs of numbers provided in the input.

• Return true if GCD is 1, false otherwise.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

This was a standard DSA round where I was given 2 coding questions - the first one was related to DP and the second one was of Linked List. I first explained my approach and then coded the solutions in a production ready manner by applying proper coding principles.

Q1. 
Maximum Length Pair Chain Problem Statement
You are provided with 'N' pairs of integers such that in any given pair (a, b), the first number is always smaller than the second number, i.e., a < b. A pai...read more
Ans. 
Find the length of the longest pair chain that can be formed using given pairs.
• Sort the pairs based on the second element in increasing order.

• Iterate through the sorted pairs and keep track of the maximum chain length.

• Update the chain length if the current pair can be added to the chain.

• Return the maximum chain length at the end.
Answered by AI
Add your answer
Q2. 
Palindrome Linked List Problem Statement
You are provided with a singly linked list of integers. Your task is to determine whether the given singly linked list is a palindrome. Return true if it is a pali...read more
Ans. 
Check if a given singly linked list is a palindrome or not.
• Use two pointers approach to find the middle of the linked list.

• Reverse the second half of the linked list.

• Compare the first half with the reversed second half to determine if it's a palindrome.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round started with 2 preety decent coding questions - one from DP and the other one was from Binary Search. This was followed by some questions from OOPS and then the interview ended with the interviewer asking me the famous 3-Ants and the Triangle Puzzle.

Q1. 
Subset Sum Equal To K Problem Statement
Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Provide true if such a subset exists, otherwise r...read more
Ans. 
Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.
• Use dynamic programming to solve this problem efficiently

• Create a 2D array to store if a subset sum is possible for each element and each sum value

• Iterate through the array and update the 2D array accordingly

• Check if the value at the last element and K is true to determine if a subset sum equals K
Answered by AI
Add your answer
Q2. 
Search In Rotated Sorted Array Problem Statement
Given a rotated sorted array ARR of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.
Note:
1. If 'K' is not present...read more
Ans. 
Given a rotated sorted array, find the index of a given integer 'K'.
• Use binary search to find the pivot point where the array is rotated.

• Based on the pivot point, perform binary search on the appropriate half of the array to find 'K'.

• Handle cases where 'K' is not present in the array by returning -1.
Answered by AI
Add your answer
Q3. What is meant by static and dynamic polymorphism?
Ans. 
Static polymorphism is resolved at compile time, while dynamic polymorphism is resolved at runtime.
• Static polymorphism is achieved through function overloading and operator overloading.

• Dynamic polymorphism is achieved through virtual functions and function overriding.

• Example of static polymorphism: function overloading in C++.

• Example of dynamic polymorphism: virtual functions in C++.
Answered by AI
Add your answer
Q4. What is abstraction in Object-Oriented Programming?
Ans. 
Abstraction in OOP is the concept of hiding complex implementation details and showing only the necessary features to the outside world.
• Abstraction allows us to focus on what an object does rather than how it does it.

• It helps in reducing complexity and improving maintainability of code.

• Example: In a car, we don't need to know the internal working of the engine to drive it. We just need to know how to operate the pedals
Answered by AI
Add your answer
Q5. You have 3 ants located at the corners of a triangle. The challenge is to determine the movement pattern of the ants if they all start moving towards each other. What will be the outcome?
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This was a Technical Cum HR round where I was first asked some basic OOPS related concepts and then we discussed
about my expectations from the company , learnings and growth in the forthcomig years. I would suggest be honest and
try to communicate your thoughts properly in these type of rounds to maximise your chances of getting selected.

Q1. What do you know about the company?
Add your answer
Q2. Why should we hire you?
Add your answer

Q1. Basic HR questions so prepare well with all hr questions
Add your answer
Q2. Strengths and weakness
Add your answer

10 coding questions + client interview

Q1. 1. Linked list - Linked list operation 2. Basic C Questions - String reversal 3. Fibonacci series
Ans. Basic linked list programming and string questions
Answered Anonymously
Add your answer
Q2. String questions - reversal, palindrome
Add your answer

Q1. About core java basics, hibernate, spring etc
Add your answer

Q1. Expected CTC, about previous company experience
Add your answer