Total Rounds

• One Online Assessment
• Two Technical Interview
• Hiring Manger Round

Online Assessment:
Topics: DSA

• 4 Question
• 70 Minutes
  • Q1. Leetcode easy array question.
  • Q2. Given time in string format and bus_shuttle arr and current_time (all times are in string format “HH:MM”), need to calculate the min waiting time to get the next shuttle bus.
  • Q3. Spiral Traversal in a matrix.
  • Q4. This question is related to arrays and list. (LC Easy to Medium Range)

Technical Interview - Round 1 - ONSITE

Topics: Java, Spring Boot, System Design (Basics)
Duration: 60 - 70 minutes
Resources: Pen & Paper, No Laptop.

• Basic introduction.
• Brief discussion of projects mentioned in my resume (including college projects, even though they weren’t listed).
• Questions about my role in my current company.
• In-depth discussion on the projects I have worked on in current company.
• Detailed explanation of the SRP page architecture, covering the complete flow from user interaction to database operations:
  • Explained how REST APIs handle requests from React.js (frontend) → Spring Boot (backend) → Database
  • Discussed possible optimizations, including caching strategies, Kafka integration, and database improvements
• Asked how to display the live count of users visiting a particular page without requiring a page refresh.
• No coding was required; the concepts were explained using pen and paper.

Technical Interview - Round 2 - ONSITE

Topics: DSA
Duration: 60 minutes
Resources: Pen & Paper, No Laptop.

• Basic Introduction.

• Q1.

  • Leetcode Hard - https://leetcode.com/problems/word-ladder/description/
  • Same Problem - Instead of distance, asked to return true if we can get the destination string or else false

• Q2.

  • Given n, find number of pairs of (a,b) such that a + b = n
    where a > 0 and b > 0. (Expected solution in O(1)).
  • Test Case 1:
    • n = 3
    • then possible pairs are (1,2) and (2,1) so the result is 2.

• Q3.

  • Given two teams A and B, each team has certain number of players with some strength (strengths are sorted in each team), after each round, exactly one player will be eliminated.
    • Rules for Elimination
      • A player will be eliminated from any team who have least strength.
      • If two players have same least strength in a single team, any one of them will be eliminated.
      • If two players have same least strength in two teams, then player from team A will be eliminated.
  • Return the team that will win, if there can be any number of rounds (until one player remains)(Expected solution in O(1)).

• Asked to write code on paper.