Ho presentato la mia candidatura online. La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso Palo Alto Networks (Palo Alto, CA) nel mese di feb 2019
Colloquio
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.
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso Palo Alto Networks (Mandi, Himachal Pradesh) nel mese di gen 2024
Colloquio
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.
Domande di colloquio [1]
Domanda 1
Question from resume related to data science (MySQL, relational database)
In round 2 one moderate DSA , and SQL query question
Ho sostenuto un colloquio presso Palo Alto Networks
Colloquio
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.
Domande di colloquio [1]
Domanda 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).
