During the interview, I was asked two Data Structures and Algorithms (DSA) questions:

Word Search II (Trie-based optimization) The first question was a good problem, especially if you have a solid understanding of Tries. It was a variation of the classic Word Search II problem, where the goal is to optimize the solution using a Trie data structure. Problem link: https://leetcode.com/problems/word-search-ii/description/

Lowest Common Ancestor (LCA) The second question was based on finding the Lowest Common Ancestor in a Binary Tree. Problem link: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/description/