Total 3 rounds.

Round 1: Two persons conducted the interview. Questions were based on Data Structures and Algorithms (DSA), Java, and SQL.

Specific questions included:

• Finding the first non-repeating character in a string.
• Questions on the final keyword in Java.
• Determining if a palindrome can be formed using a given string.
• Searching a sorted array using binary search.
• SQL inner queries.
• Questions on REST APIs and their differences with SOAP.

Round 2: This round was entirely focused on DSA. Questions were based on strings, trees, and recursion. For strings, a problem involved finding the count of sequences that could be formed from a number like 1234 (e.g., abcd, lcd, awd). A tree question was simple, requiring basic knowledge of parsing a tree.

Round 3: This round was likely with a manager. I was asked to validate a password entered by a user.

Constraints for password validation:

• Only lowercase letters and at least one numeric character are allowed.
• Length must be greater than 5 and less than 13 characters.
• No common adjacent substrings should be present (e.g., 'abab123' is incorrect because 'ab' is adjacent, but 'abcab124' is correct because 'ab' and 'ab' are not adjacent).

General questions were also asked, such as my expected package and reasons for leaving my current company.

Mentioned in the interview process above.