Round 1:
Asked simple questions about why I wanted to do the job, and what I hoped to gain. Very simple math questions: (i) what is n if 2^n = 2048, (ii) What is 6E in decimal. Just a warm up
Round 2:
Had to implement an algorithm to find the build order of a tree of dependencies if presented with a dataset of tuples in the format: [(child_dependency, parent_dependency)].
Round 3:
The most difficult round. Had to debug a networking error log. Had to come up with ways to test a program that produced triangles. Had to find the missing two numbers in a list of consecutive integers.
Article Tags :
Recommended Articles