Narola Infotech QA Engineer Trainee Interview Questions and Answers

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

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

2 medium hard level questions. We just have to code and explain it. Platform doesn't have compilers.

Good Knowledge of DSA is required

Q1. Given an array Reverse array
Ans. 
Reverse array of strings
• Iterate through the array and swap elements from start to end

• Use two pointers, one at the beginning and one at the end, and swap elements until they meet
Answered by AI
Add your answer
Q2. Giaven a string Reverse string
Ans. 
Reverse a given string
• Use built-in functions like reverse() or loop through the string in reverse order

• Create a new string and append characters from the original string in reverse order

• Convert the string to an array of characters, reverse the array, and then join it back into a string
Answered by AI
Add your answer
Q3. Given array find sum of all elements
Ans. 
Calculate sum of all elements in a given array of strings
• Iterate through the array and convert each element to integer before adding to sum

• Handle edge cases like empty array or non-numeric elements

• Return the final sum after iterating through all elements
Answered by AI
Add your answer