- Interview Questions
- /
- Storyblocks
Storyblocks LeetCode Interview Questions
Practice 38 real coding problems frequently asked in Storyblocks technical interviews. Master these questions to ace your next Storyblocks software engineering interview.
Top Topics at Storyblocks
Ace your Storyblocks interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Storyblocks Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Maximum Depth of Binary Tree 100% | EasyE | Solve→ |
Remove All Adjacent Duplicates in String II 96% | MediumM | Solve→ |
Maximum Number of Events That Can Be Attended 84% | MediumM | Solve→ |
Word Break II 82% | HardH | Solve→ |
Regular Expression Matching 80% | HardH | Solve→ |
Two Best Non-Overlapping Events 76% | MediumM | Solve→ |
Continuous Subarray Sum 76% | MediumM | Solve→ |
Search a 2D Matrix 75% | MediumM | Solve→ |
Valid Word Abbreviation 66% | EasyE | Solve→ |
House Robber 66% | MediumM | Solve→ |
Binary Search Tree Iterator 65% | MediumM | Solve→ |
Convert Sorted List to Binary Search Tree 61% | MediumM | Solve→ |
Line Reflection 60% | MediumM | Solve→ |
Zero Array Transformation III 56% | MediumM | Solve→ |
Alien Dictionary 56% | HardH | Solve→ |
Adding Spaces to a String 53% | MediumM | Solve→ |
Pascal's Triangle 52% | EasyE | Solve→ |
Merge k Sorted Lists 51% | HardH | Solve→ |
Find Longest Self-Contained Substring 50% | HardH | Solve→ |
Subarrays with K Different Integers 49% | HardH | Solve→ |
Lowest Common Ancestor of a Binary Tree III 49% | MediumM | Solve→ |
Reverse Integer 46% | MediumM | Solve→ |
Flood Fill 44% | EasyE | Solve→ |
Search Suggestions System 43% | MediumM | Solve→ |
Word Break 42% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Simplify Path 39% | MediumM | Solve→ |
Plus One 38% | EasyE | Solve→ |
IP to CIDR 36% | MediumM | Solve→ |
Find Score of an Array After Marking All Elements 34% | MediumM | Solve→ |
Number of Ships in a Rectangle 34% | HardH | Solve→ |
Longest Consecutive Sequence 33% | MediumM | Solve→ |
Buildings With an Ocean View 33% | MediumM | Solve→ |
Valid Palindrome II 32% | EasyE | Solve→ |
First Missing Positive 29% | HardH | Solve→ |
Subsets II 26% | MediumM | Solve→ |
Rotate Image 24% | MediumM | Solve→ |
Minimum Absolute Difference 21% | EasyE | Solve→ |
Largest Rectangle in Histogram 20% | HardH | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Storyblocks ask in interviews?
Storyblocks commonly asks 38 coding problems in technical interviews, including Maximum Depth of Binary Tree, Remove All Adjacent Duplicates in String II, Maximum Number of Events That Can Be Attended. The difficulty breakdown is 7 Easy, 22 Medium, and 9 Hard problems.
How should I prepare for a Storyblocks coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Storyblocks interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of Storyblocks coding interviews?
Based on our data, Storyblocks interviews include 7 Easy (18%), 22 Medium (58%), and 9 Hard (24%) problems.
Ready to ace your Storyblocks interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required