The DSA questions in the interview were challenging, but I was able to answer most of them correctly. The questions covered a variety of topics, including recursion, sorting, and graphs. I was particularly impressed with the question on the minimum spanning tree algorithm, as it required a deep understanding of graph theory.
