ShareChat Interview Questions, Process, and Tips

Q1. Minimum cut problem
Ans. 
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 ...read more
Answered by AI
Add your answer
Q2. Binary search tree
Add your answer

Longest increasing subsequence sum problem

There were 20 MCQ on android
2 coding question

Q1. Android interview and some data structure
Add your answer

Q1. Android Interview and some data structure
Add your answer

Q1. Manager round - Have asked design related questions and also have asked LLD as well as merge sort question.
Add your answer

Q1. Question related to tags, notifications on entertainment category on sharechat. How its different from other apps how can v make it better
Add your answer

Q1. The things which can make sharechat better etc
Ans. 
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
Answered by AI
Add your answer

Q1. About my past Experience
Add your answer
Q2. About Technical skills as per my resume
Add your answer

Q1. QA skills based questions on programming
Add your answer
Q2. Real past situation based question & my actions for the problem solution
Add your answer

Q1. Interpersonal & communication skill check
Add your answer
Q2. Salary discussion and negotiation
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA.
Tip : Do variants of Binary Search.

Q1. 
Square Root of an Integer Challenge
Given an integer 'A', the objective is to find the largest non-negative integer whose square is less than or equal to 'A'.
The square of a number is defined as the pro...read more
Ans. 
Find the largest non-negative integer whose square is less than or equal to a given integer.
• Use binary search to efficiently find the square root of the given integer.

• Start with a range from 0 to the given integer and iteratively narrow down the range based on the square of the middle value.

• Return the largest integer whose square is less than or equal to the given integer.
Answered by AI
Add your answer
Q2. 
Find Minimum in Rotated Sorted Array
You are presented with a sorted array that has been rotated an unknown number of times. The nature of this rotation is such that each element shifts to the right with ...read more
Ans. 
Find the smallest element in a rotated sorted array.
• Use binary search to find the pivot point where rotation occurs.

• Compare the element at the pivot point to determine the smallest element.

• Handle cases where the array is not rotated or has only one element.

• Time complexity should be O(log(N)) and space complexity O(1).
Answered by AI
Add your answer

Q1. They will ask you sports and fantasy related question and giving you a situation related to work that how will you handle it.
Add your answer
Q2. You have to make a flow chart of prize distribution process
Ans. 
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
Answered by AI
Add your answer