J'ai postulé via la recommandation d'un employé. J'ai passé un entretien chez Palo Alto Networks en juil. 2024
Entretien
call from HR and then first round 1 hour technical interview.
the interviewer only asked one question. no time to questions or discussion. just solve the technical question.
medium question in any language you prefer. (trees)
Questions d'entretien [1]
Question 1
save relations between nodes and then print the tree.
J'ai postulé en ligne. J'ai passé un entretien chez Palo Alto Networks (Tel Aviv-Yafo) en oct. 2024
Entretien
You have a 30-minute interview with two parts:
First Part: Project Discussion and Your Role
In this section, you’ll briefly introduce a project you worked on in your last job. Focus on:
Project Overview: Provide a short description of the project, including its goals, technologies, and impact.
Your Role and Responsibilities: Elaborate on your specific contributions. Explain the main responsibilities you had, such as design, implementation, or problem-solving. Highlight any key achievements, challenges you faced, and how you addressed them.
Second Part: Coding Challenge – Shuffle an Array
In this section, you’ll be asked to code a solution for shuffling an array using any language you prefer. One commonly used method is the Fisher-Yates Shuffle Algorithm. It is efficient and produces an unbiased shuffle.
J'ai postulé en ligne. Le processus a pris 1 semaine. J'ai passé un entretien chez Palo Alto Networks (Tel Aviv-Yafo) en août 2024
Entretien
The interview was conducted with a team leader and a team member. The initial task was a leetcode hard question that i later saw that it is present in leetcode as premium hard question.
First thing is to show on a blackboard how you would solve it, and afterwards programming it in real-time in front of them.
The second part was to design the system they develop themselves as if i was the designer.
The process took an hour and a half and included many questions regarding my solutions to their problems.
At the end there was time for asking them questions about the position.
Questions d'entretien [1]
Question 1
A hard leetcode question which included graph theory and topological sorting to solve. First pseudo code and then real time programming to validate the solution works.