Panda Guru LogoPanda
Guru

Adobe | CS-1 | Noida | Dec 2024 | Reject

Round 1: DSA

Questions:

  1. A dynamic programming problem to maximize an amount.
    • Initially, a recursive solution was provided, followed by a tabulation approach. The interviewer then asked for a memoization solution without using an nXn array.
  2. Print zig-zag traversal of a binary tree.
    • The interviewer requested the code to work correctly on the first attempt without any errors.
Candidate's Approach
  • For the first question, the candidate provided three approaches: recursive, tabulation, and memoization.
  • The candidate was able to explain the memoization solution effectively, which pleased the interviewer.
  • The candidate was required to code all three approaches.
Interviewer's Feedback

The interviewer was happy with the candidate's approach to the dynamic programming problem.


Round 2: LLD

Questions:

Candidate's Approach

No approach provided.

Interviewer's Feedback

Feedback was positive.


Round 3: HLD

Questions:

Candidate's Approach

The candidate enjoyed this round, which felt more like a discussion. They were able to engage in a detailed conversation about the design.

Interviewer's Feedback

Feedback was positive, and the interviewer was described as sweet and engaging.


Round 4: Director Round

Questions:

Candidate's Approach

The candidate felt the director was not receptive to their answers but maintained politeness throughout the questioning.

Interviewer's Feedback

No feedback provided.