Kellton Software Developer Intern Interview Questions, Process, and Tips

Round duration - 30 minutes
Round difficulty - Medium

It was in the evening. Platform used for this round was hackerrank. Questions were of moderate level. Top topics where questions are more prone is Data Structures.

Q1. 
Count Subsequences Problem Statement
Given an integer array ARR of size N, your task is to find the total number of subsequences in which all elements are equal.
Explanation:
A subsequence of an array i...read more
Ans. 
Count the total number of subsequences in which all elements are equal in an integer array.
• Iterate through the array and count the frequency of each element.

• Calculate the total number of subsequences for each element using the formula (frequency * (frequency + 1) / 2).

• Sum up the total number of subsequences for all elements and return the result modulo 10^9 + 7.
Answered by AI
Add your answer
Q2. 
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

• Use Kadane's algorithm to efficiently find the maximum subarray sum

• Consider the case where all elements are negative to handle edge cases
Answered by AI
Add your answer

Round duration - 25 minutes
Round difficulty - Medium

It was in the night around 9:00PM. Platform used for this round was skype. Questions were of easy to moderate level and there is very interesting environment created by interviewer to answer.

Round duration - 15 minutes
Round difficulty - Easy

It was in the night around 7:00PM. Platform used for this round was zoom. Questions were more on personality based rather than theoretical knowledge. Interviewer was very calm in questioning.

Round duration - 60 minutes
Round difficulty - Easy

Q1. 
Number Pattern Generation
Ninja enjoys arranging numbers and wishes to organize them into N rows. The first row should have 1 number, the second row 2 numbers, the third row 3 numbers, and so forth, conti...read more
Ans. 
Generate number pattern in N rows with ascending order and restarting at 9.
• Iterate through each row from 1 to N.

• In each row, print numbers in ascending order starting from 1 and restarting at 9.

• Handle the wrapping around from 9 to 1 when reaching 9 in the sequence.
Answered by AI
Add your answer
Q2. 
Minimum Sum in Matrix Problem Statement
You are given a 2D matrix 'ARR' of size 'N x 3' with integers, where 'N' is the number of rows. Your task is to compute the smallest sum achievable by selecting one...read more
Ans. 
Find the smallest sum achievable by selecting one element from each row of a 2D matrix, following certain constraints.
• Iterate through each row and calculate the minimum sum by selecting elements that do not violate the constraints.

• Keep track of the minimum sum achieved so far.

• Avoid selecting elements directly below previously selected elements.

• Example: For input ARR = [[1, 2, 3], [4, 8, 6], [1, 5, 3]], the optimal sele
Answered by AI
Add your answer