Riya Travel ASP.NET Developer Interview Questions and Answers

Second number from array

Round duration - 60 Minutes
Round difficulty - Medium

The test was in the morning at around 11.
It was on online assessment.
HackerEarth was perfect like everytime.\
MCQ were based on HTML ,CSS , JS, OOPS, SQL, Aptitude, OS.

Q1. 
Reach the Destination Problem Statement
You are given a source point (sx, sy) and a destination point (dx, dy). Determine if it is possible to reach the destination point using only the following valid mo...read more
Ans. Brute force approach
The naive approach to solve this problem is to consider each and every possible move until we reach the destination.
 
This can be done using recursion. Below is the algorithm:
 
• Check for the bases:
  • If the source and destination coordinates are the same, return true.
  • Return false, if the x (or y) coordinate of source point is greater than the x (or y) coordinate of the destination point. As the...read more
Answered Anonymously
Add your answer
Q2. 
Delete Node in Binary Search Tree Problem Statement
You are provided with a Binary Search Tree (BST) containing 'N' nodes with integer data. Your task is to remove a given node from this BST.
A BST is a ...read more
Ans. SUCCESSOR
When we delete a node, three possibilities arise:
 
1. Node to be deleted is a leaf node: Simply remove it from the tree.
2. Node to be deleted has only one child: Copy that child to the node and delete the child.
3. Node to be deleted has two children: Find the inorder successor of the node. Copy contents of the inorder successor to the node and delete the inorder successor.
 
The inorder successor of a node in BS...read more
Answered Anonymously
Add your answer

Round duration - 90 Minutes
Round difficulty - Hard

The interviewer was very friendly. He gave me problems one by one and asked me to write code for all of them in Code Pair round. Explain Scope and Scope Chain in javascript. What is a Stored Procedure in SQL?

Q1. 
Shortest Path in a Binary Matrix Problem Statement
Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only...read more
Ans. Backtracking
To find the shortest path in the Binary Matrix, we search for all possible paths in the Binary Matrix from the source cell to the destination cell until all possibilities are exhausted. We can easily achieve this with the help of backtracking.
 
We start from the given source cell in the matrix and explore all four paths possible and recursively check if they will lead to the destination or not. Out of a...read more
Answered Anonymously
Add your answer
Q2. 
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
...read more
Ans. Brute Force
• Initialize a list to store our results.
• For each element in the array 'ARR[i]', check if ('ARR[i]' + ‘ARR[j]’), equals to given sum or not, where ‘i’ < ‘j’ < ‘N’.
• If the condition matches, add the pair('ARR[i]', ‘ARR[j]’) to the list. Sort the list of pairs as per the given output format and return this list.
Space Complexity: O(1)Explanation:
O(1).
 
Constant extra space is required.
Time Complexity: O...read more
Answered Anonymously
Add your answer
Q3. 
Validate Binary Search Tree (BST)
You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).
BST Definition:
A Binary Search Tr...read more
Ans. BST property
The approach is based on the fact that the value of each node in a BST is greater than the value of all the nodes in the left subtree and smaller than the value of all the nodes in the right subtree.
 
Here is the complete algorithm-
• For each node, we store the minimum and maximum value allowed for that node. Initially, for the root node, the minimum value would be -10^9 and the maximum value should be 10...read more
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

The round was with CTO level person. He was very friendly. What is the difference between SQL and MySQL? What are Constraints in SQL?

Q1. 
Longest Duplicate Substring Problem Statement
You are provided with a string 'S'. The task is to determine the length of the longest duplicate substring within this string. Note that duplicate substrings ...read more
Ans. Approach1
 The key idea is to find all possible substrings and keep the count of all substrings and return the length  longest substring which appears more than once.
 
Algorithm:
• Create an ans variable initial value 0.
• Run a loop from i = 0 to len of(string).
• Inside this loop run a from j = i to length(string).
• Check if the count of substring from i to j appears more than one time. If it appears more than one ...read more
Answered Anonymously
Add your answer
Q2. 
Maximum Sum of Products for Array Rotations
You are given an array ARR consisting of N elements. Your task is to determine the maximum value of the summation of i * ARR[i] among all possible rotations of ...read more
Ans. Brute Force
It’s important to note that, there are only a finite number of unique arrangments of the array possible after applying rotation operations on the array any number of times. So what we can do is find the sum(i*ARR[i]) for all possible rotations and return the maximum among them.
 
Here is the algorithm :
 
1. Create a variable (say, ‘maxSum’) and initialise it to 0.
2. Run a loop from 0 to 'N - 1' (say, iterat...read more
Answered Anonymously
Add your answer

Q1. Discussion about Hashmaps.
Add your answer
Q2. How to make Spring Applications?
Ans. 
Spring applications can be made using Spring Boot, which simplifies the setup and configuration process.
• Use Spring Initializr to create a new Spring Boot project

• Add dependencies in the pom.xml file for required Spring modules

• Create Java classes with annotations like @Controller, @Service, @Repository, etc.

• Define application properties in application.properties or application.yml file

• Run the application using the main m
Answered by AI
Add your answer

Q1. Discussion about Goals.
Add your answer
Q2. Discussed points from Resume
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

2 Coding Questions and 20 MCQ's to be solved in 90 minutes. It was from 6 pm. The camera and screen-recorders were on. The mcq was on web, oops, dbms.

Q1. 
Number of Islands II Problem Statement
You have a 2D grid of dimensions 'N' rows by 'M' columns, initially filled with water. You are given 'Q' queries, where each query contains two integers 'X' and 'Y'....read more
Ans. Brute Force Approach
The idea here is to represent the grid as a graph and all the adjacent land cells are connected via an edge. Finally, do DFS on the grid and find the number of connected components after each query operation.
 
The algorithm is as follows:
1. Declare an ‘ANS’ array to store the number of islands after each query.
2. Declare a 2D array 'GRID' with ‘N’ rows and ‘M’ columns, where ‘GRID[i][j]’ = 0 or 1, 0 r...read more
Answered Anonymously
Add your answer
Q2. 
Make Array Elements Equal Problem Statement
Given an integer array, your objective is to change all elements to the same value, minimizing the cost. The cost of changing an element from x to y is defined ...read more
Ans. Brute Force
In this approach, we will traverse the array for each value between the minimum and maximum value of the array. We will find the cost for each value to make the elements of the array equal to that particular value. We will maintain a variable minimumCost that stores the minimum cost from all these costs. 
 
For example, ARR = [2, 16, 11], then we will find the cost needed to convert every element in ...read more
Answered Anonymously
Add your answer

Round duration - 70 minutes
Round difficulty - Medium

The interview started with the interviewer asking me about my projects and why and what I have used in them. Be very clear with all the technologies you have used in your project as the interviewer will ask you in-depth about it.
Explain Components, Modules and Services in Angular. What is a Recursive Stored Procedure?

Q1. 
Sub Sort Problem Statement
You are given an integer array ARR. Determine the length of the shortest contiguous subarray which, when sorted in ascending order, results in the entire array being sorted in a...read more
Ans. Brute Force
In this approach, we consider every possible subarray that can be formed from the given array ‘ARR’. For every subarray ARR[i … j] considered, we need to check whether this is the smallest unsorted subarray or not.
 
The algorithm is as follows:
1. Let’s take the variable ‘ANS’ equal to 'N' (the length of the array) initially.
2. Now for every subarray ARR[i … j], we will find the maximum and minimum value lying ...read more
Answered Anonymously
Add your answer
Q2. 
Minimum Operations Problem Statement
You are given an array 'ARR' of size 'N' consisting of positive integers. Your task is to determine the minimum number of operations required to make all elements in t...read more
Ans. Brute Force
For making all elements equal you can select a target value and then you can make all elements equal to that. Now, for converting a single element to a target value you can perform a single operation only once. In this manner, you can achieve your task in the maximum of  ‘N’ operations but you have to minimize this number of operations and for this, your selection of target is very important because if ...read more
Answered Anonymously
Add your answer
Q3. 
Tower of Hanoi Problem Statement
You have three rods numbered from 1 to 3, and 'N' disks initially stacked on the first rod in increasing order of their sizes (largest disk at the bottom). Your task is to...read more
Ans. Recursive Approach
The idea is to use recursion to solve the problem. Firstly, we will try to solve this problem for N = 2; we can move a disk from rod 1 to rod 2, then move another disk from rod 1 to rod 2, and then move the disk in rod 2 to rod 3, this way we can move all the disks to rod 3. Now, to solve for N = 3, we can first solve the problem for the first two disks and then move the last disk to another rod and t...read more
Answered Anonymously
Add your answer
Q4. Can you explain the concepts of multithreading and semaphore in operating systems?
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

The interviewer was VP of Engineering at MakeMyTrip with more than 10 years of experience. He asked about the 4 Pillars of OOPS and we had an in-depth discussion with real-life applications for each of them.

Q1. 
Square Root with Decimal Precision Problem Statement
You are provided with two integers, 'N' and 'D'. Your objective is to determine the square root of the number 'N' with a precision up to 'D' decimal pl...read more
Ans. Bruteforce
• We will find the integer part and decimal part of the answer separately.
• First, we will find an integral part.
• We will declare the answer variable where we will store the answer.
• Your answer could be between 1 and N so we will iterate through all the numbers from 1 to N.
  • Let’s say we are currently at number i.
  • If i ^ 2 = N then i is the exact answer so we will return i.
  • If i ^ 2 < N then i could be a possible an...read more
Answered Anonymously
Add your answer