Online Assessment
Questions:
- 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)
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Technical Interview - Round 1 - ONSITE
Questions:
- 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.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Technical Interview - Round 2 - ONSITE
Questions:
- Q1.
- Leetcode Hard - Word Ladder
- 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.
- Test Case 1:
- 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)).
- 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 has 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.
- Rules for Elimination:
- Return the team that will win, if there can be any number of rounds (until one player remains) (Expected solution in O(1)).
- 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.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.