FactSet Interview Experience

Round 1: The first round was a pen and paper based written test. Three Data structures problems were given. 

1. Shuffle all digits of the number to make next biggest number. 
2. Traversal of Binary Tree without extra space. 
3. Max distance path in a matrix of 0 and 1. 

Round 2: The first technical round started with brief questions like Tell me about yourself and Which framework do you like most and why? because I have mentioned frameworks in my cv. 

1. Check if Binary Tree is Binary Search Tree. 
2. Given a number N in form of string, you can shuffle k digits, make the smallest number. 
3. Given an encoded string decode it. Ex Input: a2[b3[cd]] Output: abcdcdcdbcdcdcd 
   

Round 3: The second technical round starts directly with questions: 

1. Given an Array of strings, make Nx16 a matrix of char containing max strings and a row can store a string as whole or none. 
2. Find the most frequent element of the array. 
3. Max sum path in Binay Tree. 
4. You have to find 10 most frequent words in a Book(Or large data), which data structure will you choose? 
   

Round 4(HR Round): HR was very friendly but picky so think before speak and don’t mug HR questions just know how to handle a type of question. Do not make any stereotypical comment.