codejeet
Blog
Tracker
System Design
Home
/
Companies
/
Snapchat
/
Dynamic Programming
Snapchat Dynamic Programming Questions
15 dynamic programming problems asked at Snapchat interviews
Easy (1)
Medium (6)
Hard (8)
Questions
Title
Difficulty
Acceptance
Frequency
Wildcard Matching
Hard
31.4%
87.5%
Unique Binary Search Trees
Medium
63.3%
87.5%
Word Break II
Hard
55.1%
87.5%
Burst Balloons
Hard
63.0%
87.5%
Combination Sum IV
Medium
55.0%
87.5%
Frog Jump
Hard
47.1%
87.5%
Least Operators to Express Number
Hard
48.7%
87.5%
Best Time to Buy and Sell Stock III
Hard
53.2%
62.5%
Decode Ways
Medium
37.6%
62.5%
Edit Distance
Medium
60.2%
37.5%
Binary Tree Maximum Path Sum
Hard
42.0%
37.5%
Cheapest Flights Within K Stops
Medium
41.4%
37.5%
Number of Ways to Form a Target String Given a Dictionary
Hard
56.6%
37.5%
Minimum Path Sum
Medium
67.8%
37.5%
Best Time to Buy and Sell Stock
Easy
56.4%
37.5%
Showing 15 questions
All Snapchat Questions
All Dynamic Programming Questions