Kellton Interview Questions, Process, and Tips for Freshers

Round duration - 30 minutes
Round difficulty - Easy

It was in the evening. Questions were of moderate level.

Q1. 
Divide Chocolates Problem Statement
Ninja bought chocolate consisting of several chunks, and the sweetness of each chunk is represented in an array ARR. He wants to divide the chocolate into K + 1 parts (...read more
Ans. 
The task is to maximize the total sweetness of the part that Ninja will get by dividing chocolates into K + 1 parts.
• Iterate through all possible cuts to find the maximum sweetness Ninja can obtain.

• Keep track of the minimum sweetness in each part after the cut.

• Return the maximum of these minimum sweetness values as the result.
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.

Q1. 
Partition to K Equal Sum Subsets Problem
Given an array of integers and a positive integer 'K', determine if it is possible to divide the array into 'K' non-empty subsets such that the sum of elements in ...read more
Ans. 
The problem involves dividing an array into K subsets with equal sum.
• Use backtracking to try all possible combinations of dividing the array into K subsets

• Keep track of the sum of elements in each subset and check if they are equal to the target sum

• Optimize by sorting the array in descending order before starting the backtracking process
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. 
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

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

Round duration - 30 minutes
Round difficulty - Easy

It was in the evening.
Questions were of moderate level.

Q1. 
Distinct Subsequences Problem Statement
Given two strings S and T consisting of lowercase English letters, the task is to count the distinct occurrences of T in S as a subsequence.
Explanation
A subsequ...read more
Ans. 
Count the distinct occurrences of a given subsequence in a string.
• Iterate through the string S and keep track of the count of distinct occurrences of T as a subsequence.

• Use dynamic programming to efficiently solve the problem by considering all possible subsequences of T in S.

• Handle edge cases such as empty strings or when T is longer than S.

• Example: For S = 'banana' and T = 'ban', the output is 3 as T appears as [ban]
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It was in the night around 9:00PM.
platform used in round is skype

Round duration - 30 minutes
Round difficulty - Easy

Platform used for this round was hackerrank. 
Questions were of moderate level.

Q1. 
Partition to K Equal Sum Subsets Problem
Given an array of integers and a positive integer 'K', determine if it is possible to divide the array into 'K' non-empty subsets such that the sum of elements in ...read more
Ans. 
The problem involves dividing an array into K subsets with equal sum.
• Use backtracking to try all possible combinations of dividing the array into K subsets

• Keep track of the sum of elements in each subset and check if they are equal to the target sum

• Optimize by sorting the array in descending order and assigning elements to subsets greedily
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Platform used for this round was skype.