
Maersk

10+ Maersk Interview Questions and Answers for Freshers
Q1. What is Purchase order
A purchase order is a document issued by a buyer to a seller, indicating types, quantities, and agreed prices for products or services.
It is a legally binding document
It outlines the details of the products or services being purchased
It includes quantities, prices, delivery dates, and terms of payment
It serves as a record of the transaction between the buyer and seller
Q2. 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:
The fi...read more
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.
Q3. 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, retur...read more
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
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 order sequen...read more
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'.
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 conne...read more
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, return any one of them.
Q6. 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.
Example...read more
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.
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 tables.
Cross Join: Returns the Cartesian product of the two ta...read more
Q8. Write a query to display students record in ascending order of thier name and descending order of thier subject
Query to display students record in ascending order of name and descending order of subject.
Use ORDER BY clause to sort the records
Specify ASC for name and DESC for subject in the ORDER BY clause
Example: SELECT * FROM students ORDER BY name ASC, subject DESC
Q9. What is Linear and non linear ds
Linear data structures have elements arranged in a sequential order, while non-linear data structures have elements connected in a non-sequential manner.
Linear data structures include arrays, linked lists, queues, and stacks.
Non-linear data structures include trees, graphs, and heaps.
Linear data structures have a single path to traverse elements, while non-linear data structures have multiple paths.
Q10. Objected Oriented Programming and its real life usage
Object Oriented Programming is a programming paradigm that uses objects to design applications.
Encapsulation: Bundling data and methods that operate on the data together.
Inheritance: Creating new classes based on existing classes.
Polymorphism: Using a single interface to represent different data types or objects.
Real life example: Creating a car class with properties like speed and methods like accelerate.
Q11. give your strength and weekness
My strength is my ability to lead and motivate a team. My weakness is my tendency to be too detail-oriented.
Strength: I have experience leading teams and have a knack for motivating individuals to work towards a common goal.
Weakness: I tend to get caught up in the details and can sometimes lose sight of the bigger picture. I am working on delegating tasks more effectively to avoid this.
Q12. General rule of accounting
General rule of accounting is the principle that financial transactions should be recorded accurately and consistently.
The general rule of accounting is to follow the principles of consistency, accuracy, and transparency.
Transactions should be recorded in a timely manner to reflect the true financial position of the company.
Accounting standards such as GAAP and IFRS provide guidelines for following the general rule of accounting.
Examples include recording revenue when it is e...read more
Q13. Current location
I am currently located in New York City.
New York City
Manhattan
East Coast
Q14. What is data base sharding?
Database sharding is a method of splitting and distributing a database across multiple servers to improve performance and scalability.
Sharding involves dividing a database into smaller, more manageable parts called shards.
Each shard contains a subset of the data, allowing for parallel processing and improved performance.
Sharding helps distribute the workload across multiple servers, reducing the burden on individual servers.
Examples of sharding include partitioning a database...read more
Q15. Explain SQL vs NoSQL
More about working at Maersk




Top HR Questions asked in Maersk for Freshers
Interview Process at Maersk for Freshers

Top Interview Questions from Similar Companies








Reviews
Interviews
Salaries
Users/Month

