leetcode_problems_solved.py

# Problem 1: Two Sum, difficulty: Easy
def twoSum(self, nums, target)
	for i in range(len(nums)):
		for j in range(len(nums)):
			if j == i:
				continue
			if nums[i] + nums[j] == target:
				return [i, j]

# Problem 7: Reverse Integer, difficulty: Easy
def reverse_integer(self, x):
    import numpy as np
    """
    :type x: int
    :rtype: int
    """
    x = str(x)
    x = x[::-1]
    if x[-1] is '-':
        x = '-' + x[:-1]
    x = int(x)
    if np.abs(x) > 2**31 - 1:
        return 0
    return x

# Problem 4: Median of Two Sorted Arrays, difficult: Hard

class Solution(object):
    def findMedianSortedArrays(self, nums1, nums2):
        """
        :type nums1: List[int]
        :type nums2: List[int]
        :rtype: float
        """
        both = nums1+nums2
        both.sort()
        if len(both)%2 == 1:
            return both[len(both)/2]

        return (both[len(both)/2 - 1] + both[len(both)/2])/2.0