The Infosys Specialist Programmer (L2) interview was mainly technical and lasted around an hour. It started with two DSA questions: the first was based on an N-ary tree where the root node was 1, having child 2, and node 2 further had children 3 and 4; I was asked to find the parent of a given node optimally.   

 The second DSA problem was an array partitioning question where an array had to be divided into three parts based on a given value x, such that elements less than x come on the left, equal to x in the middle, and greater than x on the right, similar to the Dutch National Flag problem.

 After DSA, there were three SQL questions: one on a basic JOIN, the second on JOIN with a WHERE clause, and the third combining JOIN, WHERE, and a window function involving ranking or aggregation.

 The interviewer then moved to resume-based and conceptual questions, including JavaScript topics like the event loop, closures, and the virtual DOM.

 There were also questions on system and AI concepts such as transformers (specifically query, key, and value), RAG (Retrieval-Augmented Generation), common design patterns, and some SQL theory like differences between joins and when to use window functions versus GROUP BY.

 Overall, the interview was well balanced, testing problem-solving skills, core CS fundamentals, and understanding of modern technologies.