KEKA TECHNOLOGIES Intern Interview Questions and Answers

A 90-minute coding test on HackerRank, which includes one medium, one easy, and one hard question.

Q1. What is the index of the first occurrence where a pattern string matches with a text string?
Add your answer
Q2. Given a string, how can we find the minimum length substring whose sum is greater than or equal to a specified target?
Add your answer

We had 21 questions including 3 coding questions. It was simple and beginners friendly questions

Q1. Questions were asked based on DBMS, SQL, api, simple coding and testing
Add your answer

Q1. I was asked to describe my projects and questions were asked based on that. Had scenario based questions
Add your answer

Yes it was quite easy

Q1. Brief overall analysis
Add your answer

Python coding, simple

Q1. Data analytics related, imbalanced data set handling
Add your answer
Q2. Overfit and how to fix that
Ans. 
Overfitting occurs when a model learns the noise in the training data rather than the underlying pattern.
• Regularization techniques like L1 and L2 regularization can help prevent overfitting by penalizing large coefficients.

• Cross-validation can be used to evaluate the model's performance on unseen data and prevent overfitting.

• Feature selection or dimensionality reduction techniques can help reduce overfitting by focusin...read more
Answered by AI
Add your answer

There were 3 questions in the online assessment.

1 - Binary Search
2 - DP
3 - Graphs

Q1. Implement a persistence stack with constant time operations
Ans. 
Implement a persistence stack with constant time operations
• Use a combination of a stack and a hashmap to achieve constant time operations for push, pop, and get operations

• Maintain a stack to store the elements and a hashmap to store the index of each element in the stack

• When pushing an element, add it to the stack and update its index in the hashmap

• When popping an element, remove it from the stack and also remove its i...read more
Answered by AI
Add your answer

Q1. Median of two sorted arrays and OOPs basics
Ans. 
Finding the median of two sorted arrays and discussing OOPs basics
• To find the median of two sorted arrays, merge the arrays and then calculate the median

• OOPs basics include concepts like encapsulation, inheritance, polymorphism, and abstraction

• Example: Median of [1, 3] and [2] is 2.0
Answered by AI
Add your answer