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 votes147 views3 answers
Python array to list
Python
4 votes133 views2 answers
Change django admin title
Python
0 vote96 views1 answer
Multiplication of matrix in python
Python
0 vote157 views1 answer
Turtle meaning
Python
0 vote136 views1 answer
Fill na with average pandas
Python
0 vote143 views1 answer
Print string in reverse order uing for loop python
Python
0 vote153 views1 answer
Install sorting
Python
3 votes208 views1 answer
Django session expire time
Python Django
0 vote142 views1 answer
Printable characters python
Python
0 vote217 views1 answer
Getting multiple of 5 python
Python