'Coding has over 700 languages', '67% of programming jobs arenâ€™t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
Maersk interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Maersk
2 rounds | 7 Coding problems
Interview preparation journey
Preparation
Duration: 6 months
Topics: Aptitude, SQL, Data structure, Dynamic Programming, Recursion, C++, Logical reasoning
Tip

Tip 1 : Read interview experience before interview
Tip 2 : Think loud about each coding question.

Application process
Where: Campus
Eligibility: 7 cgpa and no backlogs
Resume tip

Tip 1 : No spelling mistake in resume.
Tip 2 : Resume should be in proper format

Interview rounds
01
Round
Medium
Online Coding Interview
Duration95 minutes
Interview date23 Oct 2020
Coding problem1

The 1st round was online coding + MCQ round. It had 3 sections in total to be solved in 95 mins.
Next comes the technical interview.
The technical interview lasted for about 45 minutes. It started with a basic introduction. Then, she framed some questions from my resume and projects which I have mentioned. Questions were mainly from Data structure, OS, DBMS, SQL. She told me to rate my data structure skill on a scale of 1 to 5.
My interview was at 10:30 am and the interviewer was really nice. She was helping me wherever I was getting stuck.

1. Fourth Largest Element in the Array
Easy
20m average time
0/40

#### If there is no such number ...

View more
Problem approach

Sort the array and return second last element.

02
Round
Medium
Face to Face
Duration45 minutes
Interview date24 Jan 2021
Coding problem6

The technical interview lasted for about 45 minutes. It started with a basic introduction. Then, she framed some questions from my resume and projects which I have mentioned. Questions were mainly from Data structure, OS, DBMS, SQL. She told me to rate my data structure skill on a scale of 1 to 5.

1. Sort 0 1 2
Easy
22m average time
0/40

#### You have been given an integer array/list(ARR) of size 'N'. It only contains 0s, 1s and 2s. Write a solution to sort this array/list.

##### Note :
View more
Problem approach

I started with a basic brute force approach by counting the number of 0â€™s,1â€™s,2â€™s. Let the count be x,y,z then we can traverse again and fill x nodes as 0 , y nodes as 1 and z nodes as 2.
Then the interviewer asked me to optimize the solution
Next comes the efficient solution
Iterate through the linked list. Maintain 3 pointers named zero, one, and two to point to current ending nodes ...

View more
2. Remove Duplicates
Easy
15m average time
80% success
0/40

#### Ninja is playing with numbers but hates when he gets duplicate numbers. Ninja is provided an array, and he wants to remove all duplicate elements and ...

View more
Problem approach

First solution using extra space:
1) We can make a set of integer.
2) Traverse the linked list and store the values in set.
3) After traversal the set will contain all those elements which are unique.
4) We can then copy those elements back to the linked list.

So second optimised solution:
1) Traver...

View more
3. Operating System

What is a semaphore?
What is race condition?

Problem approach

Tip 1 : Be accurate and give real-life examples
Tip 2 : Try to include interviewer in discussion

4. DBMS

Describe all the joins in SQL with a Venn diagram.

Problem approach

Tip 1 : Draw the diagram and explain logic.

5. Is node present?
Easy
10m average time
98% success
0/40

#### For a given Binary Tree of type integer and a number X, find whether a node exists in the tree with data X or not.

Problem approach

1. Start from the root.
2. Compare the searching element with root, if less than root, then recurse for left, else recurse for right.
3. If the element to search is found anywhere, return true, else return false.

6. Shortest path in an unweighted graph
Moderate
25m average time
70% success
0/80
View more
Problem approach

Initially all vertex are unvisited so visited[i] will be false for all i and as no path is yet constructed so distance[i] will be infinity or you can take any value like -1 and set predecessor[i] as -1 for all i.

Now the first vertex to be visited is sourse and distace of Source to source is 0 hence visited[source] = true
distance[source]=0.
queue.push(source).

while there a...

View more
Start a Discussion
Similar interview experiences
Data Scientist
3 rounds | 2 problems
Interviewed by Maersk
597 views
SDE - 1
3 rounds | 3 problems
Interviewed by Maersk
608 views
SDE - Intern
3 rounds | 3 problems
Interviewed by Maersk
521 views
Product Engineer
3 rounds | 5 problems
436 views
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
93442 views