there was mcq round which had question related to core java , advance java , collection , multithreading, garbage collector , design patterns ,spring mvc and boot , databases.coding round 1 question also need to write the test cases by ourselve
Interview questions [1]
Question 1
coding round 1 question also need to write the test cases by ourselve
3 rounds. ( May changes)
1st round: Mostly java basics and problem related on Strings ( try to solve all leetcode String related questions), java 8 , collection most importantly multi threading
You are given a string with Alphabet set B,D,U and H. This string will be considered steady if each of letter occurs only n/4 times.
For Example HBDU and BBHUHDDU both are steady strings.
Now your job is to make a string steady if not by replacing substring of input string and replace it with any string of the same
length. It can be a empty string also.
Return the length of the minimum length substring that can be replaced to make string stable
EXAMPLE:
Input: HBBBUBBB
Output: 5
Explanation: One optimal solution is to replace BBBUB with UUDDH resulting in HUUDDHBB
Interview questions [1]
Question 1
You are given a string with Alphabet set B,D,U and H. This string will be considered steady if each of letter occurs only n/4 times.
For Example HBDU and BBHUHDDU both are steady strings.
Now your job is to make a string steady if not by replacing substring of input string and replace it with any string of the same
length. It can be a empty string also.
Return the length of the minimum length substring that can be replaced to make string stable
EXAMPLE:
Input: HBBBUBBB
Output: 5
Explanation: One optimal solution is to replace BBBUB with UUDDH resulting in HUUDDHBB
