
ZeroFox Software Engineer Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 15 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at ZeroFox.
Principal Software Engineer
The interview was pretty standard and laid out well. It was meant to check out my tech skills and how I solve problems. The questions were clear and to the point, so they could check the main stuff efficiently. All in all, it was a smooth process and not too tough, making it a comfortable and fair experience.
- There were coding problems, especially about hash tables, to see how well I understood and could use data structures.
Senior Software Engineer
I went through 4 interviews. First, an HR call about salary and company expectations. Then, there were 3 technical rounds: one coding question with an easy problem, a systems design question where I had to design a URL shortener, and another coding question about implementing an insert method for a BST.
- Can you tell me about your salary expectations and what you're looking for in a company?
- There was a coding question involving searching within a string array.
- We discussed designing a URL shortener system.
Software Engineer
I had two algorithm interviews, one where I had to use a hashmap and another with a binary tree problem. Then a third interview was about system design, specifically a URL shortener. The interviewers were Chilean software engineers and had a really rude attitude, like they were doing me a favor. It was obvious they'd reject me from the first interview. Makes me doubt the company has a good environment, despite what some engineers say.
- Solve an algorithm problem using a hashmap.
- Describe how to insert a node in a graph.
- Design a URL shortener.
ZeroFox Software Engineer Interview Questions
Quoted word for word from ZeroFox interview reports.
“Find the longest common prefix from a list of strings.”
Read reports →“Given a list, find if there are duplicates within distance ‘d’ of each other. Examples: [1, 2, 3, 1, 3] d=3 -> True; [1, 2, 3, 1, 3] d=2 -> True; [1, 2, 3, 1, 3] d=1 -> False”
Read reports →“Solve the LeetCode two sum problem.”
Read reports →“Design a URL shortener”
Read reports →“Describe how to insert a node in a graph.”
Read report →“Implement a Binary Search Tree.”
Read report →“Solve the Two Sum problem.”
Read report →“Solve an algorithm problem using a hashmap.”
Read report →“Was it necessary for the code to execute?”
Read report →Formats, difficulty and experience
Across all 15 ZeroFox interview reports.