Round 2 was more technical, a 30 minute individual tech assessment where we were all in a room together on individual laptops where we opened up hacker rank and worked on a given problem, you could pick any language to operate in, and the question was about finding items in an array and taking the biggest difference you could find (for example in a list of [4,1,5,10,9] the biggest difference is 10-1 =9 but the catch to this problem is once the biggest number is detected, the smallest number you would use to find the difference has to come before the biggest number in the array and not after, so if 1 was after the 10 then the 4 would be used to make the difference 6; after that it was a normal behavioral interview where they asked a couple technical questions like find the bug in a piece of Java code, and find what's wrong with a binary search tree, and how do you look for a repeated number in a numerically ordered sequence (answer is that formula: n(n+1)/2) and then finally there was a group technical assessment which was more tricky, but you're given 50 minutes