Kellton Interview Questions, Process, and Tips

Round duration - 30 minutes
Round difficulty - Easy

It was in the evening. Platform used for this round was hackerrank. Questions were of moderate level.

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 an array of integers.
• Iterate through the array and keep track of the maximum sum subarray seen so far.

• At each index, decide whether to include the current element in the subarray or start a new subarray.

• Update the maximum sum subarray if a new maximum is found.

• Consider edge cases like all negative numbers in the array.

• Example: For input arr = [-2,
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

It was in the evening. I have practiced coding questions a lot so my thinking abilities got improved. Questions were of moderate level.

Q1. 
Max Length of Same Indexed Subarrays Problem
Given two integer arrays A and B, and an integer C, the goal is to determine the maximum possible length K of the same indexed subarrays. The condition is that...read more
Ans. 
Find the maximum length of same indexed subarrays based on given conditions.
• Iterate through the arrays to find the maximum length of same indexed subarrays.

• Calculate the sum of subarrays from A and B, and check if the condition is met.

• Return the maximum length that satisfies the condition.
Answered by AI
Add your answer

Q1. All basic questions related to programming, understanding about data structures, dbms so on
Add your answer

Q1. What are your salary expectations?
Add your answer
Q2. What are your strengths and weaknesses?
Add your answer
Q3. Tell me about yourself.
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

We had all rounds in afternoon. Environment of the office was giving positive vides. Interviewer was polite and kind.

Q1. 
Reverse the String Problem Statement
You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.
Example:
Input:
STR = "abcde"
Output:
"e...read more
Ans. 
Reverse a given string containing alphabets, numbers, and special characters.
• Iterate through the string from the end to the beginning and append each character to a new string.

• Use built-in functions like reverse() or StringBuilder in languages like Python or Java for efficient reversal.

• Handle special characters and numbers along with alphabets while reversing the string.

• Ensure to consider the constraints provided in th...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

It was in the evening. Platform used for this round was hackerrank. Questions were of moderate level.

Q1. 
Distinct Subsequences Problem Statement
You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.
Exampl...read more
Ans. 
Calculate the number of distinct subsequences in a string with possible duplicates.
• Iterate through the string and keep track of the count of each character.

• Use dynamic programming to calculate the number of distinct subsequences.

• Consider the cases where a character is included or excluded in the subsequence.

• Modulo the final count by 10^9 + 7 to handle large answers.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It was in the night around 9:00PM. Platform used for this round was skype.

Round duration - 30 minutes
Round difficulty - Easy

It was in the evening. Platform used for this round was hackerrank. Questions were of moderate level.

Q1. 
Max Length of Same Indexed Subarrays Problem
Given two integer arrays A and B, and an integer C, the goal is to determine the maximum possible length K of the same indexed subarrays. The condition is that...read more
Ans. 
The goal is to determine the maximum possible length of same indexed subarrays based on given conditions.
• Iterate through the arrays A and B to find the maximum possible length of same indexed subarrays.

• Calculate the sum of the maximum element in the K-length subarray from B and the product of K and the sum of the K-length subarray from A.

• Check if the sum does not exceed the given value C to determine the maximum length
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

It was in the night around 9:00PM. Platform used for this round was skype.

Round duration - 30 minutes
Round difficulty - Medium

Q1. 
Find All Pairs Adding Up to Target
Given an array of integers ARR of length N and an integer Target, your task is to return all pairs of elements such that they add up to the Target.
Input:
The first line ...read more
Ans. 
The task is to find all pairs of elements in an array that add up to a given target.
• Iterate through the array and for each element, check if the target minus the element exists in a hash set.

• If it exists, add the pair to the result. If not, add the element to the hash set.

• Handle cases where the same element is used twice to form a pair.

• If no pair is found, return (-1, -1) for that test case.
Answered by AI
View 1 more answer

Round duration - 90 minutes
Round difficulty - Medium

Q1. 
Minimum Number of Swaps to Sort an Array
Find the minimum number of swaps required to sort a given array of distinct elements in ascending order.
Input:
T (number of test cases)
For each test case:
N (siz...read more
Ans. 
The minimum number of swaps required to sort a given array of distinct elements in ascending order.
• Use a graph-based approach to find cycles in the array

• Count the number of swaps needed to fix each cycle

• Sum up the swaps needed for all cycles to get the total minimum swaps
Answered by AI
Add your answer
Q2. 
Kth Largest Element Problem
Given an array containing N distinct positive integers and a number K, determine the Kth largest element in the array.
Example:
Input:
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...read more
Ans. 
Find the Kth largest element in an array of distinct positive integers.
• Sort the array in non-increasing order and return the Kth element.

• Ensure all elements in the array are distinct.

• Handle multiple test cases efficiently.
Answered by AI
Add your answer