Round 1 (CoderPad & Zoom):

The interviewer reviewed my resume and asked about my current project and technology stack. Afterward, she presented a coding problem.

Question 1: Given an array of integers representing the level order traversal of a binary tree, determine if it is a binary search tree.

Question 2: Given a string containing integers, find the number of ways to decode it into uppercase English alphabets, where 'A' corresponds to 1, 'B' to 2, ..., and 'Z' to 26. (Practice Link)

I implemented the solution using recursion and dynamic programming to avoid re-computing sub-problems. The interviewer tested the code with several test cases and edge cases. She then inquired about the time complexity of the program if dynamic programming were not used. I stated it was O(2^n). She indicated this was the final question for this round and wished me luck for the second round, which was scheduled to begin in 15 minutes.

Round 2 (CoderPad & Zoom):

The interviewer inquired about my current project and the tech stack I am using. He then asked several questions on core Java:

• Why are gateways used in microservices?
• What is the significance of the volatile keyword?

After I answered these questions, he provided some coding problems:

Question 1: Given an array, write a program to detect duplicates.

Given a string containing integers. Find the number of ways in which we can decode the string into upper case English alphabets. Assume 'A' stands for 1 and 'B' stands for 2, ..., 'Z' stands for 26. (Practice Link)