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 vote386 views1 answer
__pycache__
Python
18 votes314 views6 answers
Addition in python
Python
0 vote335 views1 answer
How to let something see on screen with python
Python
27 votes369 views3 answers
Python get the key with the max or min value in a dictionary
Python
0 vote343 views1 answer
Python missing characters hackerrank solution
Python
1 vote348 views1 answer
Dataframe cut based on range
Python
4 votes327 views1 answer
Google colab how to upload a folder
Python
0 vote384 views1 answer
AssertionError: Relational field must provide a `queryset` argument, override `get_queryset`, or set read_only=`True`
Python
0 vote317 views1 answer
Scoop bucket add extras
Python
0 vote308 views1 answer
Adding number in set in python
Python