Keploy Internship Interview Experience — 2026
Summary
I interviewed for a Software Engineering Intern role at Keploy, completing two technical rounds with DSA problems and a behavioral round, and I am currently waiting for the final round.
Full Experience
Keploy Internship Interview Experience - 2026
I recently interviewed for the Software Engineering Intern role at Keploy. Sharing my experience in case it helps someone preparing for the interview.
Round 1 - DSA
Duration: 45 minutes Scheduled on: August 28, 2026 (Friday)
The round was completely focused on DSA.
The problem given was:
Sum of Distances in Tree https://leetcode.com/problems/sum-of-distances-in-tree/description/
I was able to come up with a solution and explain my approach to the interviewer.
Immediately after the interview ended, received a recording of the entire interview by email.
The recording included the complete interview as well as the feedback given by the interviewer at the end of the round.
Round 2 - Technical + DSA Sep-1 2026
Duration: Around 40 minutes Scheduled on: Tuesday the following week
The interview started with my introduction. The interviewer then asked about my internship experience and the tech stack I had used in my projects.
Interestingly, there were no detailed questions about the implementation of my projects.
Internship Question
"What was the most difficult problem you solved during your internship?"
I explained one of the challenging problems I had worked on during my internship.
There was also a follow-up question:
"Suppose a huge amount of data is sent from the backend. How would you handle it on both the frontend and backend?"
I discussed things like load balancing and lazy loading based on my understanding.
DSA Question 1
Generate Parentheses https://leetcode.com/problems/generate-parentheses/description/?envType=problem-list-v2&envId=dynamic-programming
I explained the brute-force approach and then gave a backtracking approach.
But I was not completely sure about the exact time complexity because of the number of possible combinations.
DSA Question 2
Codeforces 2244C https://codeforces.com/contest/2244/problem/C
For this problem, I first came up with a brute-force solution and then an optimal solution using DSU.
interviewer was satisfied with DSU approach but then asked whether I could solve it using a mathematical approach.
I could not think of the mathematical solution within the remaining time, but he was okay with my DSU solution.
Round 3 - Waiting for Update
Currently waiting for the Round 3 update.
As mentioned by the HR, Round 3 will be with the Co-Founder of Keploy.
Duration: Around 30 minutes
The round will be mainly resume-based, so I am expecting questions around my internship, projects, skills, and overall experience.
Overall Experience
Overall, the interview experience has been good so far. The interviewers were friendly and gave me enough time to think about the problems.
I will update this post once I get an update about Round 3.
Interview Questions (5)
Sum of Distances in Tree
Given an undirected tree with n nodes, compute for each node the sum of distances to all other nodes in the tree.
Generate Parentheses
Generate all combinations of n pairs of well-formed parentheses.
Codeforces 2244C
Problem C from Codeforces Round 2244, requiring an efficient solution using Disjoint Set Union (DSU) and possibly a mathematical approach.
Most Difficult Problem Solved During Internship
"What was the most difficult problem you solved during your internship?"
Handling Huge Data Transfer Between Backend and Frontend
"Suppose a huge amount of data is sent from the backend. How would you handle it on both the frontend and backend?"