Hi I am having an interview at Faceboook, I have practiced their questions but some of them are really vague and you don't know which data structure to think of.

For example this question of minimizing permutation to reach to an ascendingly sorted array https://leetcode.com/discuss/interview-question/1137426/Facebook-or-Minimizing-Permutations.

In the practice it was listed under "Graph" problems so it kind of directed me on how to think about this problem which is using BFS.

However I don't know if in a real interview would the interviewer tell me think of it as a Graph if for example I started thinking of other algorithms like DP, Sorting , etc... ?