A recruiter contacted me through naukri.com. Got the online assessment link on hackerrank with 2 questions. I have 1 yr 7 months experience in banking and finance domain.

**22/04/22 OA **

Ques 1: Encode/Decode the string based on the input. The output should be based on the key. There are following 3 inputs from the user:int (operation o-for encode, 1-for decode)
string (input string – word which is to be encode/decode)
string (key to encode/decode e.g. 123)e.g.
Input:
0
open
123
Expected output:
oppeeen

Ques 2: Dont remember exactly but it was a variation of Coin Exchange Problem

Solved both the questions all test cases passed.

7/05/22 Coder Pad

Started with the introduction. It was on phone call while doing coding on coderpad.

Ques 1: Input: [{"Bob","87"}, {"Mike", "35"},{"Bob", "52"}, {"Jason","35"}, {"Mike", "55"}, {"Jessica", "99"}]
Output: 99
Explanation: Since Jessica's average is greater than Bob's, Mike's and Jason's average.

I started with my brute force approach then I told him the hashmap solution approach. He was okay with it and asked me to implement it. I implemented it. Then he added few more test cases with negative scores. That test cases started failing. I tried to figure out what was going wrong then I found that it is because of the division we perform for calculating the average. And the scores should be stored as double so that it rounds off to the nearest integer. I spent a lot of time figuring this out. But in the end it worked.

Ques 2: find the first non repeatingcharacter in a string.

I told the brute force approach. Then the storing of character frequency in array approach. He was convinced and asked me to implement. All thes test cases passed.

19/05/22 Super Day

Round 1:

• Started with introduction. Then he asked me whether I know what is Tree data Structure?
• Where to use it?
• All traversals of Trees?
• Implement it from scratch.
• Code for inserting a node in a Tree.
• Binary Search trees and Binary tree.
• Complexity of traversals. Why is it O(height of tree) ?
• Code for Inorder Traversal (both recursive and iterative approach)
• How are Tree and Graph related?
• Similarity of traversals in Graph and Trees.
• Is tree a subset of graph or vice versa?
• There was a brief discussion on trees and graphs in general.

Second interviewer asked to write a program to find the 3 largest elements in an array. Clean and optimized code was expected. Told all the approaches first then she asked me to implement single traversal approach.

Interviewers were friendly gave hints.

*Round 2: *
Started with introduction. In the pannelist, one interviewer was of associate level and the other of vp level with more than 10 year experience.

• Started asking about spring how it works?

• At what version of java do you work on currently?

• How do two microservices communicate?

• What starter packages have you worked on?

• What is Kafka?

• What are the new functionalities in java 8?

• What is compile time and runtime polymorphism?

• Follow up: If a child and parent class has same method which throws unrelated exceptions then is it runtime polymorphism?

• What is functional interfaces?

• Can Hash Map and Tree Map store null values ?

• Internal working of hashmap how the collision handling in hashmap is solved with java 8?
  He seemed pretty unconvinced with my answers.

• The second interviewer asked me to write a code for next permuatation of a string.
  I took time and made mistakes in the beginning but she gave hints and after a lot of discussion she asked me to write it. I wrote it. She asked me to dry run the code for few test cases. She was convinced.

I felt a little intimidated by the interviewer who was at vp level. As I was not able to answer his questions on spring and java properly. Rest it was fine.

Round 3:

• Started with the introductions.
• How was your previous 2 interviews?
• What is your current role in the project?
• What is the project?
• How do you deploy a service in your project?
• What are your daily tasks?
• Why you want to switch so early?
• What will you do if you dont get good work in GS also?
• How do you take out time to learn?
• Why dont you ask your manager to give you good work?
• At what depth will you learn any technology?
• How will you solve an issue ?
• How will you implement a functionality ?
• What is the thing you recently learned?
• Java 8 functionalities ?
• What problems java 8 solves?
• How is java 8 better ?
  This round focussed mostly on my current role and projects. Also some behaviour questions. It was okay.

At every level they asked are there any questions for us? Make sure you ask something. Also, make sure you know evertythhing about java 8 if its present in jd.
All interviews lasted for around 1 hour
HR called and told me I was done for the day. And they will inform if there are further rounds of interviews.
Till now I haven't received any update on further rounds. Let's see :)

VERDICT Application Turndown

UPDATE:-
Got the offer in August 2022 and accepted it.
Experience has been good so far.