Maersk Senior UX Designer Interview Questions and Answers

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.

Q1. I was primarily asked about managerial questions on adaptability to new technology and creativity if existing solutions don't work.
Add your answer
Q2. In a situation where your team is not getting a proper result with existing approach your team uses, how would you try to fix it?
Ans. 
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
Answered by AI
Add your answer

Q1. Csharp basics and a coding questing was given to implement
Add your answer
Q2. .net and angular basics questions
Add your answer

Q1. Asked deeply about my resume and technologies
Add your answer
Q2. Coding question to sort a given array using DSA
Add your answer

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
Add your answer
Q2. Project related questions.
Add your answer

Q1. DSA ROUND - DP problem
Ans. 
Dynamic Programming problem involving finding the maximum sum of non-adjacent elements in an array.
• Use dynamic programming to keep track of the maximum sum at each index.

• At each index, the maximum sum is either the current element plus the sum two indices back, or the sum at the previous index.

• Example: For array [2, 4, 6, 2, 5], the maximum sum of non-adjacent elements is 13 (2 + 6 + 5).
Answered by AI
Add your answer
Q2. DSA ROUND - STRING PROBLEM
Ans. 
Find the longest common prefix among an array of strings.
• Iterate through the characters of the first string and compare with other strings

• Return the prefix when characters don't match or reach end of any string

• Example: Input - ['flower', 'flow', 'flight'], Output - 'fl'
Answered by AI
Add your answer

Q1. PROJECT RELATED QUESTIONS
Add your answer
Q2. DESIGN LRU CACHE
Ans. 
LRU cache is a data structure that stores the most recently used items.
• Use a doubly linked list to keep track of the order of items based on their usage.

• Use a hashmap to quickly access items in the cache.

• When a new item is accessed, move it to the front of the linked list.

• If the cache is full, remove the least recently used item from the end of the linked list.
Answered by AI
Add your answer