Ho presentato la mia candidatura online. La procedura ha richiesto 4 giorni. Ho sostenuto un colloquio presso Check Point Software Technologies (Tel Aviv) nel mese di mar 2022
Colloquio
after a brief phone talk you get a coding test that has 3 questions to finish in 130min. they use the same questions mostly after reading here.
if you get 100% on the coding test you progress to the next interview. 4 interviews in total.
Domande di colloquio [1]
Domanda 1
1. password syntax check. u get a string and need to make sure it has upper and lower characters and numbers and special characters and so on. solution with regex is easy.
2. u get a message and u need to crop it to be K characters, u cant cut in the middle of a word and dont cut spaces. example "something some here we are" K=17 will return "something some".
3. air plane arrange sits. u get a string that represnet the rows in an airplane some of those sits are taken and you need to sit families of 4 toghter as much as possible. can be solved with hashMaps or arrays or even DFS.
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.
