I recently applied to Goldman Sachs through an agency and got interviewed for a position in New York with a specific team. The process included three rounds: the first with the recruiting agency focused on Java, Spring Boot, and Microservice architecture, the second with Goldman Sachs on Coderpad involving a question on Trapping Rain Water, and the third was a technical discussion with three VPs where I was asked to find the number of subarrays whose sum equals K. My recursive approach for non-contiguous subarrays conflicted with the interviewer's suggestion to sort and selectively include elements.