AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
ShareChat
Compare
Filter interviews by
Clear (1)
ShareChat Software Developer Intern Interview Questions, Process, and Tips
Top ShareChat Software Developer Intern Interview Questions and Answers
- 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, upd ...read more
- Q2. 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' ...read more
- Q3. 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 span ...read more
ShareChat Software Developer Intern Interview Experiences
2 interviews found
Anonymous
I was interviewed in May 2021.
(3 Questions)
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 ...
- 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...
- 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...
- 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
- Q3.
Merge Sort Problem Statement
You are given a sequence of numbers,
ARR. Your task is to return a sorted sequence ofARRin non-descending order using the Merge Sort algorithm.Explanation:
The Merge Sort...
- 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 ...
Interview Preparation Tips
Tip 1 : Practice Atleast 300 Questions on leetcode (150 easy, 100 medium and 50 hard )
Tip 2 : Make atleast one big project which includes (DB, backend and frontend). Because in Hiring Manager round we have to discuss our resume for about 45mins to 1 Hr so having 1 or 2 big projects on the resume is always good to have otherwise HM will go towards core subjects Like OOP/OS/Networks which are often tricky.
Tip 3 : Think out of the box while solving a Question think of all the variants in which this questions can be asked. Let's take an example of simple question like two sum here we have to find a pair in an array whose sum is equal to given value. Now what if Interviewer asked to find three numbers instead of 2 or maybe find k numbers whose sum is equal to a given number. So it is always good to think out of the box and generalise the solution.
Tip 4 : Always try to solve each question in different ways. You should know both the bruteforce solution and the optimal one.
Tip 5 : When you solve a Question try to learn as much possible from a single Question for eg if you try to solve a Tree question then it is good to know both the iterative and recursive solution as sometimes Interviewer may introduce some constraints that due to huge test case recursive solution is not possible.
Tip 6 : 3-4 days before the interview start preparing using interviewbit as it contains all the important questions topic wise. I usually solve Interviewbit before the interview. No doubt Leetcode is good in terms of UI, Test cases and Easy to use but Interviewbit is more organised. I myself have done all the Interviewbit Questions multiple times.
Tip 1 : Try to add Experience at the top with detailed explanation of work done by you
Tip 2 : If No Experience: try to add more and more personal projects with the skills required in JD
Tip 3 : If No projects and Experience: Try to add Coding profiles, Achievements (Hackathons and Coding Competitions )
Skills evaluated in this interview
I was interviewed in Sep 2020.
(3 Questions)
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...
- 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...
- 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...
- 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...
- 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...
- 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
(2 Questions)
Round duration - 45 Minutes
Round difficulty - Medium
2 coding questions were asked
2 medium questions
- Q1.
Dice Throws Problem Statement
You are given
Ddice, each havingFfaces numbered from 1 toF. The task is to determine the number of possible ways to roll all the dice such that the sum of the face-up num... - 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 ...
- 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...
- 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.
(1 Question)
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...
- 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.
Interview Preparation Tips
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.
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
I was interviewed before Apr 2021.
(2 Questions)
Round duration - 45 Minutes
Round difficulty - Medium
It was in the mid day and since I applied for a Frontend role the discussion was majorly around data structure and bit of Javascript.
The interviewer was helping and good listener.
- Q1.
Merge Two Sorted Linked Lists Problem Statement
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
... - Ans.
Merge two sorted linked lists into a single sorted linked list without using additional space.
Create a dummy node to start the merged list
Compare the values of the two linked lists and add the smaller value to the merged list
Move the pointer of the merged list and the pointer of the smaller value list
Continue this process until one of the lists is fully traversed
Append the remaining elements of the other list to the me
- Q2.
Sort 0 1 2 Problem Statement
Given an integer array
arrof size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.Input:
The first line contains an integer 'T' representing the n... - Ans.
Sort an array of 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.
Swap elements based on the values encountered to sort the array in-place.
Time complexity should be O(N) and space complexity should be O(1).
(3 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
It was more of a in depth round on the framework I'm working on and problem solving.
- Q1. What is the event loop and what is its significance?
- Ans.
The event loop is a mechanism in programming that allows for asynchronous execution of code.
The event loop is a key component in JavaScript's runtime environment, responsible for handling asynchronous operations.
It continuously checks the call stack for any pending tasks and executes them in a non-blocking manner.
The event loop ensures that the program remains responsive by allowing other code to run while waiting for ...
- Q2. Can you provide examples of output-based questions in JavaScript that utilize browser APIs?
- Ans.
Output-based questions in JavaScript using browser APIs
Example 1: Write a script that uses the Geolocation API to display the user's current location on a map
Example 2: Create a program that uses the Web Audio API to play a sound when a button is clicked
Example 3: Develop a web page that uses the Canvas API to draw a simple animation
- Q3. How would you design a system to support localization in a mobile app?
- Ans.
Designing a system to support localization in a mobile app
Use resource files to store localized strings for different languages
Implement a language selection feature for users to choose their preferred language
Utilize localization libraries or frameworks to streamline the process
Consider cultural differences when localizing content, such as date formats and currency symbols
(3 Questions)
Round duration - 75 Minutes
Round difficulty - Hard
It was more of a fitment/managerial round.
Didn't had any coding questions, but was asked more on approaches and optimisations.
Discussions on the project you have worked on.
- Q1. You need to find the fastest 3 horses out of a group, given that you can only race 5 horses at a time. How would you approach this problem?
- Ans.
To find the fastest 3 horses out of a group with 5 horses racing at a time, we can use a tournament style approach.
Divide the horses into groups of 5 and race them against each other. This will give you the fastest horse in each group.
Take the winners from each group and race them against each other. The top 3 horses in this final race will be the fastest 3 overall.
Keep track of the results and compare the timings to d
- Q2. How do you debug the root cause of lag on a screen?
- Ans.
To debug lag on a screen, analyze code, check for memory leaks, optimize rendering, and use profiling tools.
Analyze code to identify any inefficient algorithms or operations causing lag.
Check for memory leaks that could be impacting performance.
Optimize rendering by reducing the number of draw calls, optimizing shaders, and minimizing overdraw.
Use profiling tools like Xcode Instruments or Android Profiler to identify p
- Q3. Can you explain the architecture of the app you have recently worked on?
- Ans.
The app I recently worked on is a social media platform for sharing photos and connecting with friends.
The app follows a client-server architecture, with the client being the mobile app and the server handling data storage and processing.
The client side is built using React Native for cross-platform compatibility.
The server side is implemented using Node.js with a MongoDB database for storing user data and photos.
The a...
Interview Preparation Tips
Tip 1 : Get your JS fundamentals right (if applying for a Frontend role, https://javascript.info/ is a good start)
Tip 2 : Apart from preparing data structures, practise on the communication skills as well (prepare your introduction, be a good listener and on spot improvisation plays key roles)
Tip 1 : highlight projects related to the job profile in your resume and mention what was your contribution in them precisely in 1/2 lines.
Tip 2 : Include URLs to applications/projects that you have build and your achievements/blog (if any)
Skills evaluated in this interview
I was interviewed before May 2021.
(3 Questions)
Round duration - 150 Minutes
Round difficulty - Medium
3 coding questions and 20 mcq's
- Q1.
Maximum Sum of Two Non-Overlapping Subarrays
Given an integer array
ARRand a positive integerK, your task is to determine two non-overlapping subarrays of lengthKthat yield the maximum combined sum....
- Ans.
The task is to find two non-overlapping subarrays of length K in an array, such that their sum is maximum.
Iterate through the array and calculate the sum of each subarray of length K
Store the maximum sum obtained from the first subarray
Iterate again and calculate the sum of each subarray of length K, excluding the previous subarray
Store the maximum sum obtained from the second subarray
Return the sum of the two maximum
- Q2.
Distinct Subsequences Problem Statement
You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.
Exampl...
- Ans.
The task is to find the count of distinct subsequences in a given string.
Use dynamic programming to solve the problem.
Create a 2D array to store the count of distinct subsequences for each prefix of the string.
Initialize the first row of the array with 1, as there is only one subsequence of an empty string.
For each character in the string, calculate the count of distinct subsequences by considering two cases: including...
- Q3.
Array Intersection Problem Statement
Given two integer arrays/ lists
ARR1andARR2of sizesNandMrespectively, you are required to determine their intersection. An intersection is defined as the set of... - Ans.
The task is to find the intersection of two integer arrays/lists.
Read the number of test cases
For each test case, read the size and elements of the first array/list
Read the size and elements of the second array/list
Find the intersection of the two arrays/lists
Print the intersection elements in the order they appear in the first array/list
(3 Questions)
Round duration - 120 Minutes
Round difficulty - Medium
Online video call based round, Timing was 10-11 AM
Interview started with basic greetings, post that i explained by projects in brief and then we jumped right into dsa questoins.
- Q1.
Number of Islands Problem Statement
You are given a non-empty grid that consists of only 0s and 1s. Your task is to determine the number of islands in this grid.
An island is defined as a group of 1s (re...
- Ans.
The task is to find the number of islands in a grid consisting of 0s and 1s.
An island is a group of 1s connected horizontally, vertically, or diagonally
The grid is surrounded by 0s on all four edges
Use a depth-first search (DFS) or breadth-first search (BFS) algorithm to traverse the grid and count the number of islands
Initialize a visited array to keep track of visited cells
For each unvisited cell with a value of 1, p...
- Q2.
Arrangement Problem Statement
Determine the number of permutations of list
A= [1, 2, ..., N] such that for every indexi, eitherA[i]is divisible byioriis divisible byA[i].Input:
The input start... - Ans.
The goal is to find the number of permutations of a list satisfying certain conditions.
Iterate through all permutations of the list
Check if each permutation satisfies the given conditions
Count the number of permutations that satisfy the conditions
Return the count for each test case
- Q3.
Idempotent Matrix Verification
Determine if a given N * N matrix is an idempotent matrix. A matrix is considered idempotent if it satisfies the following condition:
M * M = MInput:
The first line cont...
- Ans.
An idempotent matrix is a square matrix that remains unchanged when multiplied by itself.
Check if the given matrix satisfies the property M*M = M
Iterate through each element of the matrix and perform the matrix multiplication
Compare the result with the original matrix
If they are equal, return true; otherwise, return false
(1 Question)
Round duration - 120 Minutes
Round difficulty - Easy
This was EM round, started with me explaining my projects in deep and facing some counter questions on that, proceeded to os, dbms basic questions and some low level designing and lastly a puzzle to end interview.
- Q1. Can you design an attendance management system?
- Ans.
Design attendance management system
Create a database to store employee information
Implement a user interface for employees to mark their attendance
Develop a system to track and record attendance data
Generate reports and analytics based on attendance data
Round duration - 20 Minutes
Round difficulty - Easy
This was formality round, HR came and explained what meesho does and told my joining dates and compensation details.
Interview Preparation Tips
Tip 1 : Do medium level queustions
Tip 2 : Learn basic system design for startup interviews.
Tip 1 : Put things on your resume that you know by your heart, otherwise will have a lot of difficulty in the HM round.
Tip 2 : Do not mention co-curricular activities on your resume.
Skills evaluated in this interview
(2 Questions)
- Q1. Implement an immutable class.
- Ans.
An immutable class is a class whose instances cannot be modified after creation.
Use final keyword for class declaration to prevent inheritance
Make all fields private and final to prevent modification
Do not provide setter methods, only getter methods should be used
- Q2. Implement a springboot service that intercepts http requests.
- Ans.
Implement a Springboot service to intercept HTTP requests.
Create a Springboot application with necessary dependencies.
Implement a custom interceptor by extending HandlerInterceptorAdapter.
Override preHandle and postHandle methods to intercept requests and responses.
Register the interceptor in the WebMvcConfigurerAdapter configuration class.
Skills evaluated in this interview
I applied via Campus Placement and was interviewed in Nov 2024. There were 2 interview rounds.
3 coding questions on hackerrank medium to hard
(1 Question)
- Q1. Doctor low level system design question
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
3 Medium level dsa questions
(2 Questions)
- Q1. Lld of cab booking system
- Ans.
The Low Level Design (LLD) of a cab booking system involves detailing the system architecture and components at a lower level of abstraction.
Identify the main components of the system such as user interface, booking engine, payment gateway, and driver allocation algorithm.
Define the interactions between these components and how data flows between them.
Specify the data structures and algorithms used for efficient bookin...
- Q2. Discussion about online assesment
Interview Preparation Tips
Skills evaluated in this interview
I applied via Campus Placement and was interviewed in May 2024. There were 2 interview rounds.
2 medium - question 1 array and 1 dp
1 med to hard - dynamic programming
(2 Questions)
- Q1. System design LLD - Polling System
- Q2. How to implement Concurrency in it.
- Ans.
Concurrency in software development allows multiple tasks to run simultaneously, improving performance and responsiveness.
Use multithreading to execute multiple tasks concurrently
Implement asynchronous programming to handle tasks that may take longer to complete
Use synchronization techniques like locks and semaphores to manage access to shared resources
Consider using thread pools to manage and reuse threads efficiently
I applied via Job Portal and was interviewed in May 2024. There was 1 interview round.
Dsa question based on dp
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
3 coding question
2 medium 1 hard
(2 Questions)
- Q1. Online polling system based on OOPs
- Q2. Explaining the above code
ShareChat Interview FAQs
Recently Viewed
INTERVIEWS
ShareChat
No Interviews
INTERVIEWS
DENSO
No Interviews
INTERVIEWS
Revature
No Interviews
INTERVIEWS
JSW Energy
No Interviews
INTERVIEWS
DENSO
5.6k top interview questions
INTERVIEWS
JSW Energy
No Interviews
INTERVIEWS
Revature
No Interviews
INTERVIEWS
DENSO
No Interviews
INTERVIEWS
Revature
No Interviews
INTERVIEWS
Walmart Labs
No Interviews
Tell us how to improve this page.
ShareChat Interviews By Designations
- ShareChat Senior Software Engineer Interview Questions
- ShareChat SDE-2 Interview Questions
- ShareChat Associate Product Manager Interview Questions
- ShareChat Software Developer Interview Questions
- ShareChat Production Analyst Interview Questions
- ShareChat Operations Associate Interview Questions
- ShareChat Data Analyst Interview Questions
- ShareChat Senior Associate Operations Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Senior Software Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Softwaretest Engineer Interview Questions
- Software Engineer Trainee Interview Questions
- Software Developer Interview Questions
- Software Development Engineer Interview Questions
- Junior Software Developer Interview Questions
- Show more
Interview Questions from Similar Companies
Fast track your campus placements
|
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
- Home >
- Interviews >
- ShareChat Interview Questions >
- ShareChat Software Developer Intern Interview Questions
