i
Maersk
Filter interviews by
What people are saying about Maersk
I appeared for an interview before Feb 2023.
Basic algorithms testing
I applied via Naukri.com and was interviewed in Jun 2024. There was 1 interview round.
Identifying and solving race conditions involves understanding concurrent execution and implementing synchronization mechanisms.
Understand the critical sections of code where race conditions can occur
Use synchronization mechanisms like locks, semaphores, or atomic operations to control access to shared resources
Implement thread-safe data structures or use thread-safe libraries to avoid race conditions
Use tools like sta...
Find the third largest element in an unsorted array of strings.
Sort the array in descending order.
Remove duplicates if necessary.
Return the element at index 2 as the third largest.
posted on 22 Jul 2023
I applied via Recruitment Consulltant and was interviewed in Jun 2023. There were 4 interview rounds.
It was a normal aptitude test with mathematical questions.
It was a techno-coding test where I had to code while sharing my screen on a live conversation with the interviewer.
I would analyze the current approach, identify the root cause of the issue, brainstorm alternative solutions, and collaborate with the team to implement and test them.
Analyze the current approach to identify weaknesses
Brainstorm alternative solutions with the team
Implement and test the new solutions
Regularly communicate and collaborate with team members
I applied via Referral and was interviewed before May 2023. There were 2 interview rounds.
posted on 5 Feb 2024
I applied via Recruitment Consultant and was interviewed in May 2020. There were 3 interview rounds.
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.
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
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...
I applied via Recruitment Consultant and was interviewed in Jun 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed before Dec 2020. There were 4 interview rounds.
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...
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...
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 ...
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Process Expert
2.1k
salaries
| ₹2.2 L/yr - ₹7.2 L/yr |
Senior Process Expert
1.1k
salaries
| ₹2.4 L/yr - ₹8.6 L/yr |
Senior Analyst
1.1k
salaries
| ₹3.7 L/yr - ₹10 L/yr |
Senior Specialist
713
salaries
| ₹4.2 L/yr - ₹14.5 L/yr |
Analyst
702
salaries
| ₹2.5 L/yr - ₹9 L/yr |
Delhivery
Ecom Express
Blue Dart Express
DHL Supply Chain