Maersk Software Developer Interview Questions, Process, and Tips

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...read more
Answered by AI
Add your answer
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...read more
Answered by AI
Add your answer

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

Q1. Involved coding based on the skill set
Add your answer
Q2. Questions based on scenario, basic concepts.
Add your answer
Q3. Questions to test the depth of understanding of any technology
Add your answer

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...read more
Answered by AI
Add your answer

Q1. Salary discussion based on the role
Add your answer

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,...read more
Add your answer

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:
...read more
Add your answer
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.
...read more
Add your answer
Q3. Can you describe all the joins in SQL and illustrate them with a Venn diagram?
Add your answer
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...read more
Add your answer
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...read more
Add your answer