תהליך ארוך יחסית .. 5 ראיונות
ראיון עם מנהל ראיון משאבי אנושי
ושתי ראיונות מקצועי
שאלות מתוך הראיון
given an sorted array and k find if exist sum two element from the array that equal k ex: [0,1,2,3,4,5,6]
k = 4 result = [0,4]
[1,3]
----------------------------------------------------------
find Fibonacci using recursion and loop and explain how it work
----------------------------------------------------------
there an global exam and the grad is from 0 to 100 and you got an array of millions grades how we can sort it
expected result should work in o(n)
----------------------------------------------------------
given an array find sub array that contains elements of max number ex = [1,2,3,-5,6,7,-1] result = [6,7]
ex =[1,2,3] result = [1,2,3]
----------------------------------------------------------
sql questions about join and select insert *basics
Trax is the world leader in computer vision solutions for retail, ranking in the top 25 Fastest Growing Companies on Deloitte’s Technology Fast 500 list
ראיון לתפקיד 
