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

The interview started with a resume discussion – the interviewer asked about the projects and technologies I had worked on.

Then we moved on to DSA problems:

Q1. Distinct Rectangles on Cartesian Plane

Given a list of points on the Cartesian plane, find the number of distinct rectangles that can be formed.

Condition: The sides of the rectangle must be parallel to the X-axis or Y-axis.

Q2. Maximum Path Sum in Binary Tree with One Skip Allowed

A binary tree is given where each node has an integer value (positive or negative).

We need to find the maximum path sum, but with the twist that we are allowed to skip at most one node on the path.