J'ai postulé en ligne. Le processus a pris 1 semaine. J'ai passé un entretien chez Palo Alto Networks (Palo Alto, CA) en févr. 2019
Entretien
I have applied online through their portal. I received the email from the Hiring Manager for initial screening. It went well with all the data warehousing and Big Data Concepts.
I cleared the first round and got the call for the 2nd coding round. I expected normal data structure coding round or ETL/Data engineering question. However, I was asked to code the web-crawler. It was a very frustrating experience. I have 5-6 years of data engineering experience, I have applied for Data engineering position and you are asking me for web-crawler ?? Seriously? The interviewer was a Chinese guy, In the interview itself, I got the idea that they wanted to hire some Chinese person. So I didn't attempt the question.
It was a negative experience.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 4 semaines. J'ai passé un entretien chez Palo Alto Networks (Mandi, Himachal Pradesh) en janv. 2024
Entretien
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.
Questions d'entretien [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.
Questions d'entretien [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).
