FactSet Interview Experience
Round 1: The first round was a pen and paper based written test. Three Data structures problems were given.
- Shuffle all digits of the number to make next biggest number.
- Traversal of Binary Tree without extra space.
- 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.
- Check if Binary Tree is Binary Search Tree.
- Given a number N in form of string, you can shuffle k digits, make the smallest number.
- Given an encoded string decode it. Ex Input: a2[b3[cd]] Output: abcdcdcdbcdcdcd
Round 3: The second technical round starts directly with questions:
- 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.
- Find the most frequent element of the array.
- Max sum path in Binay Tree.
- 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.
Contact Us