Kellton Software Engineer Interview Questions, Process, and Tips

I was asked about the star pattern questions and also moderate array and string questions

Q1. Where do you see yourself in next 4 years
Ans. 
In the next 4 years, I see myself growing into a senior software engineer role, leading projects, and continuously learning new technologies.
• Continuously improving my technical skills through training and certifications

• Taking on more responsibilities in project management and leadership

• Contributing to the success of the team and the company

• Exploring opportunities for mentorship and knowledge sharing

• Possibly pursuing a ...read more
Answered by AI
Add your answer
Q2. What is your future goal
Ans. 
My future goal is to become a technical lead in a software development team and contribute to innovative projects.
• Advance my technical skills through continuous learning and certifications

• Lead and mentor junior developers to help them grow in their careers

• Contribute to high-impact projects that drive innovation and solve complex problems
Answered by AI
Add your answer

MCQ round containing mathematical questions like upstream downstream, etc

Q1. Asked about OOPs concepts, merge sort with code, quick sort with code. Discussion on problem solving questions based on OOPs
Add your answer

Q1. Company polices elaborated and discussed.
Add your answer

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
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
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
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
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. Brute force
• The IDea is to call a helper function so as to create all possible subsequences of the string which will contain:
  • String CUR = the possible subsequence of the string.
  • Int ID = the index of character which will either be included or excluded.
• We maintain a set to count the distinct subsequences, each time a new subsequence is created, we add it into the set. Remember, the set does not contain duplicate elements.
• ...read more
Answered Anonymously
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. Brute force
The idea is to brute force to find the maximum length subarray which satisfies the given condition.

 
• The steps are as follows:
• Maintain a variable ‘ans’, which stores the final answer.
• Loop from 1 to ‘N’ Using 'i:
• 'i' denotes the length of the subarray, which may satisfy the condition.
• Maintain an array ‘prefixSum’ which stores the prefix sum of the array ‘a’.
• To check whether the subarray of length 'i' satis...read more
Answered Anonymously
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
Add your 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
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
Add your answer

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
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Platform used for this round was skype.