Kellton Interview Questions, Process, and Tips

Q1. Tell me tools used for data extraction
Ans. 
Tools for data extraction include web scrapers, APIs, and data mining software.
• Web scrapers like Scrapy and BeautifulSoup extract data from websites

• APIs like Google Maps API and Twitter API provide access to specific data

• Data mining software like RapidMiner and KNIME analyze large datasets

• OCR software like Tesseract can extract text from images

• Database management systems like MySQL and Oracle can extract data from data
Answered by AI
Add your answer
Q2. Let me know email marketing tools you are expert in
Ans. 
I am an expert in various email marketing tools such as Mailchimp, HubSpot, and Constant Contact.
• Proficient in creating and managing email campaigns using Mailchimp, HubSpot, and Constant Contact

• Adept in designing visually appealing email templates and newsletters

• Experienced in analyzing email campaign performance and optimizing for better results

• Skilled in segmenting email lists and personalizing email content for tar
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. 
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

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.
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.