Is it too difficult to get an offer from Bloomberg? because I recently interviewed (onsite) and got rejected. I was able to solve all problems though. very disappointed!

Round 1

				World
              /   |   \
             /    |    \
            C     A     B
          / |     |    /|\
         /  |     |   / | \
        E   D     F  H  G  I
        to
            World
          /   |   \
         /    |    \
        A     B     C
        |    /|\    |\
        |   / | \   | \
        F  G  H  I  D  E
sort tree by its childrens and return root (solved in N*mlg(m) here N=total no of nodes and m is avg no of children)

Q 2
given an array sorted by its absolute values, return sorted array by it actually values (less than NlgN)
0,-1, 2, -4,5, 6, -10, -13, -22
to
-22, -13, -10, -4, -1,0, 2, 5, 6

Solved in O(N) N = length of given array

Round 2
Given 2d matrix, find maximum path sum in given N steps only

2, 3, 4, 6
1, 2, 3 ,5
3, 4, x ,5
0, 1, 2, 3
N = 2
starting cordinate = (2,2)
N = 2
Output: 10 (5->5)

first solved using BFS with 4^(N) complexity then did memoization to solve in 4*N (not sure about this)