Data structures and algorithms section

[VictorApaez]

It would help if you considered adding a data structures and algorithms section. Here we can post any Leetcode questions we solve or questions encountered during interviews. The solution can include a detailed description, time and space complexity, integrated tests, and resources (videos, articles, documentation, etc.)

Here is an idea for the format:

LeetCode 1. Two Sum

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:

Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
Solution

Solution:

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */
let twoSum = function(nums, target) {
    let table = {};
    for (let i = 0; i < nums.length; i++) {
        if (table[target - nums[i]] !== undefined) {
            return [table[target - nums[i]], i];
        } else {
            table[nums[i]] = i;
    }
  }
};

Explanation:

Complexity:

Time complexity: O(n).
Space complexity: O(n).

[github-actions]

Thank you for submitting your first issue