Premium Employer

i

This company page is being actively managed by Maersk Team. If you also belong to the team, you can get access from here

Maersk Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Maersk Software Developer Interview Questions, Process, and Tips

Updated 6 Jun 2024

Top Maersk Software Developer Interview Questions and Answers

  • Q1. Sort 0s, 1s, and 2s Problem Statement You are provided with an integer array/list ARR of size 'N' which consists solely of 0s, 1s, and 2s. Your task is to write a soluti ...read more
  • Q2. Fourth Largest Element in the Array Given an array consisting of integers, your task is to determine the fourth largest element in the array. If the array does not conta ...read more
  • Q3. Binary Tree Node Presence Problem Determine if a node with a given integer value X exists in a specified binary tree. Input: The first line of each test case contains th ...read more
View all 9 questions

Maersk Software Developer Interview Experiences

4 interviews found

Software Developer Interview Questions & Answers

user image Mamatha Dilish

posted on 6 Jun 2024

Interview experience
4
Good
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Naukri.com and was interviewed in May 2024. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. What is decorator in python
  • Ans. 

    Decorator in Python is a design pattern that allows adding new functionality to an existing object without modifying its structure.

    • Decorators are functions that take another function as an argument and extend its behavior without explicitly modifying it.

    • They are commonly used to add logging, timing, caching, or authentication to functions.

    • Syntax for using decorators in Python involves using the @ symbol followed by the...

  • Answered by AI
  • Q2. What is yeild in python
  • Ans. 

    yield is a keyword in Python used in generator functions to return a value without terminating the function

    • yield is used in generator functions to produce a series of values over time

    • When a generator function is called, it returns an iterator object but does not start execution immediately

    • Each time the yield statement is reached, the function's state is saved, and the value is returned to the caller

    • Execution of the fun...

  • Answered by AI

Interview Preparation Tips

Topics to prepare for Maersk Software Developer interview:
  • Python
  • Simulation

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(2 Questions)

  • Q1. .net C#, Design pattern,Azure Angular ,
  • Q2. Web Api, SQL Entity Framework

Interview Preparation Tips

Interview preparation tips for other job seekers - Focus on new technology and get updated. Logically think and then explain the scenario

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Validate Binary Tree Nodes Problem You are provided with 'N' bina ... read more

I applied via Approached by Company and was interviewed in Apr 2022. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(3 Questions)

  • Q1. Involved coding based on the skill set
  • Q2. Questions based on scenario, basic concepts.
  • Q3. Questions to test the depth of understanding of any technology
Round 3 - Behavioral 

(1 Question)

  • Q1. Architecture of current project
  • Ans. 

    The current project follows a microservices architecture.

    • The project is divided into multiple small services that communicate with each other through APIs.

    • Each service is responsible for a specific functionality.

    • The services are deployed independently and can be scaled as per the demand.

    • The project uses Docker containers for easy deployment and management.

    • The communication between services is secured using HTTPS protoc...

  • Answered by AI
Round 4 - HR 

(1 Question)

  • Q1. Salary discussion based on the role

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare all the concepts with good understanding.
Try coding and understanding all the basic concepts and patterns

I appeared for an interview in Jan 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 95 minutes
Round difficulty - Medium

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.

  • Q1. 

    Fourth Largest Element in the Array

    Given an array consisting of integers, your task is to determine the fourth largest element in the array. If the array does not contain at least four distinct elements,...

  • Ans. 

    Find the fourth largest element in an array, return -2147483648 if not enough distinct elements.

    • Sort the array in descending order

    • Return the fourth element if it exists, else return -2147483648

  • Answered by AI
Round 2 - Face to Face 

(5 Questions)

Round duration - 45 minutes
Round difficulty - Medium

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.

  • Q1. 

    Sort 0s, 1s, and 2s Problem Statement

    You are provided with an integer array/list ARR of size 'N' which consists solely of 0s, 1s, and 2s. Your task is to write a solution to sort this array/list.

    Input:

    ...
  • Ans. 

    Sort an array of 0s, 1s, and 2s in linear time with a single scan approach.

    • Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.

    • Iterate through the array once and swap elements based on their values and the pointers.

    • After the single scan, the array will be sorted in place with 0s, 1s, and 2s in order.

  • Answered by AI
  • Q2. 

    Remove Duplicates Problem Statement

    You are given an array of integers. The task is to remove all duplicate elements and return the array while maintaining the order in which the elements were provided.

    ...

  • Ans. 

    Remove duplicates from an array while maintaining order.

    • Use a set to keep track of unique elements.

    • Iterate through the array and add elements to the set if not already present.

    • Convert the set back to an array to maintain order.

  • Answered by AI
  • Q3. Can you describe all the joins in SQL and illustrate them with a Venn diagram?
  • Ans. 

    SQL joins are used to combine rows from two or more tables based on a related column between them.

    • Inner Join: Returns rows when there is at least one match in both tables.

    • Left Join: Returns all rows from the left table and the matched rows from the right table.

    • Right Join: Returns all rows from the right table and the matched rows from the left table.

    • Full Outer Join: Returns rows when there is a match in one of the tabl...

  • Answered by AI
  • Q4. 

    Binary Tree Node Presence Problem

    Determine if a node with a given integer value X exists in a specified binary tree.

    Input:

    The first line of each test case contains the binary tree nodes in level orde...
  • Ans. 

    Check if a node with a given value exists in a binary tree.

    • Traverse the binary tree using depth-first search (DFS) or breadth-first search (BFS) to search for the node with the given value.

    • Use a recursive or iterative approach to implement the search algorithm.

    • Return 'true' if the node with the given value is found, otherwise return 'false'.

  • Answered by AI
  • Q5. 

    Shortest Path in an Unweighted Graph

    The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road...

  • Ans. 

    Find the shortest path in an unweighted graph from house 'S' to house 'T'.

    • Use Breadth First Search (BFS) algorithm to find the shortest path in an unweighted graph.

    • Create a queue to store the current house and its neighbors, and a visited set to keep track of visited houses.

    • Start BFS from house 'S' and stop when reaching house 'T'.

    • Return the path from 'S' to 'T' once 'T' is reached.

    • If multiple shortest paths exist, ret

  • Answered by AI

Interview Preparation Tips

Eligibility criteria7 cgpa and no backlogsMaersk interview preparation:Topics to prepare for the interview - Aptitude, SQL, Data structure, Dynamic Programming, Recursion, C++, Logical reasoningTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

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

Application resume tips for other job seekers

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

Final outcome of the interviewSelected

Skills evaluated in this interview

Maersk interview questions for designations

 Software Developer Intern

 (1)

 Senior Software Developer

 (1)

 Software Engineer

 (10)

 Senior Software Engineer

 (8)

 Software Engineer III

 (2)

 Software Testing Engineer

 (1)

 Software Engineering Lead

 (1)

 Senior Sse Software Engineering Analyst

 (1)

Interview questions from similar companies

I applied via Recruitment Consultant and was interviewed in May 2020. There were 3 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. What is diameter of Binary Tree? Write full working code.
  • Ans. 

    Diameter of a binary tree is the longest path between any two leaf nodes.

    • Calculate the height of left and right subtrees recursively.

    • Calculate the diameter recursively using the formula max(left_height + right_height + 1, max(left_diameter, right_diameter)).

    • Return the maximum diameter.

  • Answered by AI
  • Q2. Find interchanged terms from an AP, where terms are arranged in series
  • Ans. 

    To find interchanged terms from an AP series

    • Identify the common difference between terms

    • Swap the positions of adjacent terms

    • Check if the new series is also an AP

    • Repeat until no more interchanged terms can be found

  • Answered by AI
  • Q3. Explain database indexing
  • Ans. 

    Database indexing is a technique to improve the performance of database queries.

    • Indexing creates a data structure that allows for faster retrieval of data.

    • Indexes are created on one or more columns of a table.

    • Queries that use indexed columns can be executed faster.

    • Indexes can be clustered or non-clustered.

    • Clustered indexes determine the physical order of data in a table.

    • Non-clustered indexes create a separate structure...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well on basic data structures, operating systems and database.

Skills evaluated in this interview

I applied via Recruitment Consultant and was interviewed in Jun 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Basic to intermediate questions on data structures and django.

Interview Preparation Tips

Interview preparation tips for other job seekers - Interview process easy.

I applied via Campus Placement and was interviewed before Dec 2020. There were 4 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Design a stack that support getmin in O(1) time and O(1) space complexities
  • Ans. 

    Design a stack that supports getmin in O(1) time and O(1) space complexities.

    • Use two stacks, one for storing the actual values and the other for storing the minimum values.

    • When pushing a new value, check if it is smaller than the current minimum value and push it to the minimum stack if it is.

    • When popping a value, check if it is the current minimum value and pop it from the minimum stack if it is.

    • To get the minimum val...

  • Answered by AI
  • Q2. Questions related OS and DBMS
  • Q3. Binary tree traversal
  • Ans. 

    Binary tree traversal is the process of visiting each node in a binary tree exactly once in a specific order.

    • There are three main types of binary tree traversal: inorder, preorder, and postorder.

    • Inorder traversal visits the left subtree, then the root, then the right subtree.

    • Preorder traversal visits the root, then the left subtree, then the right subtree.

    • Postorder traversal visits the left subtree, then the right subt...

  • Answered by AI
  • Q4. LRU cache explanation
  • Ans. 

    LRU cache is a data structure that stores the most recently used items and discards the least recently used items.

    • LRU stands for Least Recently Used

    • It has a fixed size and when the cache is full, the least recently used item is removed to make space for a new item

    • It uses a combination of a doubly linked list and a hash map to achieve O(1) time complexity for both insertion and deletion

    • Example: A web browser cache that ...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Good with your programming skills and fundamentals.

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Video Call 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This was a Data Structures round. Both questions were answered in optimal time complexity with clean code. Every other question was answered to the best of my knowledge

  • Q1. 

    Rotting Oranges Problem Statement

    You are given an undirected and disconnected graph G(V, E) with V vertices numbered from 0 to V-1 and E edges. Your task is to perform a BFS traversal starting from the 0...

  • Ans. 

    Perform BFS traversal on an undirected and disconnected graph starting from vertex 0.

    • Implement BFS traversal algorithm starting from vertex 0

    • Use a queue to keep track of visited nodes and their neighbors

    • Print the traversal order in sorted order for each node's connected nodes

  • Answered by AI
  • Q2. 

    Smallest Integer Not Representable as Subset Sum

    Given a non-decreasing sorted array ARR of N positive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from...

  • Ans. 

    Find the smallest positive integer that cannot be expressed as the sum of elements from any proper subset of a non-decreasing sorted array of positive numbers.

    • Start with the smallest possible sum that can be represented, which is 1.

    • Iterate through the array and update the smallest sum that cannot be represented.

    • Return the final smallest sum that cannot be represented.

  • Answered by AI
  • Q3. 

    BFS Traversal in a Graph

    Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...

  • Ans. 

    BFS traversal of an undirected and disconnected graph starting from vertex 0.

    • Implement BFS algorithm to traverse the graph starting from vertex 0.

    • Use a queue to keep track of visited nodes and their neighbors.

    • Ensure to visit all connected components of the graph.

    • Print the BFS traversal sequence for each test case in a separate line.

    • Handle cases where not all vertices are reachable from vertex 0.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 100 minutes
Round difficulty - Easy

Mostly technical and System Design questions were asked.

  • Q1. Design an LRU (Least Recently Used) cache.
  • Ans. 

    Design an LRU cache to store least recently used items efficiently.

    • Use a combination of a doubly linked list and a hashmap to store and retrieve items in O(1) time complexity.

    • When an item is accessed, move it to the front of the linked list to mark it as the most recently used.

    • If the cache is full, remove the least recently used item from the end of the linked list and the hashmap.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Guru Gobind Singh Indraprastha University. I applied for the job as SDE - 1 in GurgaonEligibility criteria1+ year of ExperienceDelhivery interview preparation:Topics to prepare for the interview - DS, Algorithms, OOPS, Dynamic Programming, System Design, Java SpringTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Practice At least 300 questions
Tip 2 : Build Resume according to Job Description 
Tip 3 : Working with Big Data/Distributed Systems is a Plus

Application resume tips for other job seekers

Tip 1 : Skills relevant to Job Description 
Tip 2 : Do not put false things on a resume, in-depth of knowledge of everything there on the resume

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Indeed and was interviewed in Oct 2023. There was 1 interview round.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Behavioural and Experience based questions
  • Q2. Tell be about a time sort of stuff

Interview Preparation Tips

Interview preparation tips for other job seekers - Be sure of your work
Interview experience
3
Average
Difficulty level
Hard
Process Duration
4-6 weeks
Result
Not Selected

I applied via Company Website and was interviewed in Apr 2024. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Introduce yourself.
  • Ans. 

    I am a software developer with 5 years of experience in Java and Python.

    • Experienced in Java and Python programming languages

    • Worked on various projects involving web development and data analysis

    • Familiar with Agile methodologies and version control systems like Git

  • Answered by AI
  • Q2. Project related questions.

Maersk Interview FAQs

How many rounds are there in Maersk Software Developer interview?
Maersk interview process usually has 2-3 rounds. The most common rounds in the Maersk interview process are Technical, Resume Shortlist and Behavioral.
How to prepare for Maersk Software Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Maersk. The most common topics and skills that interviewers at Maersk expect are Groovy, Java, SAP CPI and SAP PI PO.
What are the top questions asked in Maersk Software Developer interview?

Some of the top questions asked at the Maersk Software Developer interview -

  1. What is decorator in pyt...read more
  2. What is yeild in pyt...read more
  3. Architecture of current proj...read more

Tell us how to improve this page.

Maersk Software Developer Interview Process

based on 2 interviews

Interview experience

4.5
  
Good
View more
Join Maersk Improving life for all by integrating the world
Maersk Software Developer Salary
based on 38 salaries
₹11 L/yr - ₹46 L/yr
204% more than the average Software Developer Salary in India
View more details

Maersk Software Developer Reviews and Ratings

based on 12 reviews

3.5/5

Rating in categories

2.8

Skill development

3.9

Work-life balance

4.0

Salary

2.7

Job security

3.8

Company culture

2.6

Promotions

3.1

Work satisfaction

Explore 12 Reviews and Ratings
Process Expert
2.1k salaries
unlock blur

₹2.2 L/yr - ₹7.2 L/yr

Senior Process Expert
1.1k salaries
unlock blur

₹2.4 L/yr - ₹8.6 L/yr

Senior Analyst
1.1k salaries
unlock blur

₹3.7 L/yr - ₹10 L/yr

Senior Specialist
716 salaries
unlock blur

₹4.2 L/yr - ₹14.5 L/yr

Analyst
708 salaries
unlock blur

₹2.5 L/yr - ₹9 L/yr

Explore more salaries
Compare Maersk with

Delhivery

3.8
Compare

Ecom Express

3.8
Compare

Blue Dart Express

4.0
Compare

DHL Supply Chain

4.1
Compare
Did you find this page helpful?
Yes No
write
Share an Interview