Epsilon DOT NET Developer Interview Questions and Answers for Freshers

Round duration - 90 mins
Round difficulty - Medium

It was the online MCQ round of 90mins and the web cam was on screen was shared and everything was being checked properly where questions related to quant , Ds, oops, java , html was there.

Q1. Basic Interview Questions
It is a automata question in which you have to make the solution of the coding.
Add your answer

Round duration - 120mins
Round difficulty - Hard

It was a coding round of 120 mins where 2 types of question were given which were hard to solve and it was language specified that is we have to do it in java only.

Q1. Minimum Cost to Buy Oranges
You are given a bag of size 'W' kg and provided with the costs of packets with different weights of oranges as a list/array with the name 'cost'. Every i-th posi...read more
Ans. Recursive Approach
Write a recursive function minCostToBuyOrangesHelper(idx, requiredWeight, n) to return the Minimum cost to buy exactly requiredWeight Kg oranges with (idx+1) Kg to N kg packets.
1. Our minimum cost for weight W will be : minCostToBuyOrangesHelper(idx, W, n)
2. Now at any instant (idx, requiredWeight, n), we have two options:
   1. The option of taking this packet:
cost[idx] + minCostToBuyOrangesHelper(idx, requiredWe...read more
Answered by CodingNinjas
View 3 more amswers
Q2. Segregate Odd-Even
There is a wedding ceremony at NinjaLand. The bride and groom want everybody to play a game and thus, they have blindfolded the attendees. The people from the bride’s side are holding od...read more
Ans. Iterative Approach 1
As we have to arrange the nodes such that all the odd nodes should come before all the even nodes, we can move all the even valued nodes from their current positions to the end of the linked list. 
 
Algorithm:
 
• Initialise a pointer ‘LAST_NODE’ by NULL.
• Traverse the linked list to the end and get the last node of the list which will be pointed by ‘LAST_NODE’.
• Initialize a pointer ‘NEW_END’...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 30mins
Round difficulty - Medium

It was the interview round where zoom meeting was done of 30 mins and all the questions were being asked. How properly were be dressed was seen. The environment where we are giving the interview should be silent.

Q1. Basic OS Questions
What is OS?
What is virtual memory?
What is round robin?
Add your answer

Round duration - 40mins
Round difficulty - Easy

It was the 2 technical interview were I was asked about the projects, the technical knowledge and the work I have done during my graduation.

Q1. All prime numbers
You are given a positive integer 'N'. Your task is to return all the prime numbers less than or equal to the 'N'.
Note:
1) A prime number is a number that has only two ...read more
Ans. Brute Force Approach
The idea here is to check every number less than or equal to N is prime or not. Those who are prime just add them in an array and return the array at the end of the function.
 
• Create an empty array named as 'RESULT' to store the prime numbers.
• Run a loop with variable ‘i’ from 2 to ‘N’ and in each iteration do:
  • Check whether ‘i’ is prime or not, call the function 'IS_PRIME'(i), which has a return ...read more
Answered by CodingNinjas
View 2 more amswers
Q2. Linear Search
You have been given a random integer array/list(ARR) of size N, and an integer X. You need to search for the integer X in the given array/list using 'Linear Search'.
 You have been ...read more
Ans. Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
Answered by CodingNinjas
Add your answer

Round duration - 30 mins
Round difficulty - Medium

It was the HR round where HR asked questions related to the resume and the management things.

Q1. Basic HR Questions
Who is your role model?
Where do you see yourself in five years?
Ans. 
Tip 1 : Be patient.
Tip 2 : Dress properly in the formals.
Tip 3 : Be confident and careful about what you say
Answered by CodingNinjas
Add your answer

Round duration - 70 minutes
Round difficulty - Easy

Q1.  Longest Common Subsequence
You have been given two Strings “STR1” and “STR2” of characters. Your task is to find the length of the longest common subsequence.
A String ‘a’ is a subsequence of a String ‘...read more
Ans. Recursive Brute Force
The basic idea of this approach is to break the original problem into sub-problems. Let us assume we want to find the length of the longest common subsequence of “STR1” and “STR2” whose length is ‘N’ and ‘M’ respectively. 
 
Now, let us define a recursive function 
 
LCS(Int I, int J, string STR1, string STR2)
Which returns the length of the longest common subsequence of string STR1...read more
Answered by CodingNinjas
View 3 more amswers
Q2.  Merge Sort
Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.
Example :
Merge Sort Algorithm -

Merge so...read more
Ans. Recursion
The basic idea is that we divide the given ‘ARR’ into two-part call them ‘leftHalves’ and ‘rightHalves’ and call the same function again with both the parts. In the end, we will get sorted ‘leftHaves’ and sorted ‘righthalves’ which we merge both of them and return a merged sorted ‘ARR’.
We implement this approach with a divide and conquer strategy.
 
Here is the algorithm : 
 
1. Divide ‘ARR’ into two-p...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 30 minutes
Round difficulty - Easy

Q1. General Questions
It was easy he(interviewer) just gave me some situations and want to check my logical and lastly he asked me about myself.
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

It was early morning around 9:00AM-9:30AM. Questions was mostly from aptitude and coding based. Level of questions were moderate.

Q1. Count Subsequence
You have been given an integer array/list 'ARR' of size 'N'. Your task is to return the total number of those subsequences of the array in which all the elements are equal...read more
Ans. Brute Force
The idea is to generate all the subsequences and check whether the elements present are equal or not.
 
Here is the algorithm :
 
1. Generate all the subsequences of the given array.
2. Maintain a variable ‘COUNT’ which stores the total number of subsequences in which all the elements are equal.
3. Iterate over each of the generated subsequences.
   1. In case all the elements of the current subsequence are equal, we in...read more
Answered by CodingNinjas
View 1 more amswer
Q2. Minimum Operations
You are given an array 'ARR' of 'N' positive integers. You need to find the minimum number of operations needed to make all elements of the array equal. You can perform a...read more
Ans. 
The minimum number of operations needed to make all elements of the array equal by performing addition, multiplication, subtraction, or division on any element.
• Iterate through the array and find the maximum and minimum values

• Calculate the difference between the maximum and minimum values

• Check if the difference is divisible by the length of the array

• If divisible, return the difference divided by the length

• If not divisib...read more
Answered by AI
View 3 more amswers

Round duration - 20 minutes
Round difficulty - Easy

It was late night. Interviewer was asking tricky questions to confuse me. This round is probing to personality rather than practical knowledge.

Q1. Basic HR Questions
Tell Me About a Time You Failed.
What Are You Passionate About?
Ans. 
Tip 1 : Try to keep yourself calm
Tip 2 : Be natural while giving your interview
Tip 3 : Think before you speak
Answered by CodingNinjas
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

Q1. Count Subsequences
You have been given an integer array/list 'ARR' of size 'N'. Your task is to return the total number of those subsequences of the array in which all the elements are equa...read more
Ans. Brute Force
The idea is to generate all the subsequences and check whether the elements present are equal or not.
 
Here is the algorithm :
 
1. Generate all the subsequences of the given array.
2. Maintain a variable ‘COUNT’ which stores the total number of subsequences in which all the elements are equal.
3. Iterate over each of the generated subsequences.
   1. In case all the elements of the current subsequence are equal, we in...read more
Answered by CodingNinjas
View 1 more amswer