dp world logo
Dp World· SDE II

DP World | 6 yrs experience | SSE

Result
Ongoing
Experience
6 years
Posted
21 Apr 2023
361 reads

Summary

I had an interview with DP World for a Senior Software Engineer position, which primarily focused on data structure and algorithm problems.

How it went

I recently interviewed with DP World for a Senior Software Engineer position. The interview consisted of one round where I was presented with three challenging Data Structures and Algorithms problems. I was able to tackle these problems effectively.

Questions asked (3)

  1. 01

    Find Passing Students Based on Performance

    Data Structures & Algorithms

    A student will fail if any other student has obtained more marks in both the subjects. Find all the passing students.
    Example:
    Input:
    Student 1: {100 , 80}
    Student 2: {90 , 70}
    Student 3: {60 , 80}
    Student 4: {60 , 70}
    Output:- student 1, student 3

  2. 02

    Furthest Building You Can Reach

    Data Structures & Algorithms

    You are given an integer array of heights representing the heights of buildings, some bricks, and some ladders.
    You start your journey from building 0 and move to the next building by possibly using bricks or ladders.
    While moving from building i to building i+1 (0-indexed),
    If the current building's height is greater than or equal to the next building's height, you do not need a ladder or bricks.
    If the current building's height is less than the next building's height, you can either use one ladder or (h[i+1] - h[i]) bricks.
    Return the furthest building index (0-indexed) you can reach if you use the given ladders and bricks optimally.

  3. 03

    Smallest Subarray with Sum Greater Than Target

    Data Structures & Algorithms

    Find smallest subarray whose sum is greater than the target
    Eg: arr[] = {1, 4, 4, 6, 0, 19} x(target) = 51
    output subarray is {4, 45, 6}

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Dp World recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!