Round 1
Questions:
- Introductions
- Javascript fundamentals (event loop scenario explanation)
- Questions related to closures and React fundamentals
- Data Structures and Algorithms questions:
- Tree-related question (medium)
- Array manipulation question (easy-medium)
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2
Questions:
- Introductions
- Cache invalidation in the project
- Explanation of project deployment process to user devices
- In-depth questions on frontend optimizations used in the project
- Data Structures and Algorithms question:
- Tree-related question (medium)
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3
Questions:
- Introductions
- Explanation of a proud project and its significance
- Data Structures and Algorithms questions:
- Coding from scratch: bottom view of a binary tree
- Binary search-related problem (like aggressive cows)
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 4
Questions:
- Introductions
- Explanation of the current project
- Frontend machine coding problem (medium) in React
- Reasoning problem:
- Given a 4 * 4 * 4 cm cube, how many 1 cm^3 cubes can be cut from it?
- Follow-up: If painted on all sides, how many of the cut cubes have all 3 sides colored?
- Data Structures and Algorithms question:
- Tree-related question (medium)
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 5
Questions:
- Design and architecture round
- Discussion about previous interview experience
- Explanation of impactful changes in the project
- Drawing tool exercise to create a high-level design (HLD) of the project
- Various questions about project decisions
- Discussion on the use of lodash library
- Implementation of a lodash function
- Problem to print Fibonacci sequence without storing it:
- Example: Calling fib(10) should print the first 10 Fibonacci numbers without storing them.
Candidate's Approach
Used recursion and additional logic to print the Fibonacci sequence.
Interviewer's Feedback
No feedback provided.