Optimize IT Systems Associate Quality Assurance Engineer Interview Questions and Answers

Round duration - 70 Minutes
Round difficulty - Hard

Q1. 
Candies Distribution Problem Statement
Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...read more
Ans. 
The task is to distribute candies to students based on their performance while minimizing the total candies distributed.
• Create an array to store the minimum candies required for each student.

• Iterate through the students' ratings array to determine the minimum candies needed based on the adjacent ratings.

• Consider both left-to-right and right-to-left passes to ensure fair distribution.

• Keep track of the total candies dist
Answered by AI
Add your answer
Q2. 
Merge Sort Problem Statement
You are given a sequence of numbers, ARR. Your task is to return a sorted sequence of ARR in non-descending order using the Merge Sort algorithm.
Explanation:
The Merge Sort...read more
Ans. 
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
• Use Divide and Conquer approach to recursively divide the input array into two halves.

• Merge the sorted halves to produce a completely sorted array.

• Ensure the implementation handles the constraints specified in the problem statement.

• Example: For input [3, 1, 4, 1, 5], the output should be [1, 1, 3, 4, 5].
Answered by AI
Add your answer

Nothing

Q1. Python Sql Linux CLI
Add your answer

Q1. General discussions on learning
Add your answer

Q1. Testing process and java code
Add your answer
Q2. Python machine learning questions
Add your answer

Java and python test was there

2 sum program from Geeks for Geeks

Q1. Ruby basics Eigen class Callbacks
Add your answer
Q2. Lazy and Eagar loading N+1 problem
Ans. 
Lazy loading delays loading of related data until it is specifically requested, while eager loading loads all related data upfront. N+1 problem occurs when lazy loading results in multiple additional queries being made.
• Lazy loading is used to improve performance by only loading related data when needed

• Eager loading loads all related data upfront to reduce the number of queries made

• N+1 problem occurs in lazy loading whe...read more
Answered by AI
Add your answer
Q3. Puzzles
Add your answer

Q1. AWS basics with CI/CD
Add your answer
Q2. Deployment to AWS
Add your answer

Q1. Basic introduction and salary discussion
Add your answer

Easy level questions on string, linked list and array

Q1. Difference between TCP and UDP
Ans. 
TCP is a connection-oriented protocol while UDP is connectionless.
• TCP provides reliable, ordered, and error-checked delivery of data while UDP does not guarantee any of these.

• TCP is slower but more reliable while UDP is faster but less reliable.

• TCP is used for applications that require high reliability and accuracy such as email, file transfer, and web browsing while UDP is used for applications that require speed and ...read more
Answered by AI
Add your answer
Q2. Nibble swap program in C
Ans. 
A nibble swap program in C
• Nibble swap means swapping the 4-bit halves of a byte

• Use bitwise operators to perform the swap

• Example: unsigned char x = 0xAB; x = ((x & 0x0F) << 4) | ((x & 0xF0) >> 4);
Answered by AI
Add your answer

Q1. Reverse Linked List in C
Ans. 
Reverse a linked list in C language.
• Create three pointers: current, previous, and next.

• Traverse the linked list and change the direction of the pointers.

• Return the new head of the reversed linked list.
Answered by AI
Add your answer
Q2. Write an API call in C
Ans. 
API call in C
• Include the necessary header files

• Create a URL string with the required parameters

• Use the curl library to make the API call

• Handle the response data appropriately
Answered by AI
Add your answer

Questions based or percentage, profit loss, ratio

Q1. Explain about stacks
Ans. 
Stacks are a data structure that follows the Last In First Out (LIFO) principle.
• Elements are added and removed from the top of the stack

• Common operations include push (add element) and pop (remove element)

• Stacks can be implemented using arrays or linked lists

• Examples of stack usage include function call stack and undo/redo functionality in text editors
Answered by AI
Add your answer
Q2. To find middle number in the linked list
Ans. 
To find the middle number in a linked list.
• Traverse the linked list using two pointers, one moving twice as fast as the other.

• When the fast pointer reaches the end, the slow pointer will be at the middle node.

• If the linked list has even number of nodes, there will be two middle nodes. Return either one.
Answered by AI
Add your answer

Q1. Introduction , hobbies, goals
Add your answer
Q2. Strength, weakness, short term and long term goals
Add your answer

Programming on basics of C

Programming on basics of C

Q1. Salary details and location preference
Add your answer

Q1. Middleware , dependency injection
Add your answer

Q1. Subject and subject behaviour
Add your answer