In the interview, I was presented with two Data Structures and Algorithms questions.

The first required identifying and implementing a suitable data structure to manage hierarchical categories and subcategories from given paths with IDs, which led to a Trie-based solution.

The second question involved efficient operations using a Priority Queue, testing my understanding of heap properties and order-based retrieval.

Additionally, I was asked to explain my project in detail, where I discussed the system’s architecture, core technologies used, challenges encountered, and the problem-solving approaches I applied to make it scalable and effective.

You are given paths representing categories and subcategories, each ending with a category ID. Design a data structure to efficiently store, insert, and search categories along their hierarchy.