Data Engineer applicants have rated the interview process at Palo Alto Networks with 4 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 50% positive. To compare, the company-average is 48.6% positive. This is according to Glassdoor user ratings.
Candidates applying for Data Engineer roles take an average of 7 days to get hired, when considering 2 user submitted interviews for this role. To compare, the hiring process at Palo Alto Networks overall takes an average of 31 days.
Common stages of the interview process at Palo Alto Networks as a Data Engineer according to 2 Glassdoor interviews include:
Other: 50%
Phone interview: 50%
Here are the most commonly searched roles for interview reports -
I applied through an employee referral. I interviewed at Palo Alto Networks (Santa Clara, CA)
Interview
The interview process typically began with a recruiter screening to discuss your background, experience, and interest in the role. This is followed by technical interviews covering coding, SQL, data engineering concepts, cloud technologies, system design, and project deep dives.
Interview questions [1]
Question 1
Tell me about yourself.
Walk me through your latest project.
What problem were you solving?
I applied through college or university. The process took 4 weeks. I interviewed at Palo Alto Networks (Mandi, Himachal Pradesh) in Jan 2024
Interview
Firstly there was a OA round, then 2 interview round till now. Asking only medium level databases and MySQL. The hiring manager is not too responsive to career and placement cell but over-all experience is good.
Interview questions [1]
Question 1
Question from resume related to data science (MySQL, relational database)
In round 2 one moderate DSA , and SQL query question
I had a technical interview on Codility, as the first step. It had three algorithm questions and they have to be implemented in Python, Java, C++, etc. I had to solve them in 50 minutes.
Interview questions [1]
Question 1
I remember two of the questions:
1) Given an array, we choose pairs of elements. If we can choose pairs of the same numbers, return True. Otherwise, if even one pair has different numbers, it must return False.
2) Given an integer number, N, it has to return the smallest integer, bigger than N, in which the sum of digits is as big as twice the sum of digits of N. For example if N is 12 (1+2=3), the algorithm must return 15 (1+5=6).