Envié una solicitud electrónica. El proceso duró 2 semanas. Acudí a una entrevista en Everpure (Praga) en feb 2023
Entrevista
I applied through a company's job portal. I interviewed online at Pure Storage (Prague) on 23 Feb 2023. The online assessment was not very easy, it was medium-level questions. The after call four technical sessions were planned. My technical interview was separated 2 parts, the first 2 rounds and then 2 rounds else. In the first interview, an interviewer asked to write an algo lowercasing all dirs and sub-dirs names. The second interviewer asked questions about parallel tasking. I am waiting for the next 2 rounds.
So far had the coding test on HackerRank which was relatively easy. Two coding challenges and then 8 multiple-choice questions I think. The coding tasks are the leet-code level simple problems like counting objects in the input data etc.
Preguntas de entrevista [1]
Pregunta 1
Inferring information about the output of async tasks composed of atomic operations.
Acudí a una entrevista en Everpure (California City, CA)
Entrevista
It was the first round interview and was a Hacker rank with Easy-med leetcode qs including MCQs and fill in the blanks. 2 coding qs one was easy palindrome check.
Solicité el puesto por otro medio. Acudí a una entrevista en Everpure (Bengaluru) en ago 2025
Entrevista
Algorithm Round or Optical Illusion Puzzle?
Had an "interesting" experience with the so-called algorithm round. Still not sure if they were testing problem-solving skills or just hoping candidates would get lost in the formatting.
The highlight was a question on a bitbuddy tree (yep, that's what they called it) disguised in a 2D array format. Looked like a scene from Inception at first glance—layers within layers. Turns out, all it required was a plain old integer division. The challenge was more in deciphering what they were even asking, not solving the problem itself.
Would’ve appreciated a bit more clarity on what kind of "algorithm" knowledge they expect. Feels like they were going for clever, but ended up closer to cryptic.