![]() |
VOOZH | about |
Key Questions:
"You are given multiple movies with start and end times. Find the maximum number of movies you can watch such that no two overlap (you can watch only one at a time)."
→ Classic greedy interval scheduling problem.
1) Task Scheduler Problem
"Given an array A = ['A', 'A', 'B', 'C', ...] and an integer N representing the cooldown period, remove all characters. You can remove one character per second, but the same character must be removed at least N seconds apart. Calculate the minimum time required to remove all characters."
→ Based on task scheduling with cooldown.
Both DSA Questions were moderate. Successfully solved both questions.
2) React Machine Coding :
React coding problem involving building a small component with clean and functional output.
Struggled in the React portion due to limited experience in frontend development.
This gap ultimately became a blocker for progressing to the next round.
Interviewers were friendly and collaborative, and the interview pace was balanced. Emphasis was on practical skills.
Entire process conducted remotely. Seamless Google Meet experience with screen-sharing for coding.
Not explicitly discussed due to not reaching HR round.
Although there was no direct feedback, the decision reflected a clear need for balanced frontend and backend skills for this role.