ShareChat Software Developer Intern Interview Questions, Process, and Tips

Round duration - 90 Minutes
Round difficulty - Hard

Test Description/Instruction as Mentioned on the portal and mail :

1) The test will consist of 3 algorithmic problems.
2) The test time is 1.5 hours in which you will need to solve the 3 problems. The test link will be active from 10:00 AM onwards.
3) Please do not change the tabs since all the actions will be recorded and logged.

Q1. 
Flood Fill Algorithm Task
Assist Ninja in altering the color of a specific region in his photo. Given the image as a 2D array where each pixel is a positive integer, update the color of a specified pixel ...read more
Ans. 
The Flood Fill Algorithm is used to change the color of a particular region in an image and all its adjacent same-colored pixels.
• The image is represented as a 2D array of positive integers

• The starting pixel and new color are given

• Adjacent pixels are connected in up, down, left, or right directions

• Diagonal pixels are not considered adjacent

• Implement the Flood Fill Algorithm to replace the color of the given pixel and it...read more
Answered by AI
View 1 more answer
Q2. 
Kruskal’s Minimum Spanning Tree Algorithm Problem Statement
You are given a connected undirected weighted graph. Your task is to determine the weight of the minimum spanning tree of this graph.
A minimum...read more
Ans. 
The task is to find the weight of the minimum spanning tree of a given connected undirected weighted graph.
• Implement Kruskal's algorithm to find the minimum spanning tree

• Use a disjoint set data structure to keep track of connected components

• Sort the edges in non-decreasing order of their weights

• Iterate through the sorted edges and add them to the minimum spanning tree if they don't create a cycle

• Return the sum of weigh
Answered by AI
Add your answer
Q3. 
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. 
The task is to implement the merge sort algorithm to sort a given sequence of numbers in non-descending order.
• Merge sort is a divide and conquer algorithm that recursively divides the input array into two halves until the size becomes 1.

• Then it merges the two sorted halves to produce a single sorted array.

• The time complexity of merge sort is O(n log n), where n is the size of the input array.

• The algorithm is efficient ...read more
Answered by AI
Add your answer

Round duration - 180 Minutes
Round difficulty - Easy

There were 3 coding questions.
1 easy
1 medium
1 hard

Q1. 
Flip Bit to Win Problem Statement
You are given a task to help ninjas maximize their practice area in a dense forest represented by a sequence of trees (1s) and empty places (0s) in the binary representat...read more
Ans. Brute Force Approach
Approach: The idea is to count a number of ones on both sides of each zero. The required index is the index of zero having a maximum number of ones around it. Following variables are used in implementation:
 
Steps:
1. First, count the total number of zeros and ones present in the binary representation of the number ‘N’.
   • If the total number of zeros is 0 then the longest consecutive number of ones pre...read more
Answered Anonymously
Add your answer
Q2. 
Postfix to Prefix Conversion Problem
Ninja has been given a Postfix expression and requires assistance in converting it to a Prefix expression.
A Postfix expression is formatted such that the operator fo...read more
Ans. Greedy Approach
Here, to convert from postfix to prefix, we can simply use stack data structure. We will be following two conditions as follow:
• If we encounter an operand, then we will push it into the stack
• If we encounter an operator, then we can pop 2 elements from the stack, create a new string in prefix format and push it back to the stack
This process should repeat till the end of prefix expression.
 
Algorithm:
&n...read more
Answered Anonymously
Add your answer
Q3. 
Saving Money Problem Statement
Ninja is adventurous and loves traveling while being mindful of his expenses. Given a set of 'N' stations connected by 'M' trains, each train starting from station 'A' and r...read more
Ans. Dynamic Programming
We can see that for a node, we are finding the ticket price from that node to the destination multiple times, in order to avoid repeated calculations, we store the result in our ‘dp’ matrix.
 
Algorithm:
1. Create a 2D matrix ‘dp’ with K+2 rows and N columns, where dp[i][j] will represent the cheapest price to reach station ‘j’ with maximum ‘i’ stops.
2. Initialise ‘dp’ with an infinite value(INT_MAX).
3. Upd...read more
Answered Anonymously
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

2 coding questions were asked
2 medium questions

Q1. 
Dice Throws Problem Statement
You are given D dice, each having F faces numbered from 1 to F. The task is to determine the number of possible ways to roll all the dice such that the sum of the face-up num...read more
Ans. Brute force
1. The idea is to use recursion to reduce the big problem into several small subproblems.
2. We will call a helper function that returns us the number of combinations that sum upto S and store it in a variable say answer.
3. The algorithm for the helper function will be as follows: 
   
   Int helper(D, F, S):
   A. If D as well as S becomes 0, return 1.
   B. If D becomes 0 or S becomes negative, return 0.
   C. Initialise a count v...read more
Answered Anonymously
Add your answer
Q2. 
Safe Nodes in the Graph
You are provided with a matrix/list called 'EDGES' representing 'E' edges of a directed graph with 'N' nodes. Starting from a node 'START', a character named Ninja walks along a di...read more
Ans. Iterative
The idea behind this approach is we try to find if there is a cycle from the node we start. If we are able to find it, then we will mark that node and remove it, and if we cannot reach it, then after some number of steps, we'll stop.
 
A node will be ultimately safe if all of its outgoing edges to nodes are safe.
We start with the nodes with zero outgoing edges, which are already safe.
We can consider any nod...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

1 coding question was asked and resume related and 1 Javascript related question.

Q1. 
Network Delay Time Problem Statement
Given a network of nodes numbered from 1 to 'N', and 'M' edges. Each edge is represented by three values (u, v, w) where 'u' and 'v' are nodes, and 'w' is an integer r...read more
Ans. Dijkstra's Algorithm based approach.
The basic idea of this approach is to find the shortest path from the source node (‘K’) to each node in the network. We will use Dijkstra’s Algorithm to achieve this task. We will use priority_queue based implementation for this problem.
 
You can refer here for a more detailed explanation of Dijkstra’s Algorithm -
Dijkstra Sparse

 
Now, consider the following steps:
1. Create an ad...read more
Answered Anonymously
Add your answer