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

0 vote98 views1 answer
Tkinter mouse loading cursor
Python
0 vote99 views1 answer
Parquet to dataframe
Python
3 votes97 views2 answers
Scapy python import
Python
2 votes98 views1 answer
Transpose a matrix using list comprehension
Python
0 vote92 views2 answers
Local to ISO 8601 with TimeZone information (Python 3):
Python
0 vote97 views1 answer
Automatic stationary conversion
Python
0 vote104 views1 answer
Python sys environment
Python
82 votes98 views6 answers
Activate python venv in windows
Python
1 vote102 views1 answer
Discord.py commands not working
Python
40 votes110 views6 answers
How to install beautiful soup
Python