This was an on-campus interview that happened after a coding test. The test included, on average, one easy question, one question on medium-level dynamic programming, and one medium-to-difficult level question on graphs.

In the interview itself, only one question was asked. The remainder of the time was a general discussion on my branch (P&I) and college courses.

The interview problem could be solved using multiple approaches, such as hashing, trees, and tries, which was expected by the interviewer.

You are given a list of file names. You need to store them in such a fashion that you can look up whether a file exists in your database. If a file exists, you should also be able to show all files that start with that file name.

For example, if the file name is "delivery," show all files with the prefix "delivery," such as "delivery hut."

There was also some discussion on suffix tries, but it was not explored in depth due to time constraints.