Dp World Interviews

I recently interviewed for the SDE1 role at DP World. I have 2 years of experience and got this opportunity through a referral from a friend.

Round 1: Technical Interview

My friend referred me to DP World. I received a recruiter call, and she sent me an online assessment link, stating it was just medium. However, it contained one medium and one hard DSA question, along with some aptitude questions, all of which I solved. The next day, I received her call, and she asked if I could attend an F2F interview at their Bangalore office. I couldn't as I was in Delhi and requested a virtual interview. She scheduled one interview for two days later, reassuring me it would be just DSA easy-medium, which got my hopes up. Round 1 started with a light chat and tech discussion with an interviewer who was about a year senior to me. He then provided the question on team's chat. After some struggles and one hint, I solved it, but it took almost 40 minutes to completely code and show the output. I was subsequently ghosted. She later mentioned that the role had been closed, and everyone was selected from the F2F interviews.

R1: Hackerrank Test (90 minutes)

R2: Coding Round

• Q1: https://leetcode.com/problems/longest-common-subsequence/
• Q2: https://leetcode.com/problems/longest-valid-parentheses/description/

R3: Low level Design

You are tasked with designing and implementing a ride-sharing application where passengers can request rides, and drivers can be matched to them based on proximity. The application should handle different types of vehicles (such as cars, bikes, luxury cars) and support multiple fare calculation strategies. The system must notify both passengers and drivers about ride statuses and calculate the fare based on the type of ride and distance traveled

Verdict : Rejected

Hi Everyone , Hope you are doing great. i want to share my interview experience with DP World for SDE-2 (Frontend).

Applied Method : Referal

Round 1 : OA (consist of react machine coding question - weather app)

Round 2 : (JS , HTML,CSS ) -

Question 1 :
function Dog(name) {
    this.name = name;
}
 
Dog.prototype.bark = function() {
    console.log('Hello, ' + this.name);
};
 
const dog = new Dog('Tommy');
dog.bark();
 
const dogBark = dog.bark;
dogBark();

Question 2 :

let name = "John";
 
(function() {
    console.log(x); // ?

    let name = "Jerry";
    console.log(x); // ?
})();

Question 3 :

const deepObj = Object.freeze({
    a: { b: 2 },
    c: 3
});
 
deepObj.a.b = 42;
deepObj.c = 5;
 
console.log(deepObj.a.b);

console.log(deepObj.c);

 
deepObj.a = { b: 50 };
console.log(deepObj.a.b);

Question 4 :

console.log(1)
 
setTimeout(() =>{
  console.log(3)
}, 0)
 
Promise.resolve(() => {
  console.log(2)
})
 
console.log(4)

Most of the output based questions , i was able to answer. i would say 7/10.

Some other questions like :

• what is shadow DOM ?
• LocalStorage vs cookies vs SessionStorage.
• Event Loop
• Closures

Round 2 went well for me. Few minor things i didn't knew so told the interviewer.

Self Verdict - Hire

Round 3 : (React JS)

Implement a TODO list with add, edit and delete option.

This was intresting , as i was able to do it , but the edit functionality took sometime and after clicking on edit , latest values were not showing in input box/form.( i just missed to add value = {name} in the input element (dumb thing))

Self Verdict - Hire

Update : i was rejected and told , i don't have much experience in ReactJS

YOE : 2.8

Currenlty : SDE-1 At a Product Based Startup

How Did I get interview Call? - Recruiter shared email on a LinkedIn Post and asked to email resume.

Round 1-

OA

1 Hard Graph Problem

1 Medium Problem

Don't remember the Exact Questions

Round 2- 60 Mins

Basic Intro around the work I do.

Question 1 -

https://leetcode.com/problems/group-anagrams/description/

Question 2 -

https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/

Solved Both Questions with Brute to most optimal solution

Self Verdict : Strong

Round 3 - 60 Mins

Question - 1

https://leetcode.com/problems/merge-k-sorted-lists/

Question - 2

https://leetcode.com/problems/daily-temperatures/

Solved Both Questions with brute to most optimal solution

Self Verdict : Strong

Round 4 - 60 Mins

Question - 1

https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/

Question - 2

https://leetcode.com/problems/largest-rectangle-in-histogram/description/

Solved both questions, Q-1 done with optimal solution, Q2 with Brute Force, was not able to think of the most optimal solution.

All rounds are eliminaiton rounds

All questions were popular Leetcode Medium/Hard Problems.

LC Stats = ~800

Round 5 - Hiring Manager

Duration - 60 Mins

Interviwer was Director at DP World.

Interview started around with the work I do.

Questions like - Why Switch?

Why left the first company in 6-7 Monhts? (Mass Layoffs btw)

I explained the work I do. (Wasn't very convincing, need to selll better)

Situational -

You and your teammate are workinng on a project with strong deadlines.What would you do If your teammate is not doing anything, he straight up refuses to do any work? What will you do?

Interviwe was like 60-65% techincal, rest standard HM questions.

Java Spring Boot questions.

What is Autowired?

@Component?

What if we don't use @Component?

Comparing Objects in java.

Starting a project from sratch and writing a spring boot API.

Asked me if i know multithreading?

Then asked me to write a program to print 1 - 100 with 2 threads.

Some More questions about Java Spring Boot.

Verdict : Rejected in HM Round

I am currently working as a Senior Software Engineer in a fintech company with a total of 5.5 years of experience. Below is my interview experience with DP World.

Round 1: Online Assessment (OA)

I received a Hackerrank link for the OA, which contained:

• 2 coding questions, One on dynamic programming (max path sum from top to bottom in a matrix). Another related to trees and BFS.

• 2 SQL queries (formatting output in a specific way).

• MCQs on computer science basics.

Round 2: Technical Interview

The interview started with a discussion about my latest project, followed by questions on financial workflows.

Q1: Given a sorted, rotated array of integers, find if element k exists.

The interviewer asked how binary search works, its time complexity, and to derive the mathematical proof for O(log n). I couldn’t derive the exact equation but explained that binary search works in log n time as it halves the search space in each step and at max log n comparisons are needed to find a number.

I felt like the interviewer frequently interrupted me, steering towards a predefined solution he had in mind. I initially explained the pivot-based approach (find pivot, then binary search on both halves). He insisted on solving it in a single binary search.

After implementing that, he again interrupted, asking me to reduce if conditions, even though I had written them for better readability and modularity.

Q2: Given a string s and three arrays (indices, sources, targets). For each index, we had to check if sources[i] occurs in s at indices[i]. If it does, replace it with targets[i]. It was replacing entire strings starting from indices[i], and not just characters.

I wrote a working solution, but it failed for some edge cases. I identified the issue but couldn't fix the logic within the interview time.Later, I found an optimized approach using a hashmap.

Overall I felt disappointed with how the discussion went. However, I received positive feedback, and my next rounds were scheduled for Saturday.

Round 3: LLD (Face-to-Face, Gurgaon Office)

Had to wait a long time as many candidates came for SDE1 and SDE2 roles.

• The interviewer unexpectedly asked very fundamental Java questions (college-level topics). I answered some but was expecting questions from my resume or Spring Boot, or that more time would be spent on LLD design.

• LLD Question: Parking Lot System I started writing entities, but he quickly stopped me due to lack of time and asked how I would assign a parking spot. I explained that I would use a Strategy pattern for assignment logic.

  For parking spot allocation, I discussed possible approaches:

  • HashMap to store available spots per floor (not the most optimized, but straightforward).

  • PriorityQueue to store both floor number and parking spot ID, ensuring efficient allocation.

Verdict: Rejected

I was told my performance was neither positive nor negative in my last round and that the hiring committee would decide. Later, I was informed that I was rejected when I called for feedback.

I recently interviewed for an SDE 2 position at DP World in Gurgaon. The process consisted of two rounds. The first round was an Online Assessment, which was 100 minutes long. It included 2 SQL queries, one easy and one medium, along with 2 coding questions. One coding question was easy and array-based, while the other was a medium-difficulty problem based on Binary Search, similar to Aggressive Cows. Unfortunately, I could only pass 8 out of 14 test cases for the medium coding question, which felt like there might have been an issue with their test cases. Additionally, the OA had 6 MCQs covering Computer Networks and basic Data Structures and Algorithms.

The second round was a technical interview where I was asked two specific coding questions. For the first question, I was unable to propose a solution better than O(N^2). The second question was about finding the maximum path sum in a binary tree, allowing one value to be skipped, which I couldn't finish coding due to time constraints. I was eventually rejected.

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.

My interview journey for the SE1 position at DP World began in December 2021. I had 4 months of experience from a product-based startup at the time, being part of the 2021 batch from a Tier-3 college.

Round 1 (Online Assessment) - 100 mins (Hackerrank)

This round included two coding questions: one medium (string-DP based) and one hard (graph-based). Additionally, there were two easy SQL questions and 10 MCQs covering topics like Time Complexity, Output Detection, Aptitude, OS, and CS fundamentals.

Round 2 (Technical Interview 1) - 60 mins (6 days after OA)

After a brief introduction, the interviewer directly jumped into problem-solving. We discussed the following LeetCode problems:

• Get the Maximum Score
• Best Time to Buy and Sell Stock II
• Best Time to Buy and Sell Stock IV

Round 3 (Technical Interview 2) - 60 mins (8 days after OA)

This round started with a basic introduction, followed by discussions on my current projects, CS fundamentals, Java fundamentals, and OS concepts. We then moved on to solving the following LeetCode problems. The interviewer was helpful and provided hints whenever I got stuck:

• Maximal Square
• Maximal Rectangle

Round 4 (Hiring Manager) - 60 mins (10 days after OA)

The final round involved a detailed discussion about my work at my current organization. We also covered Java fundamentals, Spring fundamentals (like IoC, different Annotations), and solved the following LeetCode problems:

• Path Sum II
• Path Sum III

There was also a discussion on approaches to solve the minimum distance traveled by a salesman to deliver all packets (Traveling Salesman Problem). Additionally, some behavioral questions related to on-call issues were asked.

I received confirmation from the recruiter about my selection on the same day as the last interview. I had requested some time after the OA and then requested shorter gaps between subsequent rounds, which is why the time stamps might vary for other candidates.