Snapdeal coding interview
questions, leaked.
3 problems reported across recent Snapdeal interviews. Top patterns: array, dynamic programming, hash table. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Snapdeal's coding assessment is compact. Three problems, mostly medium difficulty, and they're split between two patterns: arrays with dynamic programming on one side, trees with DFS on the other. You're looking at a medium-hard bar, but it's knowable. The problem set is small enough that you can see the shape of what they test. If you blank on array DP during the live assessment, StealthCoder runs invisibly and surfaces a working solution in seconds. But you won't need it if you drill the right two or three patterns first.
Top problems at Snapdeal
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Longest Arithmetic Subsequence | MEDIUM | 100.0 | 49% | Array · Hash Table · Binary Search |
| 02 | Best Time to Buy and Sell Stock | EASY | 67.6 | 55% | Array · Dynamic Programming |
| 03 | Lowest Common Ancestor of a Binary Tree | MEDIUM | 67.6 | 67% | Tree · Depth-First Search · Binary Tree |
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 Snapdeal OA. The proctor cannot see it. Screen share cannot detect it. Made by an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too.
Get StealthCoder- array2 · 67%
- dynamic programming2 · 67%
- hash table1 · 33%
- binary search1 · 33%
- tree1 · 33%
- depth first search1 · 33%
- binary tree1 · 33%
Array and dynamic programming dominate this assessment, appearing in two of the three problems. Longest Arithmetic Subsequence pairs DP with hash tables and binary search, which means you need to think beyond brute force. Best Time to Buy and Sell Stock is the easier entry point and teaches the DP mindset fast. The tree problem (Lowest Common Ancestor) is a classic DFS pattern that feels different on the surface but uses the same recursive thinking. Your edge: spend 60 percent of prep time on array DP, then pivot to tree traversal. Hash tables and binary search appear as sub-patterns, not main events, so don't overstudy them. During the actual assessment, if you hit a wall on the DP problem, StealthCoder is your invisible safety net, reading the problem and delivering a solution while the proctor sees nothing.
Companies with similar patterns
If you prepped for Snapdeal, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Snapdeal.
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. Made by an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Snapdeal interview FAQ
How many array and DP problems should I solve before the Snapdeal assessment?+
They ask two problems that test both skills. Solve at least 5 to 7 array-DP problems that combine subsequence or optimization patterns. Best Time to Buy and Sell Stock is their easier one, so master that first, then move to Longest Arithmetic Subsequence style problems.
Is tree traversal important for this assessment?+
Yes. One of the three problems is Lowest Common Ancestor, a core DFS pattern. Spend 20 to 30 percent of prep drilling tree traversal, especially recursive LCA and path-finding. The other two problems won't ask trees, but this one will test your comfort with recursion and node relationships.
Should I study binary search for Snapdeal?+
It appears as a tool in Longest Arithmetic Subsequence, but it's not the main focus. Know the basics (how to apply it to optimize a search), but don't spend hours on binary search problems. Focus on recognizing when to use it within a DP solution.
What's the hardest topic on their assessment?+
Longest Arithmetic Subsequence combines four topics and is rated medium. It's the ceiling of difficulty. The hard part isn't one topic alone but knowing how to blend array iteration, hash tables, and DP state. The other two problems are more straightforward, so this one is where preparation pays off most.
How should I structure my week of prep for Snapdeal?+
Day 1 to 3, drill array DP: Best Time to Buy and Sell Stock variants, then subsequence problems. Day 4 to 5, master tree DFS and LCA. Day 6, solve Longest Arithmetic Subsequence under timed conditions. Day 7, rest and scan your notes. The problem count is small, so deep preparation on three patterns beats scattered practice.