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 vote184 views1 answer
Selecting a specific value and corrersponding value in df python
Python
0 vote167 views1 answer
Loop per n (batch)
Python
3 votes164 views3 answers
Send dm to user discord.py
Python
3 votes174 views6 answers
Pandas count specific value in column
Python
23 votes188 views3 answers
Django rest framework
Python
1 vote180 views1 answer
Convert a Video in python to individual Frames
Python
0 vote168 views1 answer
Boto3 upload to digital digitalocean folder
Python
10 votes176 views1 answer
How to varify pip is install in python
Python
0 vote173 views1 answer
Float division in python
Python
1 vote171 views1 answer
Py 2 exe
Python