SDE 2 | DP World- Gurgaon | Rejected

Round 1

Questions:

• OA: 100 mins test
  • 2 SQL queries - 1 Easy, 1 Medium
  • 2 Coding Questions - 1 Easy (array based) and 1 Medium based on Binary Search (similar to Aggressive Cows). The candidate could pass only 8 out of 14 test cases due to issues with the test cases.
  • 6 MCQs based on CN and basic DSA.

Round 2

Questions:

1. You are given a 2D plane, there are points, every point is represented by [x, y]. You need to find all distinct rectangles which are either parallel to the x-axis or y-axis.

   • Example:

     points = [(1,1),(1,4),(4,1),(4,4),(2,2),(3,3)]
     

   • Solution:

     y-axis
     
     ^
     |   (1,4)         (4,4)
     |     *-------------*
     |     |             |
     |     |             |
     |     |             |
     |     *-------------*
     |   (1,1)              (4,1)
     |
     +----------------------------------> x-axis

   • The candidate could not propose a better solution than O(N^2) and asked for pointers for a better solution.

2. Given a binary tree, find the maximum path sum when you are allowed to skip 1 value.

             -10
           /     \
          9       20
           \     /  \
           -100 15   7

   • Answer: 44. Maximum Path: 9 -> -10 -> 20 -> 15.
   • The candidate was not able to code this due to time constraints.