i
ShareChat
Filter interviews by
I applied via campus placement at SSM College of Engineering & Technology, Komarapalayam and was interviewed before May 2022. There was 1 interview round.
I was interviewed in May 2021.
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.
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...
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
Merge Sort Algorithm -
Merge sor...
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 ...
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 )
I applied via Walk-in and was interviewed before Aug 2022. There were 3 interview rounds.
A User Experience Designer job involves creating intuitive and user-friendly digital experiences. User Experience focuses on the overall experience, while User Interface focuses on the visual aspects.
User Experience Designer focuses on creating intuitive and user-friendly digital experiences for users.
User Experience involves understanding user needs, conducting research, creating wireframes, and testing designs.
User I...
I applied via Recruitment Consulltant and was interviewed before Oct 2022. There were 3 interview rounds.
Minimum cut problem involves finding the minimum number of edges that must be removed to disconnect a graph.
The minimum cut problem is typically solved using algorithms like Karger's algorithm or Ford-Fulkerson algorithm.
The result of the minimum cut problem is a partition of the graph into two sets of vertices.
The minimum cut problem is often used in network flow optimization and graph theory.
Example: In a network of ...
Longest increasing subsequence sum problem
ShareChat interview questions for popular designations
I applied via Approached by Company and was interviewed in Feb 2022. There was 1 interview round.
Get interview-ready with Top ShareChat Interview Questions
I applied via LinkedIn and was interviewed before May 2021. There were 4 interview rounds.
There were 20 MCQ on android
2 coding question
I was interviewed in Mar 2022.
Improving ShareChat
Enhancing user interface for better user experience
Introducing new features like video calling and group chats
Improving content moderation to ensure safety and prevent misinformation
Expanding user base by targeting new demographics and regions
Partnering with brands and influencers for monetization opportunities
I applied via Recruitment Consulltant and was interviewed before Jan 2022. There were 4 interview rounds.
I was interviewed before Apr 2021.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
Tip : Do variants of Binary Search.
The Simple Approach is to find the floor of the square root, try with all-natural numbers starting from 1. Continue incrementing the number until the square of that number is greater than the given number.
Algorithm :
1. Create a variable (counter) i and take care of some base cases, i.e when the given number is 0 or 1.
2. Run a loop until i*i <= n , where n is the given number. Increment i by 1.
3. The floor of t...
The brute force solution is to traverse the entire array and find the minimum. Time Complexity : O(N)
The efficient approach is to use Binary Search. The following pattern can be observed :
• The minimum element is the only element whose previous is greater than it. If there is no previous element, then there is no rotation (the first element is minimum). We check this condition for the middle element by comp...
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via Referral and was interviewed before Mar 2022. There were 2 interview rounds.
A flow chart for prize distribution process
Identify the criteria for winning the prize
Determine the number of winners and their respective prizes
Prepare the prize distribution schedule
Arrange for the prizes to be delivered or collected by the winners
Verify the eligibility of the winners before awarding the prizes
Top trending discussions
Interview experience
based on 577 reviews
Rating in categories
Senior Associate Operations
135
salaries
| ₹4 L/yr - ₹8.8 L/yr |
Operations Associate
104
salaries
| ₹3.5 L/yr - ₹6.1 L/yr |
Lead Operator
82
salaries
| ₹6.5 L/yr - ₹12 L/yr |
Territory Sales Manager
76
salaries
| ₹4 L/yr - ₹8.8 L/yr |
Associate Manager
69
salaries
| ₹9.2 L/yr - ₹18 L/yr |
MOJ
Chingari
Roposo
MX Takatak