Round 1 (DSA): Asked two questions: Kth Smallest Sum of Continuous Subarrays (positive integers) and Rotten Oranges. Had to explain multiple approaches, from brute force to optimized solutions, along with time and space complexities. Cleared this round.

Round 2 (ML/DL + Resume): In-depth discussion covering the breadth and depth of ML/DL fundamentals, followed by resume-based questions and project discussions.

Tips: Solve striver A to Z sheet very throughly and be clear with ML fundamentals specially stats6