ShareChat Interview Questions, Process, and Tips

Q1. Basic QA interview questions like 2 yr experience
Add your answer

Q1. QA scenarios discussion
Add your answer

Basics hashing and string arrays questions asked

Recursion test cases

Q1. About mobile automation
Add your answer

Situation based questions on my ideas related to how to connect the platform to the smaller followership creators and get them more active on the platform...basically acting as a link between a music creator and the platform.

Q1. General questions about my recent achievements and how i helped in designing the UI of the sound library as it was my brain child created by ui/ux designers while i worked in Mitron as an executive music p...read more
Add your answer
Q2. Questions about how i came up with campaign ideas , created catchy music for it and got it live on the platform and got good number of creations on it
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. 
Given an integer, find the maximum number of consecutive ones by flipping one bit.
• Iterate through the binary representation of the integer to find the longest sequence of ones.

• Track the current sequence of ones and the previous sequence to determine the maximum length after flipping one bit.

• Update the maximum length whenever a zero is encountered and keep track of the position of the zero for flipping.

• Return the maximu...read more
Answered by AI
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. 
Convert Postfix expression to Prefix expression by reversing the Postfix expression and then traversing it from left to right.
• Reverse the given Postfix expression

• Traverse the reversed expression from left to right

• If an operand is encountered, push it to the stack

• If an operator is encountered, pop two operands from the stack and concatenate them with the operator in the prefix form

• Push the resulting string back to the s...read more
Answered by AI
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. 
Given a set of stations connected by trains, find the cheapest fare from a source to a destination with a maximum number of stops.
• Iterate through all possible routes with up to 'K' stops using DFS or BFS.

• Keep track of the cost for each route and return the minimum cost found.

• If no route is found within the maximum stops, return -1.

• Consider using a graph data structure to represent the stations and trains.

• Handle multipl
Answered by AI
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. 
The task is to determine the number of possible ways to roll all the dice such that the sum of the face-up numbers equals the given 'target' sum.
• Use dynamic programming to solve the problem efficiently.

• Create a 2D array to store the number of ways to achieve each sum with different number of dice.

• Iterate through the dice and sum possibilities to fill up the array.

• Return the result modulo 10^9 + 7.

• Optimize the solution ...read more
Answered by AI
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. 
Find all safe nodes in a directed graph where Ninja stops at an end node in less than 'K' steps.
• Create a graph using the provided edges.

• Perform a depth-first search (DFS) starting from each node to check if it reaches an end node.

• Keep track of visited nodes and end nodes to determine safe nodes.

• Return the safe nodes in sorted order.
Answered by AI
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. 
Find the time it takes for a signal to travel from a given source node to all other nodes in a network.
• Use Dijkstra's algorithm to find the shortest path from the source node to all other nodes.

• Keep track of the minimum time taken to reach each node.

• If it is impossible for the signal to reach all nodes, return -1.
Answered by AI
Add your answer