Ho presentato la mia candidatura online. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Sofrecom (Buenos Aires) nel mese di gen 2009
Colloquio
several questions about J2SE, J2EE and Data Structures. They were multiple choice. They were similar to the java sun professional exam
Domande di colloquio [2]
Domanda 1
You are given a binary tree in which each node contains a value. Design an algorithm to print all paths which sum up to that value
You are given two 32-bit numbers, N and M, and two bit positions, i and j. Write a method to set all bits between i and j in N equal to M (e.g., M becomes a substring of N located at i and starting at j).
