SDE 2 | DP World- Gurgaon | Rejected
Summary
I interviewed for an SDE 2 position at DP World in Gurgaon and was ultimately rejected after two rounds, including an OA and a technical interview with challenging coding questions.
Full Experience
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.
Interview Questions (2)
You are given a 2D plane with a set of points, where each point is represented by [x, y]. The task is to find all distinct rectangles that are either parallel to the x-axis or the y-axis.
Example:points=[(1,1),(1,4),(4,1),(4,4),(2,2),(3,3)]
Solution: One such rectangle is formed by points (1,1),(1,4),(4,1),(4,4).
y-axis
^ | (1,4) (4,4) | ------------- | | | | | | | | | | ------------- | (1,1) (4,1) | +----------------------------------> x-axis
Given a binary tree, find the maximum path sum when you are allowed to skip exactly one node's value in the path.
Example:
-10
/
9 20
\ /
-100 15 7
Expected Answer: 44.
Maximum Path: 9 -> -10 (skipped) -> 20 -> 15 (Path: 9, 20, 15, Sum: 9+20+15 = 44)