Problem Statement  
Character j in element i (both 0based) of messages denotes how many messages employee i sent to employee j. You will return a int[] containing the hierarchy of the employees within the company. Element 0 is the highest ranked employee, and so forth. The returned ranking should minimize the number of messages sent from lower ranked employees to higher ranked employees. If multiple solutions are possible, return the one with element 0 minimal. If there are still ties, minimize element 1, etc.  
Definition  
 
Constraints  
  messages will contain between 2 and 15 elements inclusive.  
  Each element of messages will contain exactly N characters, where N is the number of elements in messages.  
  Each character in messages will be a digit ('0''9').  
  Character i in element i of messages will be '0'.  
Examples  
0)  
 
1)  
 
2)  
