Round 1
Questions:
- Coding question which is solved using max heap.
- XML deserializer implementation.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2
Questions:
- Union find question around connected components.
- Java concurrency question on how to implement strictly alternating threads printing even and odd numbers.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3
Questions:
- Simple DP - colouring houses with 3 colours at minimum cost. Cost Matrix is given. Consecutive houses should not be coloured the same.
- IO and NIO in Java.
- URL class loader usage to load jars dynamically.
- Implement URL shortening service hashing logic using Base62.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 4
Questions:
- Previous complex project experience and understanding of every minute technology used. How is it technically challenging?
- Super and extends usage in generics.
- How would you design something like a thread local storage in a new programming language?
- How would you design a debugger for a new programming language?
- Design git diff feature HLD and implementation that gives the diff of file names, not file contents.
- Conflicts resolution questions.
- And many more. Interview went on for 2 hours.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 5
Questions:
- Previous project and tech stacks used.
- High Availability, Active-active vs active-passive.
- Distributed transaction - How would you implement compensating transaction to rollback?
- Kafka vs RabbitMQ.
- n cm size cube is given:
- a. How many 1cm cubes can be cut?
- b. If the cube is colored red on the outside, how many cubes are colored exactly 2 faces red?
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.