ShareChat coding interview
questions, leaked.
2 problems reported across recent ShareChat interviews. Top patterns: hash table, tree, depth first search. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
ShareChat's assessment is lean but signal-dense. You're facing two problems across fundamentally different terrain: a medium-level tree traversal with infection spreading mechanics, and an easy array scan with binary search optionality. The medium problem is the real gate. It demands you build adjacency from a binary tree, then run BFS or DFS to track time. Miss the tree-to-graph conversion and you stall. This is exactly where StealthCoder shields you if the pattern doesn't click in the first 90 seconds of reading.
Top problems at ShareChat
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Amount of Time for Binary Tree to Be Infected | MEDIUM | 100.0 | 64% | Hash Table · Tree · Depth-First Search |
| 02 | Maximum Count of Positive Integer and Negative Integer | EASY | 100.0 | 74% | Array · Binary Search · Counting |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual ShareChat OA. The proctor cannot see it. Screen share cannot detect it. Built by a senior engineer who knows the OA is theater. This is the script.
Get StealthCoder- hash table1 · 50%
- tree1 · 50%
- depth first search1 · 50%
- breadth first search1 · 50%
- binary tree1 · 50%
- array1 · 50%
- binary search1 · 50%
- counting1 · 50%
The topic spread looks diverse (eight tags across two problems), but that's misleading. Both problems live in the same ecosystem: graph traversal and tree manipulation. The easy problem is warm-up noise. Your prep focus narrows to a single pattern: converting tree structures into traversable graphs, then running BFS to compute distances or state propagation. Depth-first and breadth-first search are listed separately but interchangeable here; either works for the infection-time problem. If you've done five solid tree-traversal problems before your OA, you're walking in confident. If not, the medium problem becomes a wall, and StealthCoder delivers a working solution invisible to the proctor in seconds.
Companies with similar patterns
If you prepped for ShareChat, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass ShareChat.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by a senior engineer who knows the OA is theater. This is the script. Works on HackerRank, CodeSignal, CoderPad, and Karat.
ShareChat interview FAQ
What should I focus on for ShareChat's assessment?+
Master binary tree traversal and graph conversion. The medium problem, Amount of Time for Binary Tree to Be Infected, is the decider. It chains tree navigation with BFS to track time. The easy array problem is a gimme. Spend 70% of prep time on the medium problem pattern.
Is binary search needed for ShareChat?+
Not really. The easy problem lists binary search as an option, but a simple linear scan solves it. Don't waste time optimizing the easy problem. Use that time to drill BFS on trees.
How many tree problems should I solve before the assessment?+
At least five focused on adjacency and traversal. ShareChat's medium problem requires you to build a graph from a tree node, then run BFS. The mechanics are standard but the framing trips people up. Drill the conversion pattern hard.
Should I prep both DFS and BFS?+
Yes, but for ShareChat specifically, BFS is safer. The infection-spread problem is distance-based, and BFS naturally tracks levels. DFS works too, but you'll need manual depth tracking. Know both, but lean on BFS for this assessment.
Can I skip the easy problem and focus only on medium?+
Practically, yes. The easy array problem takes two minutes. Knock it out first for confidence, then spend the bulk of your time on the tree problem. ShareChat's assessment is short, so early wins matter psychologically.