Problem database last updated: June 20, 2025
7 problems · 1 Easy, 5 Medium, 1 Hard · Ranked #188 of 458
1 Easy
14% · avg 23%
5 Medium
71% · avg 59%
1 Hard
14% · avg 18%
Based on 7 reported problems, Pure Storage interviews are in line with industry averages - 14% Hard vs 18% overall. The majority (71%) 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, Pure Storage puts unusual emphasis on design (28.6% of problems, 4.9x the industry average), dynamic-programming (57.1% of problems, 2.9x the industry average), math (28.6% of problems, 2.3x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are dynamic-programming (57.1%), string (42.9%), math (28.6%), two-pointers (28.6%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Valid Square Given the coordinates of four points in 2D space p1, p2, p3 and p4, return true if the four points construct a square. | Medium | Very Likely | mathgeometry | Solve |
Palindromic Substrings Given a string s, return the number of palindromic substrings in it. | Medium | Very Likely | two-pointersstringdynamic-programming | Solve |
Design Skiplist Design a Skiplist without using any built-in libraries. | Hard | Very Likely | linked-listdesign | Solve |
Maximum Repeating Substring For a string sequence, a string word is k-repeating if word concatenated k times is a substring of sequence. The word's maximum k-repeating value is the highest... | Easy | Likely | stringdynamic-programmingstring-matching | Solve |
Longest Palindromic Substring Given a string s, return the longest palindromic substring in s. | Medium | Likely | two-pointersstringdynamic-programming | Solve |
Insert Delete GetRandom O(1) Implement the RandomizedSet class: | Medium | Likely | arrayhash-tablemath | Solve |
Longest Increasing Subsequence Given an integer array nums, return the length of the longest strictly increasing subsequence. | Medium | Likely | arraybinary-searchdynamic-programming | Solve |
Valid Square
SolveGiven the coordinates of four points in 2D space p1, p2, p3 and p4, return true if the four points construct a square.
Palindromic Substrings
SolveGiven a string s, return the number of palindromic substrings in it.
Design Skiplist
SolveDesign a Skiplist without using any built-in libraries.
Maximum Repeating Substring
SolveFor a string sequence, a string word is k-repeating if word concatenated k times is a substring of sequence. The word's maximum k-repeating value is the highest...
Longest Palindromic Substring
SolveGiven a string s, return the longest palindromic substring in s.
Longest Increasing Subsequence
SolveGiven an integer array nums, return the length of the longest strictly increasing subsequence.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Pure Storage interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Pure Storage interviews focus heavily on dynamic-programming, string, math 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. Pure Storage 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.
Pure Storage has been reported to ask 7 distinct coding problems. The most common topics are dynamic-programming, string, math. 1 are Easy difficulty, 5 are Medium, and 1 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 7 reported problems, Pure Storage interviews are in line with industry averages - 14% Hard vs 18% overall. 71% 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: dynamic-programming, string, math. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Pure Storage coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Pure Storage interview with AIarrow_forward
