Net Solutions Software Engineer Interview Questions and Answers

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

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

Java and python test was there

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

It consists of two questions one is easy and another have medium level

Q1. Interview panel consist of 3 persons and asked about OOPS concepts and implementation in C++
Add your answer
Q2. Asked about use of #define.
Add your answer

40 question some were output question and many questions on Oops concept.

Q1. Basic concept of pointer, automata, operating systems
Add your answer

Includes basic aptitude question with additional questions based on coding languages fundamentals.....

Q1. Question were based on oops concepts. My next question was write a code of binary search and explain it and lastly I was asked an aptitude question ...
Add your answer
Q2. Write a code of binary search and explain it
Ans. 
Binary search is a search algorithm that finds the position of a target value within a sorted array.
• Divide the array into two halves

• Compare the target value with the middle element

• If the target value matches the middle element, return its position

• If the target value is less than the middle element, search the left half of the array

• If the target value is greater than the middle element, search the right half of the arra...read more
Answered by AI
Add your answer

There are basic aptitude questions for freshers level

Q1. Oops concepts, basics of sql
Add your answer
Q2. Basics of programming language
Add your answer