Kellton Software Engineer Interview Questions and Answers

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.

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.

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, 1, -3, 4, -1], the maximum subarray sum is 4.

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.

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.

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

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.

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