During my interview, I was asked about puzzles and the data structures that could be used in Spotify. For the puzzles, I was given logical problems, where I focused on breaking down complex scenarios into simpler steps, applying **dynamic programming** and **greedy algorithms** to efficiently solve them. When discussing Spotify, I explained how **Hash Maps** could be used for song lookups, **Tries** for autocomplete searches, **Heaps** for top song rankings, and **Graphs** for song recommendations. The interviewer appreciated how I incorporated multiple data structures to optimize various Spotify features.