Python leetcode

# Solution for Leetcode1: Two Sum problem
# Time complexity: O(n) and Space complexity: O(n)
# n is the size of the input list, namely nums

"""
Given an array of integers nums and an integer target, 
return indices of the two numbers such that they add up to target.
"""
class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        hashmap = {}
        for i in range(len(nums)):
            complement = target - nums[i]
            if complement in hashmap:
                return [i, hashmap[complement]]
            hashmap[nums[i]] = i

Leetcode python

def merge(self, nums1, m, nums2, n):
        while m > 0 and n > 0:
            if nums1[m-1] >= nums2[n-1]:
                nums1[m+n-1] = nums1[m-1]
                m -= 1
            else:
                nums1[m+n-1] = nums2[n-1]
                n -= 1
        if n > 0:
            nums1[:n] = nums2[:n]

Similar codes

31 votes281 views4 answers
Python find the key with max value
Python
0 vote269 views2 answers
Pandas read_csv column names
Python
0 vote298 views1 answer
Return positon of ele in list python
Python
0 vote290 views1 answer
Unique file name in django
Python
10 votes329 views3 answers
Accessing element from csv file in python
Python
0 vote288 views1 answer
Hi guys
Python
0 vote311 views1 answer
Pandas datafdrame pyplot
Python
0 vote287 views1 answer
Backend in python
Python
0 vote276 views1 answer
Korozif
Python
0 vote322 views1 answer
Filter dict by list of keys python
Python