Maersk | SSE | Backend | R-1
January 21, 2026 · 58 reads
Summary
I recently applied to Maersk for an SSE Backend role and completed a DSA round. This round included two specific problems: the Aggressive Cows Problem and reconstructing a binary tree from its level order traversal.
Full Experience
Hi Folks,
YOE: 6.5 Currently SSE@Walmart.
Recently applied to Maersk.
R-1: DSA (60 min)
- Aggressive Cows Problem
- You're given an integer array which is the level order format of a binary tree. You're supposed to reconstruct the binary tree and again print the level order traversal of it for verification. While printing it back, ensure that each level is printed in a new line.
Interview Questions (2)
1.
Aggressive Cows Problem
Data Structures & Algorithms
Aggressive Cows Problem
2.
Reconstruct Binary Tree from Level Order and Print Level by Level
Data Structures & Algorithms
You're given an integer array which is the level order format of a binary tree. You're supposed to reconstruct the binary tree and again print the level order traversal of it for verification. While printing it back, ensure that each level is printed in a new line.