maersk logo
Maersk· SDE II

Maersk | SSE | Backend | R-1

Experience
6.5 years
Posted
21 Jan 2026
352 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.

How it went

Hi Folks,

YOE: 6.5 Currently SSE@Walmart.

Recently applied to Maersk.


R-1: DSA (60 min)

  1. Aggressive Cows Problem
  2. 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.

Questions asked (2)

  1. 01

    Aggressive Cows Problem

    Data Structures & Algorithms

    Aggressive Cows Problem

  2. 02

    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.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Maersk recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!