KSOLVES interview experience Real time questions & tips from candidates to crack your interview
Java Developer
KSOLVES
1 rounds | 3 Coding
problems
Rejected
Interview preparation journey
Journey
I prepared myself by learning through YouTube tutorials and the Coding Ninjas platform. These resources helped me strengthen my understanding of concepts, practice coding problems, and build confidence for interviews.
Preparation
Topics: Java, DSA
Application process
Where: Coding Ninjas Placement Cell
Eligibility: Any Graduate
Interview rounds
01
Round
Easy
Online Coding Interview
Duration
Interview date25 Mar 2025
Coding problem3
1. Find the Maximum Value in an Array
You are given a non-negative integer array. Your task is to return the maximum (highest) value present in the array.
Example:
Input: [1, 9, 3, 7, 5]
Output: 9
Problem approach
I sorted the array using a for loop and then printed the last element (which represents the maximum value).
2. Find the Most Frequent Substring in a String
You are given a string consisting of lowercase English letters. Your task is to identify the substring that occurs the highest number of times and return the count of its occurrences.
- If multiple substrings occur the same maximum number of times, return the highest count only.
- The string length will always be greater than 0.
Problem approach
I used a Boolean array to keep track of visited characters.
- For the first occurrence of a character, I marked it as true.
- When the same character appeared again, I reset its value to false and increased the count.
- While traversing, I maintained a variable to store the maximum count, which gave me the highest frequency of a substring/character.
3. Merge Overlapping Pairs in an Array
You have an array in pairs of two numbers. You need to find the overlapping pairs and combine them into a new pair starting from the first number of the first pair and ending at the last number of the second pair.
Problem approach
I used two nested loops to check the conditions for overlapping pairs. Whenever I found an overlap, I combined the pairs into a single pair starting with the first number of the first pair and ending with the last number of the second pair.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
Selected 
8518 views
0 comments
0 upvotes
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
Selected 3320 views
0 comments
0 upvotes
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
Selected 2581 views
0 comments
0 upvotes
Software Engineer
2 rounds | 4 problems
Interviewed by KSOLVES
Selected 284 views
0 comments
0 upvotes
Companies with similar interview experiences
Java Developer
3 rounds | 20 problems
Interviewed by Ernst & Young (EY)
Selected 9061 views
2 comments
0 upvotes
Java Developer
3 rounds | 4 problems
Interviewed by SAP Labs
Selected 3149 views
0 comments
0 upvotes
Java Developer
2 rounds | 2 problems
Interviewed by HCL Technologies
Selected 7166 views
0 comments
0 upvotes