TwoSum

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

General Information

This code is implemented by sorting the numbers first and creates a new array that excludes values in the sorted array that is greater than the taget. The purpose of this is to shorten the array, so that in average cases the array will be smaller. Then, two pointers are used one at the first index of the array(i) and one at the last index of the array(j) and iterates depending on a few conditions. If the sum of the of the value at i and j are equilvalent to the traget then output the index and finish, if i crosses j than increment i and reposition j at the end of the array, and if i is less than the length of the array then decrement j.

Finds the Two Sum

  while i < length:
       sum = shortarr[i] + shortarr[j]
       if sum == arg2:
          str2 = "Target {0} found at index [{1}, {2}]".format(arg2, i,j)
          print(str2)
          break
       if i >= j:
          i+=1
          j = len(shortarr) 
       j-=1

Technologies

Project is created with

• IDE: Visual Studio Code
• Version: 1.67.2
• Language: Python3

Setup

To run this project download file into IDE that supports Python3.

Status

This is a project created by @MadCodes9 😀

Source: Advanced Python-LinkedIn Learning