Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by ShareChat Team. If you also belong to the team, you can get access from here

ShareChat Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

ShareChat Software Developer Interview Questions and Answers

Updated 9 Nov 2024

ShareChat Software Developer Interview Experiences

3 interviews found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in May 2024. There were 2 interview rounds.

Round 1 - Coding Test 

3 question only simple

Round 2 - Technical 

(2 Questions)

  • Q1. Reverse linked list
  • Q2. Detect loop in linked list
  • Ans. 

    Use Floyd's Tortoise and Hare algorithm to detect loop in linked list.

    • Initialize two pointers, slow and fast, at the head of the linked list.

    • Move slow pointer by one step and fast pointer by two steps.

    • If they meet at any point, there is a loop in the linked list.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Be patient

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. JS basics, promise, async await, debounce, etc.

Interview Preparation Tips

Interview preparation tips for other job seekers - Na

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more

I was interviewed in May 2021.

Round 1 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

This round consisted of DSA questions and they were looking for good coding practices.

  • Q1. 

    Aggressive Cows Problem Statement

    Given an array representing positions of stalls and an integer ‘K’ representing the number of aggressive cows, determine the largest minimum distance between any two cows ...

  • Ans. 

    The problem is to assign aggressive cows to stalls in a way that maximizes the minimum distance between any two cows.

    • Sort the array of stall positions in ascending order.

    • Use binary search to find the largest minimum distance between cows.

    • Check if it is possible to assign cows with this minimum distance by iterating through the sorted array.

    • If it is possible, update the maximum distance and continue binary search for a ...

  • Answered by AI
  • Q2. 

    Next Greater Element Problem Statement

    Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...

  • Ans. 

    The task is to find the next greater element for each element in the given array.

    • Iterate through the array from right to left.

    • Use a stack to keep track of the elements that are greater than the current element.

    • For each element, pop elements from the stack until a greater element is found or the stack is empty.

    • If a greater element is found, it is the next greater element for the current element.

    • If the stack becomes empt...

  • Answered by AI
Round 2 - Video Call 

Round duration - 60 Minutes
Round difficulty - Easy

This round consisted of React related questions, javascript questions.

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from J.C. Bose University of Science and Technology, YMCA. I applied for the job as SDE - 1 in BangaloreEligibility criteriaNeed projects in Front endShareChat interview preparation:Topics to prepare for the interview - Data Structures , Javascript , Algorithms , Object Oriented Programming ,Data Base Management System,OSTime required to prepare for the interview - 12 MonthsInterview preparation tips for other job seekers

Tip 1 : Write Production ready code in during the interview
Tip 2 : Study about subjects well.

Application resume tips for other job seekers

Tip 1 : Have good explanations of projects.
Tip 2 : Mention about problem solving skills.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview questions from similar companies

I was interviewed before Apr 2021.

Round 1 - Telephonic Call 

(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

  • Answered by AI
  • Q2. 

    Sort 0 1 2 Problem Statement

    Given an integer array arr of 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).

  • Answered by AI
Round 2 - Face to Face 

(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 ...

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI
Round 3 - Face to Face 

(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

  • Answered by AI
  • 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

  • Answered by AI
  • 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...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in GurgaonEligibility criteriaNo criteriaCars24 interview preparation:Topics to prepare for the interview - Data Structures Algorithms, Javascript, System DesignTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

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)

Application resume tips for other job seekers

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)

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Mar 2022.

Round 1 - Face to Face 

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

Round 2 - Face to Face 

(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.

  • Answered by AI
  • 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...

  • Answered by AI
Round 3 - HR 

Round duration - 60 Minutes
Round difficulty - Easy

HIRING MANAGER ROUND

Discussion about the organisation now questions

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNASwiggy interview preparation:Topics to prepare for the interview - Dynamic Programming, Basic OOPS, Commonly Asked Algorithms (Kadane’s, Dutch National Flag and more), Data Structures (Heaps, Stack, Queues, HashMaps and more), Low Level Design (Machine Coding)Time required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

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

Application resume tips for other job seekers

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)

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before May 2021.

Round 1 - Coding Test 

(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 ARR and a positive integer K, your task is to determine two non-overlapping subarrays of length K that 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

  • Answered by AI
  • 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...

  • Answered by AI
  • Q3. 

    Array Intersection Problem Statement

    Given two integer arrays/ lists ARR1 and ARR2 of sizes N and M respectively, 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

  • Answered by AI
Round 2 - Video Call 

(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...

  • Answered by AI
  • Q2. 

    Arrangement Problem Statement

    Determine the number of permutations of list A = [1, 2, ..., N] such that for every index i, either A[i] is divisible by i or i is divisible by A[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

  • Answered by AI
  • 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 = M

    Input:

    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

  • Answered by AI
Round 3 - Video Call 

(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

  • Answered by AI
Round 4 - HR 

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

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo criteriaMeesho interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, DBMS, Dynamic Programming, Low level designTime required to prepare for the interview - 5 MonthsInterview preparation tips for other job seekers

Tip 1 : Do medium level queustions
Tip 2 : Learn basic system design for startup interviews.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in May 2024. There were 2 interview rounds.

Round 1 - Coding Test 

2 medium - question 1 array and 1 dp
1 med to hard - dynamic programming

Round 2 - Technical 

(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

  • Answered by AI
Interview experience
3
Average
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Nov 2024. There were 2 interview rounds.

Round 1 - Coding Test 

3 coding questions on hackerrank medium to hard

Round 2 - Technical 

(1 Question)

  • Q1. Doctor low level system design question
Interview experience
4
Good
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.

Round 1 - Coding Test 

3 Medium level dsa questions

Round 2 - One-on-one 

(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...

  • Answered by AI
  • Q2. Discussion about online assesment

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare for machine coding rounds.

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Job Portal and was interviewed in May 2024. There was 1 interview round.

Round 1 - Coding Test 

Dsa question based on dp

ShareChat Interview FAQs

How many rounds are there in ShareChat Software Developer interview?
ShareChat interview process usually has 1-2 rounds. The most common rounds in the ShareChat interview process are Technical and Coding Test.
How to prepare for ShareChat Software Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at ShareChat. The most common topics and skills that interviewers at ShareChat expect are Application Integration, Application Software, Computer science, Data Structures and Integration Testing.
What are the top questions asked in ShareChat Software Developer interview?

Some of the top questions asked at the ShareChat Software Developer interview -

  1. Detect loop in linked l...read more
  2. JS basics, promise, async await, debounce, e...read more
  3. Reverse linked l...read more

Tell us how to improve this page.

ShareChat Software Developer Interview Process

based on 3 interviews

Interview experience

4.7
  
Excellent
View more
ShareChat Software Developer Salary
based on 28 salaries
₹20 L/yr - ₹37 L/yr
246% more than the average Software Developer Salary in India
View more details

ShareChat Software Developer Reviews and Ratings

based on 8 reviews

3.4/5

Rating in categories

3.4

Skill development

3.4

Work-life balance

4.0

Salary

2.3

Job security

3.2

Company culture

3.1

Promotions

3.2

Work satisfaction

Explore 8 Reviews and Ratings
Senior Associate Operations
134 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Operations Associate
122 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Lead Operator
87 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Manager
69 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Territory Sales Manager
68 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare ShareChat with

MOJ

3.4
Compare

Chingari

3.7
Compare

Roposo

4.3
Compare

MX Takatak

5.0
Compare
Did you find this page helpful?
Yes No
write
Share an Interview