Goldman Sachs Interview Experience Last Updated : 26 Oct, 2021 Improve Improve Like Article Like Save Share Report Round 1(Coderpad 1 hour): 2 coding problems were asked in this round. Find first non-repeating character in a string consisting of lowercase alphabets only. Implement hashmap with insertion and search in O(1) time complexity. Round 2(Technical 1 hour): 2 coding problems were asked in this round. Given a binary tree, return sum of nodes lying in a diagonal from top left to bottom right. Reference: https://www.geeksforgeeks.org/diagonal-sum-binary-tree/ Given a NxN tray of oranges. All oranges are fresh except one. The rotten orange is able to rot other neighboring oranges in a single day. the neighboring oranges are considered in 4 direction which are top, left, right and bottom. Find the minimum number of days required for entire tray to be rotten. Reference: https://www.geeksforgeeks.org/minimum-time-required-so-that-all-oranges-become-rotten/ Round 3(Technical 1 hour): 2 problems were asked in this round Designing a basic banking application. Find max sum path from 2 sorted arrays. Reference: https://www.geeksforgeeks.org/maximum-sum-path-across-two-arrays/ Like Article Suggest improvement Previous Goldman Sachs Internship Interview Experience Next Optum-UHG Interview Experience for SDE-1 | On-Campus 2021 Share your thoughts in the comments Add Your Comment Please Login to comment...