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 vote142 views1 answer
Df invert sort index
Python
0 vote172 views1 answer
S = 1 + 2 + ... + n in python
Python
0 vote148 views1 answer
Python all possible pairs
Python
6 votes150 views2 answers
Count similar values in list python
Python
24 votes150 views2 answers
Find python
Python
0 vote152 views1 answer
How to read an xml file
Python
0 vote163 views1 answer
Write a python program to find table of a number using while loop
Python
1 vote149 views1 answer
Pyspark Aggregation on multiple columns
Python
0 vote158 views1 answer
Pandas dataframe to excel hyperlink length limit
Python
1 vote180 views1 answer
Python get last element of iterator
Python