Ho presentato la mia candidatura tramite un'altra fonte. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Bloomberg (New York, NY) nel mese di ott 2010
Colloquio
Hard core c++ and algorithmic questions.
Difference between array and link list?
how to implement queue using array?
how to implement has table ? and what hashing function will you use?
Domande di colloquio [1]
Domanda 1
There is file and every line in the file is a single word and the words can repeat..
Write the most optimized algorithm to print out the distinct words from file in ascending order base on their number of occurrence in the file.
Ho sostenuto un colloquio presso Bloomberg (New York, NY)
Colloquio
The interview consisted of two coding questions. The first was a LeetCode problem on counting ships in a rectangle, and the second was a find-path dynamic programming problem, also from LeetCode
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Bloomberg
Colloquio
Applied online got an email then telephone interview along with hacker rank test. First he asked about my CV briefly with emphasis on why you chose Bloomberg then he started coding questions
Domande di colloquio [1]
Domanda 1
Fibonacci with recursive function
Difference between recursive and iterative process
many detail questions about pointers
data structure
Ho presentato la mia candidatura tramite un'altra fonte. La procedura ha richiesto 6 settimane. Ho sostenuto un colloquio presso Bloomberg (New York, NY) nel mese di mar 2016
Colloquio
The initial interview was an HR screener who sounded me out on what my skills were and what I had worked on. This was followed by two technical phone interviews using HackerRank to pose several questions for C++ in first, with 3 topics, then a bit of SQL coding in the second, with a lot of discussion of DELETE of nonunique rows in a table and SQL tuning
Domande di colloquio [1]
Domanda 1
C++ class problems, SQL coding and tuning, C++ codin for efficiency, STL collections