Two Sum at Goldman Sachs
Easy57.1% acceptance
This problem has 50.0% frequency at Goldman Sachs.
Problem Description
Given an array of integers `nums` and an integer `target`, return _indices of the two numbers such that they add up to`target`_. You may assume that each input would have **_exactly_ one solution**, and you may not use the _same_ element twice. You can return the answer in any order.
Read full problem and hintsTopics
Also asked at 128 companies
More Goldman Sachs Questions
Trapping Rain WaterHardMedian of Two Sorted ArraysHardFraction to Recurring DecimalMediumFirst Unique Character in a StringEasyLongest Substring Without Repeating CharactersMedium
View all Goldman Sachs questions