KreditBee SDE (Software Development Engineer) Interview Questions and Answers

Hackerrank - dp problems

Q1. Minimum number of jumps in the array.
Ans. 
Find minimum number of jumps required to reach the end of an array.
• Use dynamic programming approach to solve the problem.

• Maintain an array to store minimum number of jumps required to reach each index.

• Traverse the array and update the minimum number of jumps for each index.

• Return the minimum number of jumps required to reach the end of the array.
Answered by AI
Add your answer

Q1. What are ambitions and how I'll approach them
Add your answer
Q2. How do I see myself in 5 years
Add your answer

It was leetcode questions for 60 min for 2 questions.

Q1. Tell me about your self
Add your answer

Q1. Tell me about your work experience
Add your answer

MVVM was asked and swift questions

Q1. Find median of 2D array
Ans. 
Find median of 2D array of strings
• Flatten the 2D array into a 1D array

• Sort the 1D array

• Calculate the median based on the length of the array
Answered by AI
Add your answer

Q1. LLD of Twitter System
Add your answer

Round one consist of coding problems and there's a minimum criteria of solving 2 problems at least to clear this round

Q1. First question was a coding question, merge intervals leetcode
Add your answer
Q2. Second question was again of leetcode, compare strings
Add your answer

2hrs aptitude test was there

2 hrs coding test was there

GD was conducted and then i passed it

Quantitative case study on cost benefit analysis of 2 types of public buses running in a city. Need to choose one of them with higher profits

Fraud detection model: 3rd party firm proposing to use thier model for fraud detection. Need to profit analysis of whether to go for it or not.

Q1. Culture fit round to understand if compatible with the company
Add your answer

Medium Leetcode, Array, String, Tree, DP

Q1. System Design, Design Payment Platform
Add your answer