Experis IT Senior .NET Developer Interview Questions and Answers

Q1. Abstract class and interface
Add your answer
Q2. Oops concepts and
Add your answer

Q1. Find circle in linkedList
Ans. 
Use Floyd's Tortoise and Hare algorithm to find a cycle in a linked list.
• Initialize two pointers, slow and fast, at the head of the linked list.

• Move slow pointer by one step and fast pointer by two steps until they meet.

• If they meet, there is a cycle in the linked list.

• Example: 1 -> 2 -> 3 -> 4 -> 2 (cycle at node 2)
Answered by AI
Add your answer
Q2. Tell about one particular feature you worked on
Add your answer

Round duration - 105 minutes
Round difficulty - Medium

There were 3 problems .
One was easy but the other two were of medium level.

Q1. Aggressive Cows
Given an array of length ‘N’, where each element denotes the position of a stall. Now you have ‘N’ stalls and an integer ‘K’ which denotes the number of cows that are aggressive. To prevent...read more
Ans. 
The problem requires assigning aggressive cows to stalls in a way that maximizes the minimum distance between any two cows.
• Sort the array of stall positions in ascending order.

• Use binary search to find the largest minimum distance between cows.

• Check if it is possible to assign cows with this minimum distance by iterating through the sorted array.

• If it is possible, update the maximum distance and continue binary search ...read more
Answered by AI
Add your answer
Q2. Shortest path in an unweighted graph
The city of Ninjaland is analogous to the unweighted graph. The city has ‘N’ houses numbered from 1 to ‘N’ respectively and are connected by M bidirectional roads. If a...read more
Ans. 
The problem is to find the shortest path between two houses in an unweighted graph.
• The graph represents the city of Ninjaland with houses connected by roads.

• The input consists of the number of test cases, number of houses and roads, starting and ending house, and the roads between houses.

• The output is a vector of nodes representing the shortest path from the starting house to the ending house.

• If there are multiple shor...read more
Answered by AI
Add your answer
Q3. Count Set Bits
You are given a positive integer ‘N’. Your task is to find the total number of ‘1’ in the binary representation of all the numbers from 1 to N.
Since the count of ‘1’ can be huge, you are ...read more
Ans. 
The task is to count the total number of '1' in the binary representation of all numbers from 1 to N.
• Convert each number from 1 to N into its binary representation

• Count the number of '1' bits in each binary representation

• Sum up the counts of '1' bits for all numbers

• Return the sum modulo 1e9+7
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The interviewer was very polite and straightforward. 
Firstly he introduced himself and then asked me to introduce myself and then he jumped to the coding problems.
After the coding problems, he asked some questions from the OS and DBMS.

Q1. Reverse Words In A String
You are given a string of length N. You need to reverse the string word by word. There can be multiple spaces between two words and there can be leading or trailing spaces but in ...read more
Ans. 
The task is to reverse the words in a given string, removing any leading or trailing spaces and replacing multiple spaces between words with a single space.
• Split the string into words using spaces as delimiters

• Reverse the order of the words

• Join the reversed words with a single space between them

• Remove any leading or trailing spaces
Answered by AI
Add your answer
Q2. Reverse List In K Groups
You are given a linked list of 'N' nodes and an integer 'K'. You have to reverse the given linked list in groups of size K i.e if the list contains x nodes numbered...read more
Ans. 
The task is to reverse a linked list in groups of size K.
• Iterate through the linked list in groups of size K

• Reverse each group using a helper function

• Connect the reversed groups to form the final reversed linked list
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The interviewer was very polite and straightforward, firstly he introduce himself and then ask me to introduce myself and then ask some ques on my projects and then he jumps to the coding problems.

Q1. Remove Consecutive Duplicates From String
You are given a string 'STR' consisting of lower and upper case characters. You need to remove the consecutive duplicates characters, and return the new st...read more
Ans. 
The task is to remove consecutive duplicate characters from a given string and return the new string.
• Iterate through the characters of the string

• Compare each character with the next character

• If they are the same, skip the next character

• If they are different, add the current character to the new string

• Return the new string
Answered by AI
Add your answer
Q2. Maximum Path Sum in the matrix
You have been given an N*M matrix filled with integer numbers, find the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in th...read more
Ans. 
The question asks to find the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row of a given matrix.
• Iterate through each cell in the first row and calculate the maximum sum path ending at that cell

• For each cell, calculate the maximum sum path ending at that cell by considering the three possible directions

• Store the maximum sum path ending at each cell in a se...read more
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

The round was online. It had 3 coding questions to be solved.  Was asked about why are the javascript and jquery used? What is the difference between angular 8 and angular?

Q1. Permutation In String
You are given two strings named str1 and str2 of length N and M respectively. Find whether string str2 contains one of the permutations of string str1 as its substring. In other words...read more
Ans. Permutation In String
• Check for Base Case i.e if Length of str1 > Length of str2, return false.As substring length is always greater than or equal to permutation never small.
• Generate all the permutations of the short string and then check for each permutation if this string is present as a substring of the second string or not.
• Initialize a global boolean value named flag.
• To generate all the permutations of the small ...read more
Answered Anonymously
Add your answer
Q2. Minimum time
There are ‘N’ junctions connected by ‘M’ bi-directional roads. At most, one road is present between any pair of junctions. There is no road connecting a junction to itself. The travel time for...read more
Ans. Depth First Search
This approach will use DFS(Depth First Search) to make a recursive function in which we pass the currCost, which is the current cost. If the light is not green when we reach that junction, we have to add the waiting time in currCost. After that, we will call the recursive function on all the adjacent unvisited junctions by incrementing the currCost with the weight of the edge. We will maintain a vari...read more
Answered Anonymously
Add your answer
Q3. Rat In A Maze
You are given a starting position for a rat which is stuck in a maze at an initial point (0, 0) (the maze can be thought of as a 2-dimensional plane). The maze would be given in the form of a...read more
Ans. Bactracking
Approach: We can start the traversal of the paths from the rat’s starting position, i.e. (0,0) keeping track of the visited cells during the traversal. We will recursively go through all the paths possible until the last index of the grid (destination) is reached, and add the path information using which the rat successfully reached the end.
 
Algorithm is as follows:
 
1. Take the starting position of th...read more
Answered Anonymously
Add your answer

Q1. What is your family background?
Add your answer
Q2. What are your salary expectations?
Add your answer
Q3. Tell me about yourself.
Add your answer

Round duration - 120 minutes
Round difficulty - Easy

There were few mcqs. MCQs were easy but coding questions were little complex.

Q1. Minimum and Maximum Cost to buy N Candies
Ram went to a specialty candy store in Ninjaland which has 'N' candies with different costs.
The Candy shop gives a special offer to its customers. A cus...read more
Ans. Using Sorting
Let us apply the way that for minimum cost,  Ram buys the candy with minimum cost and then takes top 'K' expensive candies for free.
 
Similarly, for maximum cost, Ram buys the candy with maximum cost and then takes the top 'K' cheapest candies for free.
• For Minimum:
  • Sort the cost array in increasing order.
    Now, until the candies are available:
    → Start picking candies from the left i.e. the cheapest on...read more
Answered Anonymously
Add your answer
Q2. Multiply Linked Lists
Given two numbers represented by linked lists. Your task is to find the multiplied list and return the head of the multiplied list.
The multiplied list is a linked list representati...read more
Ans. Pen-paper approach
The idea is to use the simple method of multiplying two numbers. We multiply two numbers starting from their least significant digit and moving towards the most significant digit. So we need to access the nodes of linked lists from last to first. First step would be to reverse both the linked lists. Then multiply both the linked lists starting from their heads and then reverse the resulting multiplied...read more
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Round was very difficult . I prefer first just try to learn how to operate hackerrank site, only then you can good with it. It was an online coding round. To clear coding rounds you have to clear your basics.

Q1. Right View
You have been given a Binary Tree of integers.
Your task is to print the Right view of it.
The right view of a Binary Tree is a set of nodes visible when the tree is viewed from the Right si...read more
Ans. Recursion
Traverse the tree recursively in such a way that the right subtree is visited before the left subtree. The node whose level is more than the maximum level so far (current level of the tree in traversal -1), prints the node because this is the last node in its level. 
 
Keep track of the maximum level so far in a tree in its recursive calls.
Space Complexity: O(n)Explanation:
O(N), where ‘N’ is the total...read more
Answered Anonymously
Add your answer
Q2. Buy and Sell Stock
You are Harshad Mehta’s friend. He told you the price of a particular stock for the next ‘N’ days. You can either buy or sell a stock. Also, you can only complete at most 2-transactions....read more
Ans. Recursion
This problem can be solved by solving its subproblems and then combining the solutions of the solved subproblems to solve the original problem. We will do this using recursion.
Basically, we have to buy the stock at the minimum possible price and sell at the maximum possible price, keeping in mind that we have to sell the stock before buying it again.
 
 
Below is the detailed algorithm: 
 
1. Call ...read more
Answered Anonymously
Add your answer

Round duration - 35 minutes
Round difficulty - Medium

Basic interview questions, few related to basic domain questions, few from behavioral questions, few from projects. This round was not that much hard.