The interview began with a short introduction about my background and current projects, then moved to DSA problems. First question was Subarray Sum Equals K. I explained the brute-force approach and optimized it using prefix sum with hashmap for O(n) time. Follow-ups included handling negative numbers and large inputs. Second question was Find Minimum in Rotated Sorted Array II. I used modified binary search, handling duplicates by reducing the search space when elements are equal. Discussed worst-case O(n) due to duplicates. Overall, the focus was on optimization, edge cases, and clear explanation of approach