Candidatei-me online. O processo levou 1 semana. Fui entrevistado pela Next Insurance (Tel Aviv-Yafo) em jan. de 2021
Entrevista
very bad and unoriginized recruting day.
zoom intreveiws one algorithem and the second with the head of the team. i think the second one didnt asked the question well and was searching for much more experienced level rather then junior.
Perguntas de entrevista [1]
Pergunta 1
design and implement bit.ly system for shorting urls
design and implement data stracture with get set and setAll in O(1)
Candidatei-me online. O processo levou 2 semanas. Fui entrevistado pela Next Insurance (Kfar Saba) em mai. de 2024
Entrevista
I had 2 interviews.
First asked to find max perfect subtree in a binery tree, and write a function to find the root of number. Note the case of x<1
Second Interview with team leader, asked 2sum and dycrypt caesar encryption, can be found on leetcode.
Candidatei-me online. O processo levou 2 semanas. Fui entrevistado pela Next Insurance (Kfar Saba) em mar. de 2024
Entrevista
2 technical interviews and one HR.
very bad experience, after a great technical and HR interview and telling me that they wanted me to join the team and agree on a salary range they stopped for the stupidest reason "someone else signed the contract before you", even though I didn't get a written contract.
they gave no real reason that they hired the other person just that he signed first.
furthermore, after a week I saw the same opening on their website so I contacted HR about it (after all everything was great the first time) and they simply ghosted me.
they wasted a lot of my time for nothing.
Perguntas de entrevista [1]
Pergunta 1
write a code that returns the size of the largest perfect subtree
It was a screening process for an internship program they offer. The recruiter spoke to me on the phone and said that I fit the requirements, then- first phone interview, home assignment, technical interview, hr interview.
Perguntas de entrevista [1]
Pergunta 1
Write a function that parses a string and manipulates it. The problem can be solved in a variety of languages, such as Java, C++, etc.