Solving Leetcode's Two Sum problem in Javascript. This question's been asked by Amazon, Adobe, Google, Apple, etc. in the last 6 months.
Problem on Leetcode: leetcode.com/p...
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.
Example 1:
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
If you'd like to sponsor a video/business inquiries:
dgalarza01@gmail.com
#leetcode #technicalinterviews #javascript
Негізгі бет Ғылым және технология TWO SUM - LeetCode 1 - Javascript Solution
Пікірлер: 29