Pure Storage - Rejected

Posted
26 Mar 2026
324 reads

Summary

I interviewed at Pure Storage, completed a concurrency design question and an unordered‑set coding round, but was rejected after the first two rounds.

How it went

Hi guys,

I gave interview for pure storage.

Was sent a rejection email after the first 2 rounds.

First Round

This was a more theoretical round about concurrency and other concepts of multi threading and handling parallelism. The interviewer was interested in how you approach problems with high concurrency.

Question -

Given a system that has one event and multiple listeners, design and implement a mechanism for the listeners to hear about the event. We want to implement a callback mechanism that allows listeners to register a function that will be invoked when the event fires. The API functions are register_callback and event_fired.

                                                 event_fired()
                                                      |
                                                      |
 ----------------------------------------------------------------------------->time
        |                         |                  cb1()                 |
        |                         |                  cb2()                 |
register_callback(cb1)    register_callback(cb2)   cb3()      register_callback(cb3)

2nd Round - Coding Round

Implement an unordered set. The value of elements will be 0 to n - 1 where n is the size of the set.

Questions asked (2)

  1. 01

    Design Callback Mechanism for Event Listeners

    System Design

    Given a system that has one event and multiple listeners, design and implement a mechanism for the listeners to hear about the event. Implement a callback mechanism that allows listeners to register a function that will be invoked when the event fires. The API functions are register_callback and event_fired.

  2. 02

    Implement Unordered Set

    Data Structures & Algorithms

    Implement an unordered set where the values of elements range from 0 to n‑1, with n being the size of the set.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Pure Storage recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!