New and edited solutions.

Added new solutions, edited a couple of old solutions.

Author: setu4993

001_two-sum.py

@@ -14,5 +14,4 @@ def twoSum(self, nums, target):
                 differences[target - n] = i
         return -1, -1
 
-
 print(Solution().twoSum([2, 7, 11, 15], 9))

005_longest-palindromic-substring.py

@@ -11,21 +11,5 @@ def longestPalindrome(self, s):
                 substring = s[j:j + i + 1]
                 if substring == substring[::-1]:
                     return substring
-        '''
-        # attempt 1 : brute force O(n^2)
-        for i in range(len(s)):
-            for j in range(i + 1, len(s)):
-                substring = s[i:j + 1]
-                if substring == substring[::-1]:
-                    substring_list.append(substring)
-        try:
-            return max(substring_list, key=len)
-        except ValueError:
-            return s[0]
-
-        '''
-
-print(Solution().longestPalindrome("ababad"))
-print(Solution().longestPalindrome("mwwfjysbkebpdjyabcfkgprtxpwvhglddhmvaprcvrnuxifcrjpdgnktvmggmguiiquibmtviwjsqwtchkqgxqwljouunurcdtoeygdqmijdympcamawnlzsxucbpqtuwkjfqnzvvvigifyvymfhtppqamlgjozvebygkxawcbwtouaankxsjrteeijpuzbsfsjwxejtfrancoekxgfyangvzjkdskhssdjvkvdskjtiybqgsmpxmghvvicmjxqtxdowkjhmlnfcpbtwvtmjhnzntxyfxyinmqzivxkwigkondghzmbioelmepgfttczskvqfejfiibxjcuyevvpawybcvvxtxycrfbcnpvkzryrqujqaqhoagdmofgdcbhvlwgwmsmhomknbanvntspvvhvccedzzngdywuccxrnzbtchisdwsrfdqpcwknwqvalczznilujdrlevncdsyuhnpmheukottewtkuzhookcsvctsqwwdvfjxifpfsqxpmpwospndozcdbfhselfdltmpujlnhfzjcgnbgprvopxklmlgrlbldzpnkhvhkybpgtzipzotrgzkdrqntnuaqyaplcybqyvidwcfcuxinchretgvfaepmgilbrtxgqoddzyjmmupkjqcypdpfhpkhitfegickfszermqhkwmffdizeoprmnlzbjcwfnqyvmhtdekmfhqwaftlyydirjnojbrieutjhymfpflsfemkqsoewbojwluqdckmzixwxufrdpqnwvwpbavosnvjqxqbosctttxvsbmqpnolfmapywtpfaotzmyjwnd"))
 
-print(Solution().longestPalindrome("esbtzjaaijqkgmtaajpsdfiqtvxsgfvijpxrvxgfumsuprzlyvhclgkhccmcnquukivlpnjlfteljvykbddtrpmxzcrdqinsnlsteonhcegtkoszzonkwjevlasgjlcquzuhdmmkhfniozhuphcfkeobturbuoefhmtgcvhlsezvkpgfebbdbhiuwdcftenihseorykdguoqotqyscwymtjejpdzqepjkadtftzwebxwyuqwyeegwxhroaaymusddwnjkvsvrwwsmolmidoybsotaqufhepinkkxicvzrgbgsarmizugbvtzfxghkhthzpuetufqvigmyhmlsgfaaqmmlblxbqxpluhaawqkdluwfirfngbhdkjjyfsxglsnakskcbsyafqpwmwmoxjwlhjduayqyzmpkmrjhbqyhongfdxmuwaqgjkcpatgbrqdllbzodnrifvhcfvgbixbwywanivsdjnbrgskyifgvksadvgzzzuogzcukskjxbohofdimkmyqypyuexypwnjlrfpbtkqyngvxjcwvngmilgwbpcsseoywetatfjijsbcekaixvqreelnlmdonknmxerjjhvmqiztsgjkijjtcyetuygqgsikxctvpxrqtuhxreidhwcklkkjayvqdzqqapgdqaapefzjfngdvjsiiivnkfimqkkucltgavwlakcfyhnpgmqxgfyjziliyqhugphhjtlllgtlcsibfdktzhcfuallqlonbsgyyvvyarvaxmchtyrtkgekkmhejwvsuumhcfcyncgeqtltfmhtlsfswaqpmwpjwgvksvazhwyrzwhyjjdbphhjcmurdcgtbvpkhbkpirhysrpcrntetacyfvgjivhaxgpqhbjahruuejdmaghoaquhiafjqaionbrjbjksxaezosxqmncejjptcksnoq"))
+print(Solution().longestPalindrome("ababad"))

006_zigzag-conversion.py

@@ -25,24 +25,6 @@ def convert(self, s, numRows):
                 i += 1
         else:
             return s
-        '''
-        col = 0
-        while row < numRows:
-            row_text = []
-            while col < len(s):
-                row_text.append(s[col])
-                print(row, col, s[col])
-                col += 2 * (numRows - 1)
-            row += 1
-            col = row
-            converted = converted + ''.join(row_text)
-
-        
-        for i in range(len(s)):
-            location = i % len(s)
-            converted.append(s[i])
-        return ''.join(converted)
-        '''
         return ''.join(converted)
 
 

015_3sum.py

@@ -8,8 +8,6 @@ def threeSumClosest(self, nums, target):
         nums.sort()
         current_sum = nums[0] + nums[1] + nums[2]
         for i in range(len(nums)):
-            # if nums[i] == nums[i - 1] and i > 0:
-            #     continue
             left = i + 1
             right = len(nums) - 1
 
@@ -24,6 +22,6 @@ def threeSumClosest(self, nums, target):
                     print(current_sum)
         return current_sum
 
-# print(Solution().threeSumClosest([-1, 2, 1, -4], 1))
+print(Solution().threeSumClosest([-1, 2, 1, -4], 1))
 
 print(Solution().threeSumClosest([0, 1, 2], 3))

016_3sum-closest.py

@@ -22,7 +22,6 @@ def fourSum(self, nums, target):
                     elif sum < target:
                         left += 1
                     else:
-                        # if [nums[i], nums[left], nums[right]] not in results:
                         results.append([nums[i], nums[j], nums[left], nums[right]])
                         left += 1
                         right -= 1
@@ -38,7 +37,7 @@ def fourSum(self, nums, target):
                             pass
         return results
 
-# print(Solution().fourSum([1, 0, -1, 0, -2, 2], 0))
+print(Solution().fourSum([1, 0, -1, 0, -2, 2], 0))
 
 print(Solution().fourSum([0, 0, 0, 0], 0))
 

018_4sum.py

@@ -17,24 +17,6 @@ def paranthesis(open, close, parenstring = ""):
         paranthesis(n - 1, n, "(")
 
         return parantheses
-        '''        
-        if n > 1:
-            generated = Solution().generateParenthesis(n - 1)
-            for g in generated:
-                parantheses.append("(" + g + ")")
-                parantheses.append("()" + g)
-                if g + "()" != "()" + g:
-                    parantheses.append(g + "()")
-            return parantheses
-        elif n == 1:
-            return ["()"]
-        else:
-            return []
-        '''
-# print(Solution().generateParenthesis(2))
-# print(Solution().generateParenthesis(3))
-print(Solution().generateParenthesis(4))
-
-# ['()(())()']
-
-# ["(())(())"]
+print(Solution().generateParenthesis(2))
+print(Solution().generateParenthesis(3))
+print(Solution().generateParenthesis(4))

022_generate-parantheses.py

@@ -28,8 +28,6 @@ def swapPairs(self, head):
                 break
 
         return new_head.next
-        # a -> b -> c -> d
-        # b -> a -> d -> c
 
 
 def CreateList(num_list):

024_swap-nodes-in-pairs.py

@@ -0,0 +1,14 @@
+class Solution(object):
+    def search(self, nums, target):
+        """
+        :type nums: List[int]
+        :type target: int
+        :rtype: int
+        """
+        try:
+            return nums.index(target)
+        except ValueError:
+            return -1
+
+
+print(Solution().search([4, 5, 6, 7, 0, 1, 2], 8))

033_search-in-rotated-sorted-array.py

@@ -0,0 +1,38 @@
+class Solution(object):
+    def searchRange(self, nums, target):
+        """
+        :type nums: List[int]
+        :type target: int
+        :rtype: List[int]
+        """
+        l = int(len(nums) / 2)
+        if nums and l == 0 and nums[l] == target:
+            return [0, 0]
+        elif l > 0:
+            if nums[l] < target:
+                j, k = Solution().searchRange(nums[l:], target)
+                if j != -1:
+                    j += l
+                    k += l
+            elif nums[l] > target:
+                j, k = Solution().searchRange(nums[:l], target)
+            else:
+                j1, k1 = Solution().searchRange(nums[:l], target)
+                j2, k2 = Solution().searchRange(nums[l:], target)
+                if j1 != -1:
+                    if j2 != -1:
+                        j, k = j1, k2 + l
+                    else:
+                        j, k = j1, k1
+                elif j2 != -1:
+                    j, k = j2 + l, k2  + l
+                else:
+                    j, k = -1, -1
+            return [j, k]
+        else:
+            return [-1, -1]
+
+
+print(Solution().searchRange([5, 7, 7, 8, 8, 10], 8))
+
+print(Solution().searchRange([], 3))

034_search-for-a-range.py

@@ -13,5 +13,4 @@ def searchInsert(self, nums, target):
                 break
         return pos
 
-
 print(Solution().insertPosition([1, 2, 3, 4, 5, 6], 5))

035_search-insert-position.py

@@ -0,0 +1,22 @@
+class Solution(object):
+    def isValidSudoku(self, board):
+        """
+        :type board: List[List[str]]
+        :rtype: bool
+        """
+        rows = []
+        cols = []
+        sqrs = []
+        for i, row in enumerate(board):
+            for j, char in enumerate(row):
+                if char != ".":
+                    rows.append((i, char))
+                    cols.append((j, char))
+                    sqrs.append((int(i / 3), int(j / 3), char))
+        if len(rows) == len(set(rows)) and len(cols) == len(set(cols)) and len(sqrs) == len(set(sqrs)):
+            return True
+        else:
+            return False
+
+
+print(Solution().isValidSudoku([[".","8","7","6","5","4","3","2","1"],["2",".",".",".",".",".",".",".","."],["3",".",".",".",".",".",".",".","."],["4",".",".",".",".",".",".",".","."],["5",".",".",".",".",".",".",".","."],["6",".",".",".",".",".",".",".","."],["7",".",".",".",".",".",".",".","."],["8",".",".",".",".",".",".",".","."],["9",".",".",".",".",".",".",".","."]]))

036_valid-sudoku.py

@@ -0,0 +1,19 @@
+class Solution(object):
+    def permute(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: List[List[int]]
+        """
+        perms = []
+        if len(nums) > 1:
+            for n in range(len(nums)):
+                below = Solution().permute(nums[:n] + nums[n+1:])
+                if below:
+                    for bel in below:
+                        bel.insert(0, nums[n])
+                        perms.append(bel)
+        else:
+            perms.append(nums)
+        return perms
+
+print(Solution().permute([1, 1, 2]))

046_permutations.py

@@ -0,0 +1,24 @@
+class Solution(object):
+    def permuteUnique(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: List[List[int]]
+        """
+        perms = []
+        used = []
+        if len(nums) > 1:
+            for n, num in enumerate(nums):
+                if num in used:
+                    pass
+                else:
+                    used.append(num)
+                    below = Solution().permuteUnique(nums[:n] + nums[n + 1:])
+                    if below:
+                        for bel in below:
+                            bel.insert(0, num)
+                            perms.append(bel)
+        else:
+            perms.append(nums)
+        return perms
+
+print(Solution().permuteUnique([1,1,2]))

047_permutations-ii.py

@@ -0,0 +1,10 @@
+class Solution(object):
+    def myPow(self, x, n):
+        """
+        :type x: float
+        :type n: int
+        :rtype: float
+        """
+        return x ** n
+
+print(Solution().myPow(2.03, 3))

050_pow-x-n.py

@@ -0,0 +1,25 @@
+class Solution(object):
+    def merge(self, nums1, m, nums2, n):
+        """
+        :type nums1: List[int]
+        :type m: int
+        :type nums2: List[int]
+        :type n: int
+        :rtype: void Do not return anything, modify nums1 in-place instead.
+        """
+        i = 0
+        j = 0
+        while i < m and j < n:
+            if nums1[i] > nums2[j]:
+                nums1.insert(i, nums2[j])
+                j += 1
+            else:
+                i += 1
+
+        while j < n:
+            nums1.append(nums2[j])
+            j += 1
+
+        print(nums1)
+
+Solution().merge([0, 2, 4], 3, [1, 3, 5, 6], 4)

088_merge-sorted-array.py

@@ -0,0 +1,27 @@
+class TreeNode(object):
+     def __init__(self, x):
+         self.val = x
+         self.left = None
+         self.right = None
+
+class Solution(object):
+    def isSameTree(self, p, q):
+        """
+        :type p: TreeNode
+        :type q: TreeNode
+        :rtype: bool
+        """
+        if p and q:
+            return p.val == q.val and Solution().isSameTree(p.left, q.left) and Solution().isSameTree(p.right, q.right)
+        else:
+            return p is q
+
+tree_a = TreeNode(1)
+tree_a.left = TreeNode(2)
+tree_a.right = TreeNode(2)
+
+tree_b = TreeNode(1)
+tree_b.left = TreeNode(2)
+tree_b.right = TreeNode(2)
+
+print(Solution().isSameTree(tree_a, tree_b))