Salsify LeetCode Interview Questions
Practice 34 real coding problems frequently asked in Salsify technical interviews. Master these questions to ace your next Salsify software engineering interview.
Top Topics at Salsify
Ace your Salsify interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Salsify Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Random Pick Index 100% | MediumM | Solve→ |
Design HashMap 95% | EasyE | Solve→ |
Maximum Subarray 86% | MediumM | Solve→ |
Zigzag Conversion 83% | MediumM | Solve→ |
Sort Colors 82% | MediumM | Solve→ |
Boundary of Binary Tree 81% | MediumM | Solve→ |
Shortest Palindrome 80% | HardH | Solve→ |
Sort Integers by The Power Value 77% | MediumM | Solve→ |
Plus One 72% | EasyE | Solve→ |
Number of Islands II 71% | HardH | Solve→ |
Lowest Common Ancestor of a Binary Search Tree 69% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Tree 67% | MediumM | Solve→ |
Logger Rate Limiter 66% | EasyE | Solve→ |
Word Ladder II 62% | HardH | Solve→ |
Minimum Difference in Sums After Removal of Elements 61% | HardH | Solve→ |
Remove All Adjacent Duplicates In String 60% | EasyE | Solve→ |
Check If a Word Occurs As a Prefix of Any Word in a Sentence 58% | EasyE | Solve→ |
The kth Factor of n 57% | MediumM | Solve→ |
Search in Rotated Sorted Array 56% | MediumM | Solve→ |
Word Ladder 54% | HardH | Solve→ |
Identify the Largest Outlier in an Array 53% | MediumM | Solve→ |
Populating Next Right Pointers in Each Node 50% | MediumM | Solve→ |
Goat Latin 49% | EasyE | Solve→ |
Zero Array Transformation I 49% | MediumM | Solve→ |
Longest Consecutive Sequence 46% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Sum Root to Leaf Numbers 44% | MediumM | Solve→ |
Same Tree 43% | EasyE | Solve→ |
Check if One String Swap Can Make Strings Equal 41% | EasyE | Solve→ |
Zero Array Transformation III 35% | MediumM | Solve→ |
Flip Columns For Maximum Number of Equal Rows 31% | MediumM | Solve→ |
Sliding Window Maximum 29% | HardH | Solve→ |
Binary Tree Maximum Path Sum 29% | HardH | Solve→ |
Binary Tree Right Side View 28% | MediumM | Solve→ |
Maximum Number of Events That Can Be Attended 23% | MediumM | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Salsify ask in interviews?
Salsify commonly asks 34 coding problems in technical interviews, including Random Pick Index, Design HashMap, Maximum Subarray. The difficulty breakdown is 8 Easy, 19 Medium, and 7 Hard problems.
How should I prepare for a Salsify coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Salsify interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of Salsify coding interviews?
Based on our data, Salsify interviews include 8 Easy (24%), 19 Medium (56%), and 7 Hard (21%) problems.
Ready to ace your Salsify interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required