Goldman Sachs Software Developer Intern Interview Questions and Answers for Experienced

Round duration - 90 minutes
Round difficulty - Medium

This test was conducted on the Hackerrank platform, it was divided into 6 sections which contained a total of 66 questions with an overall time limit of 90 minutes, There was video proctoring, and changing sections were allowed.
The sections were-

Numerical Computations — 8 questions
Numerical Reasoning -12 questions
Comprehension — 10 questions
Abstract Reasoning — 12 questions
Diagrammatic Reasoning — 12 questions
Logical Reasoning — 12 questions

Q1. 
Convert a Number to Words
Given an integer number num, your task is to convert 'num' into its corresponding word representation.
Input:
The first line of input contains an integer ‘T’ denoting the number o...read more
Ans. 
Convert a given integer number into its corresponding word representation.
• Implement a function that takes an integer as input and returns the word representation of the number in English lowercase letters.

• Break down the number into its individual digits and convert each digit into its corresponding word form.

• Handle special cases like numbers between 10 and 19, multiples of 10, and numbers with zeros in between.

• Concaten...read more
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

The interview started at 12 in the noon.
The interviewer seemed very cheerful. He began by greeting and asked me for a quick introduction.
Then he talked about the various projects I have mentioned in my resume and what further improvements I was going to make in my projects. Further he started asking questions on fundamentals of Data Structures and Algorithms, few questions on operating syatem and gave a problem statement on DSA.

Q1. 
Pair Sum Problem Statement
You are provided with an array ARR consisting of N distinct integers in ascending order and an integer TARGET. Your objective is to count all the distinct pairs in ARR whose sum...read more
Ans. 
Count distinct pairs in an array whose sum equals a given target.
• Use two pointers approach to iterate through the array and find pairs with sum equal to target.

• Keep track of visited elements to avoid counting duplicate pairs.

• Return -1 if no such pair exists with the given target.
Answered by AI
Add your answer