AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
ShareChat
Compare
Filter interviews by
ShareChat Software Developer Intern Interview Questions, Process, and Tips for Freshers
Top ShareChat Software Developer Intern Interview Questions and Answers for Freshers
- 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 for Freshers
2 interviews found
Anonymous
I appeared for an interview 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 appeared for an interview 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
Interview questions from similar companies
I appeared for an interview 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 appeared for an interview before Sep 2020.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Easy
- Q1.
0/1 Knapsack Problem Statement
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
- Ans.
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
- Q2.
Find the Second Largest Element
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
Example:
Input:
ARR = [2,...
- Ans.
Find the second largest element in an array of integers.
Iterate through the array to find the largest and second largest elements.
Handle cases where all elements are identical.
Return -1 if a second largest element does not exist.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
System Design Round
- Q1. Design a system for Twitter, discussing its architecture, key components, and scalability considerations.
- Ans.
Design a scalable system for Twitter with key components and architecture.
Use microservices architecture for scalability and fault isolation.
Key components include user service, tweet service, timeline service, and notification service.
Use a distributed database like Cassandra for storing tweets and user data.
Implement a message queue like Kafka for handling real-time updates and notifications.
Use a caching layer like ...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality
Interview Preparation Tips
Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.
Tip 1 : Mention what you know
Tip 2 : Good previous work to showcase
Skills evaluated in this interview
I appeared for an interview in Apr 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
The round consisted of 2 coding Problems and it lasted for 60 minutes from 12:00 PM to 1:00 PM on Hackerearth.
Use of other IDEs was prohibited and video was on.
- Q1.
Implement indexOf Function
You are provided with two strings
AandB. Your task is to find the index of the first occurrence ofAwithinB. IfAis not found inB, return -1.Example:
Input:
A = "bc", ...
- Ans.
Implement a function to find the index of the first occurrence of one string within another string.
Iterate through the second string and check if a substring of the same length as the first string matches the first string.
Return the index of the first occurrence of the first string within the second string, or -1 if not found.
Handle edge cases like empty strings or when the first string is longer than the second string
- Q2.
Problem: Search In Rotated Sorted Array
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer
Qqueries. Each query is represented by an integerQ[i], and you must ... - Ans.
Search for integers in a rotated sorted array efficiently.
Implement binary search to find the target integer in the rotated array.
Handle the rotation by checking which side of the array is sorted before performing binary search.
Return the index of the target integer if found, else return -1.
Time complexity of O(logN) is required for each query.
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
The round was conducted on Google Meet with 2 interviewers . They were friendly and helpful.
The timing was 12:00 to 1:00 PM.
Our Video was on .
- Q1.
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.
Calculate the number of distinct subsequences in a string with possible duplicates.
Use dynamic programming to keep track of the count of distinct subsequences for each character in the string.
Consider the cases where the current character is included or excluded in the subsequence.
Handle duplicates by considering the previous occurrence of the character.
Return the count of distinct subsequences modulo 10^9 + 7.
Round duration - 60 minutes
Round difficulty - Easy
This was a Behavioral Round. It lasted for 45-50 minutes. It consisted of a discussion on my projects. The interviewer was very impressed by the way I explained my projects. She even appreciated me for that. This was followed by normal HR questions .Timing of This round was 4:00 PM to 5:00 PM
Interview Preparation Tips
Tip 1 : I prepared all topics from my Coding Ninjas Course - Competitive Programming
Tip 2 : I practiced 300+ questions on CodeZen ( Coding Ninjas Platform), LeetCode, InterviewBit
Tip 3 : I took part in contests on CodeForces.
Tip 4 : Apart from Data Structures and Algorithms , I also studied DBMS, OOPs and other course subjects
Tip 1 : Keep Resume up to date for the role you are applying.
Tip 2 : Mention atleast 1 project or past work experience.
Tip 3 : Try to keep a 1 pager resume.
Skills evaluated in this interview
I applied via Campus Placement and was interviewed in Jul 2024. There were 4 interview rounds.
It was a coding round where i need to solve 3 DSA Questions in 1.5 hour
(2 Questions)
- Q1. This is Technical round where i was asked to implement the Two Question of Dsa one is bases on greedy and another is dp , another one is leetcode hard (finding maxaimal area of rectangle in matrix of 1 and...
- Q2. Greedy Q was direct i don't remember clearly. I was selected for the 2nd round
(1 Question)
- Q1. It was also a technical round but bases on LLD problem statement. I was given a problem statement to design a society security system and the they need psudo code for complete implementation using correct ...
(1 Question)
- Q1. I was not selected for 4th round but heard that there were Q on cs fundamentals.
Karan Gupta
In test I had to solve 3 dsa questions in 1 hour
(1 Question)
- Q1. I have asked 2 DSA questions in my interview
I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.
3 Moderate questions were asked. I managed to solve 2 completely and 1 partially.
(2 Questions)
- Q1. Question related to system design were asked.
- Q2. He asked me to design some functions of facebook.
(1 Question)
- Q1. Introduction type questions were asked. In this it will prefer only CS students
(1 Question)
- Q1. It was based on dynamic programming
Interview Preparation Tips
I appeared for an interview in Mar 2022.
Round duration - 120 Minutes
Round difficulty - Medium
Machine Coding Round
2 Hours in Total
15 Mins for Question Explaination and Doubts
1.5 Hours for coding
15 mins to discuss the approach
Timing - 3 to 5 pm (They are flexible)
Interviewer was very patient and helped me understand the question
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
2 Data Strucutre Questions
Timing 5-6 pm (They are flexible)
Google Meet
Online IDE
- Q1.
Unique Binary Search Trees Problem Statement
Given an integer 'N', your task is to compute the number of structurally unique BSTs (binary search trees) that can be formed using an exact number of 'N' uniq...
- Ans.
The task is to compute the number of structurally unique BSTs that can be formed using an exact number of unique values.
Use dynamic programming to solve the problem efficiently.
The number of structurally unique BSTs can be calculated using Catalan numbers.
For N nodes, the number of structurally unique BSTs is given by the Nth Catalan number.
Example: For N=3, the number of structurally unique BSTs is 5.
- Q2.
Subsequences of String Problem Statement
You are provided with a string
'STR'that consists of lowercase English letters ranging from 'a' to 'z'. Your task is to determine all non-empty possible subsequen... - Ans.
Generate all possible subsequences of a given string.
Use recursion to generate all possible subsequences by including or excluding each character in the string.
Maintain a current index to keep track of the characters being considered.
Append the current character to each subsequence generated so far.
Recursively call the function with the next index to include or exclude the next character.
Base case: When the current ind...
Round duration - 60 Minutes
Round difficulty - Easy
HIRING MANAGER ROUND
Discussion about the organisation now questions
Interview Preparation Tips
Tip 1 : Practice is they to success, every person will need a different path for preparation, the resources that you should use will depend upon your current expertise.
Tip 2 : For Machine Coding Rounds speed is key, you need to practice atleast 20 questions, Try to figure out techniques to common out code, code out your first question, and then spend good 2-3 hours in reducing no of lines and removing redundancy, try to note down methods you used to achieve less redundancy and for all the next questions you practice try to achieve that same quality from the beginning which will automatically increase your speed
Tip 3 : Do company wise preparation, look for interview experiences and try to map out commonly asked questions and categories of those questions and practice accordingly
Tip 1 : If applying for any non FE role (or any role that does not require designing or creative skills) keep a minimalistic resume
Tip 2 : Ensure to add a summary at the top which mentions all the criterias HRs consider while short listing resumes (Experience, Degree and Branch, Languages you have experience in, City, Willingness to Relocate, Notice Period, If already on notice period mention your last working day)
Skills evaluated in this interview
ShareChat Interview FAQs
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
143
salaries
|  ₹4 L/yr - ₹9 L/yr |
|
Operations Associate
125
salaries
| ₹3.5 L/yr - ₹6.1 L/yr |
|
Lead Operator
87
salaries
| ₹6 L/yr - ₹12.7 L/yr |
|
Territory Sales Manager
68
salaries
| ₹4 L/yr - ₹8.8 L/yr |
|
Associate Product Manager
62
salaries
| ₹14.5 L/yr - ₹41 L/yr |
Udaan
Swiggy
CARS24
BlackBuck
- Home >
- Interviews >
- ShareChat Interview Questions >
- ShareChat Software Developer Intern Interview Questions for Fresher
