Ho presentato la mia candidatura online. La procedura ha richiesto 2 mesi. Ho sostenuto un colloquio presso Microsoft (Taipei) nel mese di apr 2016
Colloquio
Online Resume submission -> Group interview, mainly talk about personal experience, school life and etc. (Be prepared your self introduction) -> Personal Interview, interviewer ask my experience in detail, he tried to know my personality and etc. I only got to this stage and didn't make it. BTW, the whole process was in plain Chinese, but i heard that if you apply for different position, (marketing and other non-technical position), you have to do it in English (give a presentation on stage talking about some specific topic or something)
Domande di colloquio [1]
Domanda 1
Please introduce yourself, and other trivial things, basically some chitchat to see your personality fit the company or not.
The hiring process consists of a HackerRank home exam, followed by three technical interviews covering LeetCode-style problems and system architecture. Once this is done, you will have a final HR interview.
Domande di colloquio [1]
Domanda 1
I had a technical interview where I was asked to solve the classic 'Climbing Stairs' problem (LeetCode #70), which is a dynamic programming question based on the Fibonacci sequence.
Ho sostenuto un colloquio presso Microsoft (Il Cairo, )
Colloquio
One HR interview, then two problem-solving interviews (beginer level) on HackerRank. You can choose the best programming language for you to use in solving problems. You should think out loud to enable your interviewer to understand how you would think to solve the problem.
Domande di colloquio [1]
Domanda 1
Find the lowest difference between two numbers in a list
Ho presentato la mia candidatura tramite un selezionatore. Ho sostenuto un colloquio presso Microsoft (Tel Aviv)
Colloquio
hr reached to me on linkedIn and sent me Take-home assignment hosted on HackerRank. I had about 10 days to complete. The test included 1 medium/easy question and one hard question with style of LeetCode 3162 and 2080 (Range Frequency Queries)
Domande di colloquio [1]
Domanda 1
hard question with style of LeetCode 3162 and 2080 (Range Frequency Queries)