I applied through other source. The process took 3 weeks. I interviewed at Palo Alto Networks (Tel Aviv-Yafo) in Feb 2024
Interview
I first had a technical exam that contained 2 major questions in algorithms, and a minor question in python to select the fewer that knows this specific subject in communication networks.
The on the next level there was a frontal interview with the team leader. Which also contained a technical question, which I didn't pass... and I don't know why exactly, because I thought my answers were good.
Interview questions [1]
Question 1
Jeremy have grown trees for many years. It was time to chop of some and trim them so they will be aesthetically pleasing to him. His idea of what aesthetic is making the trees goes low and high in a zig-zag shape. So it may look something like so: |│|│|│|. Sadly Jeremy is also a computer scientist, and as a computer scientist, he is VERY lazy. Find an algorithm that will let Jeremy know the minimum amount of trees he might need to trim to make it look aesthetically pleasing.
I interviewed at Palo Alto Networks (Tel Aviv-Yafo)
Interview
Test with 3 different question in 90 mintues , 1 a question on strings, the 2nd on intervals and the third one , I wasn't left with enough time so I used naive solution that was inefficient.
Interview questions [1]
Question 1
Given a list of strings ,return a list of lidts of string anagrams.
I applied online. I interviewed at Palo Alto Networks (Tel Aviv-Yafo) in June 2026
Interview
Telling about myself and asking questions to an interviewer, telling about the job I worked at recently. In addition, there were coding and architecture questions. Overall the interview was average, the people were nice and it was a good experience.
I interviewed at Palo Alto Networks (Tel Aviv-Yafo)
Interview
Leet code style testing. Mostly string and arrays questions and dynamic programming questions. Needed to bring your own laptop and they sent a link with the questions. There were many juniors tested that day
Interview questions [1]
Question 1
Dynamic programming question- number of cars that can cross bridge without exceeding the maximum weight. When a driver turns back, all drivers behind him move one position closer. Need to find the min number of drivers that will need to turn back