Shriram Group Web Developer Interview Questions and Answers

Round duration - 45 Minutes
Round difficulty - Hard

Q1. 
Find the Duplicate Number Problem Statement
Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there is one number that appears twice. Yo...read more
Ans. 
Find the duplicate number in an integer array containing numbers from 0 to (N - 2).
• Iterate through the array and keep track of the frequency of each number using a hashmap.

• Return the number that appears twice in the array.

• The duplicate number is always present in the given array.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Easy

Q1. 
Bubble Sort Problem Statement
Sort an unsorted array of non-negative integers using the Bubble Sort algorithm, which swaps adjacent elements if they are not in the correct order to sort the array in non-d...read more
Ans. 
Bubble Sort is used to sort an array of non-negative integers in non-decreasing order by swapping adjacent elements if they are not in the correct order.
• Iterate through the array and compare adjacent elements, swapping them if they are in the wrong order.

• Repeat this process until the array is sorted in non-decreasing order.

• Time complexity of Bubble Sort is O(n^2) in worst case.

• Example: For input [6, 2, 8, 4, 10], the o
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. 
Unweighted Graph Shortest Path Problem
You are tasked with finding the shortest path between two houses in the city of Ninjaland, represented as an unweighted graph. The city has N houses numbered from 1 ...read more
Ans. 
Find the shortest path between two houses in a city represented as an unweighted graph.
• Use breadth-first search (BFS) algorithm to find the shortest path in an unweighted graph.

• Start BFS from the source house and keep track of the shortest path to each house.

• Once the destination house is reached, backtrack to find the shortest path.

• Consider using a queue data structure to implement BFS efficiently.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Q1. Questions related to tech stack and easy or medium difficulty questions on problem solving. Based on experience you may asked a simple system design question.
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

It was in the evening at about 7 pm. The test platform was quite user friendly and easy to use.
There were 3 sections in test. One was logical ability, second was english, third was coding 
Questions were of medium difficulty.

Q1. 
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...read more
Ans. 
The task is to find the total number of ways to make change for a specified value using given denominations.
• Use dynamic programming to solve this problem efficiently.

• Create a 1D array to store the number of ways to make change for each value from 0 to the target value.

• Iterate through the denominations and update the array based on the current denomination.

• The final answer will be the value at the target index of the ar
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

It was a 30 minute interview. In which I was provided with questions on data structures and algorithms to check my problem solving skills.

Q1. 
Non-Decreasing Array Problem Statement
Given an integer array ARR of size N, determine if it can be transformed into a non-decreasing array by modifying at most one element.
An array is defined as non-de...read more
Ans. 
Determine if an array can be transformed into a non-decreasing array by modifying at most one element.
• Iterate through the array and check if there are more than one decreasing elements.

• If there is only one decreasing element, check if modifying it can make the array non-decreasing.

• Return true if the array can be made non-decreasing by modifying at most one element, otherwise false.
Answered by AI
Add your answer

Round duration - 40 Minutes
Round difficulty - Medium

In this round , interviewer discussed about my resume. As I had done a internship in sql and database so he asked me questions related to dbms and sql queries.