I'm sharing this detailed post because there aren't many DP World interview questions available on platforms like LeetCode. I've combined all the information to provide a comprehensive overview of my interview experience, hoping it will help others preparing for interviews at DP World.

In preparation for the DP World interview for the Android SDE2 position, I followed a structured approach to enhance my technical skills and system design knowledge. I regularly practiced coding problems sourced from platforms like LeetCode and Glassdoor, focusing on topics such as Data Structures and Algorithms (DSA), system design, and Android-related projects.

22 March 2024 question was in first round -> You write down a secret number and ask your friend to guess what the number is.
When your friend makes a guess, you provide a hint with the following info:
The number of "bulls", which are digits in the guess that are in the correct position.
The number of "cows", which are digits in the guess that are in your secret number but
are located in the wrong position. Specifically, the non-bull digits in the guess that
could be rearranged such that they become bulls.
Given the secret number secret and your friend's guess guess, return the hint for your
friend's guess.
The hint should be formatted as "xAyB", where x is the number of bulls and y is the number
of cows. Note that both secret and guess may contain duplicate digits.

Example 1:
Input: secret = "1807", guess = "7810"Output: "1A3B"
Explanation: Bulls are connected with a '|' and cows are underlined:
"1807"
|
"7810"
Example 2:
Input: secret = "1123", guess = "0111"Output: "1A1B"
Explanation: Bulls are connected with a '|' and cows are underlined:
"1123" "1123" | or |
"0111" "0111"
Note that only one of the two unmatched 1s is counted as a cow since
the non-bull digits can only be rearranged to allow one 1 to be a bull.

Although I attended the interview as scheduled, I later joined another company, so I did not proceed further in the DP World interview process.

Interview Prep question I solved during prep

Round 1: DSA all are old question
Reorder List

Clone a Linked List with Next and Random Pointer (very important)

Add Two Numbers II

Path Sum II

Path Sum III

Palindromic Substrings

Zigzag Tree Traversal

Find the Nearest Smaller Numbers on Left Side in an Array

Design a Stack That Supports GetMin in O(1) Time and O(1) Extra Space

Best Time to Buy and Sell Stock II

Best Time to Buy and Sell Stock IV

Next Greater Element III

Stock Buy Sell

Generate All Possible Parentheses

Android related project question with code validation

Sliding Window Maximum

Round 2: DSA

Maximal Square
Maximal Rectangle

Round 3: System Design

LLD of Vending Machine
HLD of Logistics System
Design Instagram in 45 minutes without data estimation
HLD question on chat application

Round 4: Hiring Manager

Discussion on current work
Java fundamentals and Spring fundamentals like IOC and different annotations
Lowest Common Ancestor of a Binary Tree
Sliding Window Maximum
Car Pooling
Other Topics Covered:
Longest Common Subsequence
Rain Water Trapping Problem
Stock Buy Sell Problem
Immutable Class Design
Design Patterns: Singleton, Factory
API Handling
Scenarios for Given API Contract
Additional Rounds:
Djikstras Algorithm and Greedy Algorithm
Sort on the Basis of Frequency of Alphabets
Splitwise System Design
Rotate Array
Provide Frequency of Characters in a String
Reverse String Without Disturbing Position of Special Characters
Given a Number, Find the Next from It
Log Framework LLD
Questions Related to Trees and Linked Lists
Merge n Linked Lists in Sorted Order
DP + Bit Manipulation Question
Print Level Order in the Binary Tree Starting from the Right Child
Array Contains 0,1,2. Sort the Array
Reverse a String
Rain Drop Problem
Max Subarray Sum of Circular List
Design Chessboard Game
Given an Integer K and Integer Array (Weight), Find Maximum Amount of Weight That Can Be Lifted Without Crossing the Capacity K
Given an Array of Integers, Convert the Array So That Priority Remains the Same but in Minimized Number
Design System to Get Random, Find, Delete, Insert on O(1)
Given Linked L0 L1 L2 L3 L4 … Ln, Convert It to L0 Ln L1 Ln-1 L2 Ln-2