Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Check Point Software Technologies (Tel Aviv) nel mese di mag 2021
Colloquio
at first they sent me a codility link that contained 3 simple coding questions that can be found in other reviews, must be finished in 120 minutes. After that I got a call from the team leader to interview in the company in Tel Aviv, after that an interview with the project leader.
Domande di colloquio [4]
Domanda 1
q1) find the second maximum in an array using only one scan.
the second interview question:
design a malloc function that guarantees that the address it returns is a multiplicand of 64. after that design a free function that takes such address and frees all allocated memory. both the functions can be implemented using the built in malloc and free, using a little tweek.
q3) given an array that contains numbers that appear only once or twice, return all the number that appear twice (non trivial solution for O(N) time and O(1) space).
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Check Point Software Technologies (Tel Aviv)
Colloquio
medium leetcode problem , talk about yourself , talks about the company , solving through zoom video call remote control is laggy , i was not ready for interviews at that time
Ho presentato la mia candidatura tramite un selezionatore. Ho sostenuto un colloquio presso Check Point Software Technologies (Tel Aviv)
Colloquio
I intrivewed at check point a year ago, the intrview starts where i introduce myself then had two leetcode questions in c/c++ one of them make atoi function the second i forgot and has to do it on paper in the office.
Ho sostenuto un colloquio presso Check Point Software Technologies (Tel Aviv)
Colloquio
The interview process started with a reasonable-level take-home assignment, which included a few LeetCode-style algorithmic questions. After that, I was invited to an on-site interview day at the company, where they brought in over 10 candidates for one or two open positions. Unfortunately, I was eliminated fairly early in the day.
Domande di colloquio [1]
Domanda 1
I can’t recall the exact wording of the question, but the problem was conceptually almost identical to LeetCode’s “Product of Array Except Self,” and required the same kind of approach to solve.
