Dp World

Role: SDE-1

College: Not Specified

Interview Date: Oct 2021

Interview Type: Not Specified

Result: Selected (Implied)

Difficulty: Medium

Rounds: 3 rounds

Topics Asked: Coding (Arrays, Dynamic Programming), OOPs (Polymorphism, Static & Dynamic Polymorphism)

Experience:

This experience details the interview process for an SDE-1 role in 2021.

Round 1: Online Assessment (HackerRank - 90 mins)

• 3 coding questions.
• One was an easy array problem.
• Two were DP problems (one a variation of Longest Palindromic Subsequence (LPS), the other not recalled).

Round 2 (1 hour - Oct 18)

• Started with an introduction.
• Moved to OOPS, asking basic questions and requesting implementation of polymorphism.
• One basic question on static & dynamic polymorphism.
• 2 coding questions:
  • Easy array question: Find min & second min of the array. The candidate solved it using two variables.
  • Another question, not specified.

The candidate received a call the next day, shortlisted for the next round.

Round 3 (1 hour - Oct 24)

• The interviewer directly started with coding questions.
• 2 questions:
  • Maximise the sum of kth values of the array, but the sum should be even. The candidate solved it by dividing values into odd & even collections.
  • Another question, not specified.