← Back to Directory

Pure Storage

Large Enterprises

Screna has 10 Pure Storage interview write-ups. The most reported round is the technical phone screen (6).

10 interview notes · updated Jun 2026

Pure Storage·Software Engineer·Technical Phone Screen

Jun 2026
Pure Storage coding interview for a software engineer role. One problem, but the optimization discussion went through multiple layers and the interviewer was pretty reasonable about not demanding a closed-form solution.
  • Given a grid, count the number of squares (of any size) it contains. Optimize your solution.

“Started brute force, which was obviously slow.”

View Post

Pure Storage·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Pure Storage system design round, one meaty question about building a timer/scheduler from scratch. The kind of problem that seems manageable until you start talking about clock sources and ordering guarantees.
  • Design an event scheduling system with a schedule(eventId, delayMs, callback) API and a cancel(eventId) API. Walk through the internal data structures, how the worker thread sleeps and wakes, and how you'd handle time advancement and event ordering.

“I started with the min-heap pretty quickly, keyed by absolute fire time, which they seemed fine with.”

View Post

Pure Storage·Software Engineer·Onsite - System Design / Architecture

May 2026
Pure Storage system design round, one meaty question about building a unique ID service. The scope kept expanding as the conversation went on, which I wasn't fully ready for.
  • Design a service with a getID() API that returns a globally unique ID on every call, supporting high concurrency, async clients, an optional releaseID() operation for reuse, and graceful handling of IDs lost after a process crash.

“Started okay with the basic uniqueness guarantees, talked through a bitmap vs a heap of free ranges.”

View Post

Pure Storage·Software Engineer·Onsite - Coding / Algorithms

May 2026
Pure Storage onsite coding round for a software engineer role. The whole thing was structured around a single base problem that kept getting harder with multithreading follow-ups layered on top. Not a bad format but you really need to know your concurrency stuff cold.
  • Start with a single-threaded solution to a problem like parallel word count over a large file, then parallelize it: split the work, merge results, and handle synchronization correctly.
  • How does throughput scale as you increase thread count, and where does the bottleneck end up?
  • Walk through how you'd handle read-write contention, false sharing, and cache locality in a multithreaded context.
  • Describe a producer-consumer design with a thread pool and explain how you'd handle back-pressure.

“The base problem itself is fine, it's the follow-ups that get you.”

View Post

Pure Storage·Software Engineer·Technical Phone Screen

May 2026
Got a geometry problem at Pure Storage that looked deceptively simple on the surface. Just one question but it had enough edge cases to keep you busy for a while.
  • Given four 2D points in no particular order, write a function that returns true if they form a valid square (equal sides and all right angles), false otherwise.

“My first instinct was to sort the points and check distances, which works until you hit weird cases like three points on the same line or duplicate coordinates.”

View Post

Pure Storage·Software Engineer·Onsite - System Design / Architecture

May 2026
Pure Storage system design round, pretty deep on concurrency. The whole interview was basically one long question about making a timer system thread-safe, which sounds narrow but they kept pulling on threads until I was pretty lost in the weeds.
  • You have a single-threaded event scheduler backed by a min-heap. How would you make it thread-safe so multiple producers can call schedule and cancel concurrently while one or more worker threads consume due events?
  • How would you scale this timer system to handle multiple worker threads instead of just one?
  • What clock source would you use in a concurrent timer system, and what consistency issues come up?

“I started with the obvious answer, put a mutex around the heap, and they nodded but immediately asked what happens when a new event gets scheduled with an earlier fire time than whatever the worker is sleeping on.”

View Post

Pure Storage·Software Engineer·Technical Phone Screen

May 2026
Pure Storage coding round, just the one geometry problem. Pretty niche but manageable once you figure out the right approach to avoid floating point headaches.
  • Given four 2D points, determine whether they form a valid square (axis-aligned or rotated).

“My first instinct was to do something with slopes and distances and I immediately started second-guessing myself on floating point precision.”

View Post

Pure Storage·Software Engineer·Technical Phone Screen

May 2026
Pure Storage coding interview, one problem the whole session. The question was geometric and I hadn't seen anything quite like it before, so it took me a minute to even figure out what structure to reach for.
  • Given a set of distinct points on a 2D plane, count how many squares can be formed using exactly four of those points as vertices. The squares can be axis-aligned or rotated at any angle.

“My first instinct was to brute-force all combinations of four points and check each one, which is obviously way too slow.”

View Post

Pure Storage·Software Engineer·Technical Phone Screen

May 2026
Pure Storage SWE interview that came down to a classic data structure design problem. Nothing too surprising but the edge cases they pushed on were worth thinking through carefully.
  • Design a data structure that supports insert, remove, and getRandom operations, all in O(1) average time.

“The core idea clicked pretty fast for me: pair a hash map with a dynamic array so you get constant-time lookups and O(1) random access.”

View Post

Pure Storage·Software Engineer·Technical Phone Screen

Apr 2026
Pure Storage coding interview with a geometry problem that escalated through three levels of complexity. The question wasn't hard to understand but getting to the optimal solution under pressure was a different story.
  • Given n 2D coordinates, count how many distinct squares can be formed using any four of those points as corners. Walk through a brute-force solution, then optimize it step by step.

“Started with the O(n^4) brute force which was fine, they nodded and said 'okay now make it faster.' Fixed two diagonal points and checked if the other two exist, that got me to O(n^3).”

View Post