Clover Infotech Full Stack Developer Interview Questions and Answers

Round duration - 45 minutes
Round difficulty - Medium

I was asked 2 coding questions, questions from my projects and questions related to different java concepts. One question from cloud computing was also asked.

Q1. 
Maximum Subarray Sum Problem Statement
Given an array arr of length N consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.
Explanation...read more
Ans. 
Find the sum of the subarray with the maximum sum among all subarrays in a given array.
• Iterate through the array and keep track of the current sum and maximum sum seen so far.

• If the current sum becomes negative, reset it to 0 as it won't contribute to the maximum sum.

• Return the maximum sum as the result.

• Example: For input arr = [-2, 1, -3, 4, -1], the maximum subarray sum is 4.
Answered by AI
Add your answer
Q2. 
Add Two Numbers as Linked Lists
You are given two singly linked lists, where each list represents a positive number without any leading zeros.
Your task is to add these two numbers and return the sum as ...read more
Ans. 
Add two numbers represented as linked lists and return the sum as a linked list.
• Traverse both linked lists simultaneously while keeping track of carry

• Create a new linked list to store the sum

• Handle cases where one list is longer than the other

• Consider edge cases like carry at the end of addition
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

It was a normal discussion about the role, the job expectations and about the company culture.

Round duration - 100 minutes
Round difficulty - Medium

The complete test will be Audio and Video Proctored, Please be available in front of the camera throughout the test duration. Assessment login details will be sent to the candidate’s registered email id prior to assessment. The Aptitude 25 questions - 35 Minutes, English 25 questions - 30 Minutes, Technical 25 questions - 35 Minutes. Those who clear the first test would have a second test of Psychometric duration 60 Mins on the same day of the test. Shortlisted candidates would have interviews post that.

Round duration - 30 minutes
Round difficulty - Medium

This round consisted of various technical questions such as questions on web technologies, databases, OOPS concepts, and coding questions.

Q1. 
Binary Palindrome Check
Given an integer N, determine whether its binary representation is a palindrome.
Input:
The first line contains an integer 'T' representing the number of test cases. 
The next 'T'...read more
Ans. 
Check if the binary representation of a given integer is a palindrome.
• Convert the integer to binary representation.

• Check if the binary representation is a palindrome by comparing it with its reverse.

• Return true if it is a palindrome, false otherwise.
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

I was asked to introduce myself and about my hobbies. They were very general questions. They asked me about my strengths and weakness. In the end, they asked me would I re-locate.

Q1. They just check your mindset
Add your answer

First Round consists of Basic Aptitude questions

Q1. Then I got into Technical Interview, It was pretty good, Interviewer asked me some questions on programming basics also asked me to write some simple codes.
Add your answer

Q1. The HR round was all about my communication skills and represention of myself.
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

It was an online technical, aptitude, and English test.

Q1. 
Relative Sorting Problem Statement
You are given two arrays, 'ARR' of size 'N' and 'BRR' of size 'M'. Your task is to sort the elements of 'ARR' such that their relative order matches that in 'BRR'. Any e...read more
Ans. 
The task is to sort the elements of ARR in such a way that the relative order among the elements will be the same as those are in BRR. For the elements not present in BRR, append them in the last in sorted order.
• Create a frequency map of elements in ARR

• Iterate through BRR and for each element, append it to the result array the number of times it appears in ARR

• Iterate through the frequency map and for each element not p...read more
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

It was a face to face technical interview round where based on my previous study and resume I was supposed to answer the questions asked by them.

Q1. 
N-th Fibonacci Number Problem Statement
Given an integer ‘N’, your task is to find and return the N’th Fibonacci number using matrix exponentiation.
Since the answer can be very large, return the answer ...read more
Ans. 
The task is to find the Nth Fibonacci number using matrix exponentiation.
• Use matrix exponentiation to efficiently calculate the Nth Fibonacci number

• Return the answer modulo 10^9 + 7 to handle large numbers

• Implement the function to solve the problem

• The Fibonacci sequence starts with 1, 1, so F(1) = F(2) = 1

• The time complexity can be improved to better than O(N) using matrix exponentiation
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

It was HR interview with basic questions and checking according to SWOT analysis.