i
ShareChat
Filter interviews by
I applied via Recruitment Consulltant and was interviewed before Feb 2022. There were 4 interview rounds.
Online platform customer care
I applied via Referral and was interviewed before Nov 2020. There was 1 interview round.
Calculate the average n days retention for all users given their user ID, date, activity table, and a table with the date of joining for each user.
Join the activity table with the user table using the user ID
Calculate the number of days between the date of joining and the activity date
Filter out the activities that occurred after n days
Calculate the average retention for all users
Race 5 horses at a time to find the 5 fastest horses out of 25.
Divide the horses into 5 groups of 5 horses each.
Race all the horses in each group and note down the timings.
The top 3 horses from each group move to the next round.
Race all the horses that made it to the next round and note down the timings.
The top 2 horses from this round move to the final round.
Race these 2 horses and the fastest one is the winner.
The to...
To remove duplicates from two columns, use DISTINCT keyword in SELECT statement.
Use SELECT DISTINCT to retrieve unique combinations of two columns.
Combine the two columns using CONCAT function before applying DISTINCT.
Example: SELECT DISTINCT CONCAT(column1, column2) FROM table_name;
I applied via Company Website and was interviewed before Sep 2021. There were 2 interview rounds.
Language based assignment is necessary for first round and yes it's compulsory to clear.
I applied via Referral and was interviewed in Feb 2021. There were 3 interview rounds.
ShareChat interview questions for popular designations
I applied via Recruitment Consulltant and was interviewed before Jan 2022. There were 2 interview rounds.
Get interview-ready with Top ShareChat Interview Questions
I applied via Approached by Company and was interviewed before Aug 2021. There were 3 interview rounds.
Basics hashing and string arrays questions asked
Recursion test cases
I applied via Approached by Company and was interviewed before Dec 2021. There were 3 interview rounds.
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.
I was interviewed in Sep 2020.
Round duration - 180 Minutes
Round difficulty - Easy
There were 3 coding questions.
1 easy
1 medium
1 hard
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...
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...
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...
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...
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...
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
Round duration - 45 Minutes
Round difficulty - Medium
2 coding questions were asked
2 medium questions
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...
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 ...
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...
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.
Round duration - 60 Minutes
Round difficulty - Easy
1 coding question was asked and resume related and 1 Javascript related question.
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...
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.
Tip 1 : Practice Leetcode medium level questions properly
Tip 2 : Low-level and high-level system design is very important
Tip 3 : Always make notes of core subjects like DBMS, OS, CN beforehand to be able to revise before interviews
Tip 1 : Write the technology about which you know in detail and can discuss pros and cons of using it.
Tip 2 : Prepare your resume well and add 2 good projects for project discussion with good readme file on github.
I applied via Other and was interviewed in Jul 2021. There was 1 interview round.
I applied via Recruitment Consultant and was interviewed in Jul 2021. There were 3 interview rounds.
Top trending discussions
Some of the top questions asked at the ShareChat interview -
The duration of ShareChat interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 68 interviews
Interview experience
based on 593 reviews
Rating in categories
Senior Associate Operations
134
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Associate
122
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Operator
87
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Manager
69
salaries
| ₹0 L/yr - ₹0 L/yr |
Territory Sales Manager
68
salaries
| ₹0 L/yr - ₹0 L/yr |
MOJ
Chingari
Roposo
MX Takatak