Panda Guru LogoPanda
Guru

Zeta SDE-2 Interview Experience

Round 1 | DSA

Questions:

  1. Given an array of probabilities array = [0.5, 0.7, 0.1, 1, 0.3] and K = 3, find the sum of all probabilities where we can get K heads.

    • Example: For K = 3, possible combinations include THHTH, HHHTT, TTHHH, etc.
  2. Minimize a string consisting only of A's and B's by deleting occurrences of AA or BB in as few moves as possible.

    • Input: AABABBA
    • Output: "B" (removing AA and BB results in a total of 3 deletions).
Candidate's Approach
  • For the first question, I spent some time using a dynamic programming solution and was able to figure out the approach.
  • For the second question, I managed to code the solution effectively.
  • The interviewer seemed happy with my overall performance, and I was given an extra 10 minutes beyond the scheduled 60 minutes.
Interviewer's Feedback

No feedback provided.


Round 2 | LLD

Questions:

Candidate's Approach
  • I provided a class diagram and discussed the states of the vending machine.
  • I started coding the solution and explained my thought process, but I struggled with managing the states and ran out of time before completing the solution.
Interviewer's Feedback

The interviewer was not happy with this round.