Zymr Systems Devops Engineer Interview Questions and Answers

Q1. Question on linkedlist, remove duplicates
Add your answer
Q2. House robber 2,3
Add your answer

Q1. Self introduction
Add your answer
Q2. Project description
Ans. 
Developed a web application for tracking personal fitness goals and progress.
• Used React.js for front-end development

• Implemented RESTful APIs for data retrieval and storage

• Utilized MongoDB for database management
Answered by AI
Add your answer

Q1. Questions on project
Add your answer
Q2. Any problems faced
Ans. 
Yes, faced challenges with debugging complex code and integrating third-party APIs.
• Debugging complex code with multiple dependencies

• Integrating third-party APIs with inconsistent documentation

• Resolving compatibility issues between different software components
Answered by AI
Add your answer

Coding Rount
DSA Round + Puzzle
SQL + Project Discussion
JS

Q1. Previous experience, resume related questions
Add your answer
Q2. SOLID principles, Design Patterns, OOPS concepts and basic coding questions,
Add your answer

Basic Aptitude questions like quantitative and logical

Programs have to written for given questions

Q1. F2F interview programming questions were asked
Add your answer
Q2. Questions were asked about projects and technology used in project
Add your answer

The test contains basic programming output questions and some aptitude questions.

We have to solve 5 programming questions in 1 hour. Questions are on arrays and strings.

Q1. Parenthesis balancing Reversing the string Finding the angle between hour and minute hand of clock
Ans. 
Three technical questions related to string manipulation and clock calculations.
• For parenthesis balancing, use a stack data structure to keep track of opening and closing brackets.

• To reverse a string, use two pointers starting from the beginning and end of the string and swap characters until they meet in the middle.

• To find the angle between hour and minute hand of clock, use the formula (30H - 11/2M) degrees, where H ...read more
Answered by AI
Add your answer
Q2. Prime no Add all digits in a number
Ans. 
The question asks to check if a number is prime and add all its digits.
• To check if a number is prime, we can use a loop to divide it by all numbers from 2 to its square root.

• If the number is divisible by any of these numbers, it is not prime.

• To add all digits in a number, we can use a loop to extract each digit and add it to a running total.
Answered by AI
Add your answer

20 questions were given.
aptitude + simple coding output based.

5 questions were shared on a doc file. We need to code them paste their solutions in the file. Level was easy to medium. Array-string based Questions.

Q1. There Were 3 Technical rounds. In 1st Round Basic coding Questions were Asked on Array like find minimum angle between hour and minute hand. 0,1 array sort and there was another question too which I don't...read more
Add your answer
Q2. Find minimum angle between hour and minute hand.
Add your answer
Q3. 0, 1 array sort (keep complexity low)
Add your answer

Q1. Then on next day Technical Round 2 happened Same another Interviewer and same process. Round was 1 hour long. I was given a question and I had to solve it. I was not asked puzzles but some of my friends we...read more
Add your answer
Q2. Maximum span of 1 in a 0,1 array
Ans. 
Find the maximum span of 1 in a 0,1 array.
• Iterate through the array and keep track of the first and last occurrence of 1.

• Calculate the difference between the last and first occurrence of 1.

• Repeat the process for all 1's in the array and return the maximum difference.
Answered by AI
Add your answer
Q3. Upside down triangle pattern
Add your answer

Q1. Next day Technical Round 3 This time my interviewer was a Senior Engineer Interview round was 1 hour+ I was given 2 coding questions then hr questions were asked. In hr they asked me a lot regarding my pro...read more
Add your answer
Q2. First non repeating Character
Add your answer
Q3. Sort a binary array using one traversal and no extra space
Ans. 
Sort a binary array using one traversal and no extra space.
• Use two pointers, one starting from the beginning and one from the end of the array.

• Swap the elements if the left pointer points to 1 and the right pointer points to 0.

• Continue traversing until the pointers meet in the middle.
Answered by AI
View 1 more answer