Problem database last updated: June 20, 2025
3 problems · 1 Easy, 2 Medium, 0 Hard · Ranked #313 of 458
1 Easy
33% · avg 23%
2 Medium
67% · avg 59%
0 Hard
0% · avg 18%
Based on 3 reported problems, Snapdeal interviews are easier than average - only 0% Hard compared to 18% across all companies. The majority (67%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Snapdeal puts unusual emphasis on dynamic-programming (66.7% of problems, 3.4x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (66.7%), dynamic-programming (66.7%), hash-table (33.3%), binary-search (33.3%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Longest Arithmetic Subsequence Given an array nums of integers, return the length of the longest arithmetic subsequence in nums. | Medium | Very Likely | arrayhash-tablebinary-search | Solve |
Best Time to Buy and Sell Stock You are given an array prices where prices[i] is the price of a given stock on the ith day. | Easy | Likely | arraydynamic-programming | Solve |
Lowest Common Ancestor of a Binary Tree Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. | Medium | Likely | treedepth-first-searchbinary-tree | Solve |
Longest Arithmetic Subsequence
SolveGiven an array nums of integers, return the length of the longest arithmetic subsequence in nums.
Best Time to Buy and Sell Stock
SolveYou are given an array prices where prices[i] is the price of a given stock on the ith day.
Lowest Common Ancestor of a Binary Tree
SolveGiven a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Snapdeal interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Snapdeal interviews focus heavily on array, dynamic-programming, hash-table problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Snapdeal interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Snapdeal has been reported to ask 3 distinct coding problems. The most common topics are array, dynamic-programming, hash-table. 1 are Easy difficulty, 2 are Medium, and 0 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 3 reported problems, Snapdeal interviews are easier than average - only 0% Hard compared to 18% across all companies. 67% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, dynamic-programming, hash-table. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Snapdeal coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Snapdeal interview with AIarrow_forward
