Skip to content

Instantly share code, notes, and snippets.

View sheldonrobinson's full-sized avatar

Sheldon Robinson sheldonrobinson

View GitHub Profile
@sheldonrobinson
sheldonrobinson / rotateImage.py
Created October 3, 2019 22:20
CodeSignal Solution: rotateImage
def rotateImage(a):
w = len(a)
h = w
img =[0]*h
for col in range(h):
img_row = [0]*w
for row in range(w):
img_row[h-row-1] = a[row][col]
img[col] = img_row
@sheldonrobinson
sheldonrobinson / sudoku2.py
Last active October 5, 2019 02:11
CodeSignal Solution for sudoku2
def sudoku2(grid):
# test row
tab = [[False for col in range(9)] for row in range(9)]
cols = [[False for col in range(9)] for row in range(9)]
rows = [[False for col in range(9)] for row in range(9)]
for r in range(9):
for c in range(9):
if grid[r][c] == ".":
continue
@sheldonrobinson
sheldonrobinson / isCryptSolution.py
Created October 5, 2019 02:12
CodeSignal Solution isCryptSolution
def decrypt(word, dictionary):
lst =[]
for c in word:
lst.append(dictionary[c])
return ''.join(lst)
def isCryptSolution(crypt, solution):
dict = {}
for r in solution:
dict[r[0]] = r[1]
@sheldonrobinson
sheldonrobinson / removeKFromList.py
Created October 5, 2019 02:35
CodeSignal Solution removeKFromList
# Singly-linked lists are already defined with this interface:
# class ListNode(object):
# def __init__(self, x):
# self.value = x
# self.next = None
#
def removeKFromList(l, k):
if l == None:
return l
while l != None and l.value == k:
@sheldonrobinson
sheldonrobinson / addTwoHugeNumbers.py
Created October 5, 2019 04:06
CodeSignal Solution addTwoHugeNumbers
# Singly-linked lists are already defined with this interface:
# class ListNode(object):
# def __init__(self, x):
# self.value = x
# self.next = None
#
def addTwoHugeNumbers(a, b):
lst_a = {}
lst_b = {}
i=0
@sheldonrobinson
sheldonrobinson / mergeTwoLinkedLists.py
Created October 5, 2019 07:03
CideSignal Solution mergeTwoLinkedLists
# Singly-linked lists are already defined with this interface:
# class ListNode(object):
# def __init__(self, x):
# self.value = x
# self.next = None
#
def mergeTwoLinkedLists(l1, l2):
if l1 == None and l2 == None:
return None
@sheldonrobinson
sheldonrobinson / rearrangeLastN
Created October 5, 2019 07:15
CodeSignal Solution rearrangeLastN
# Definition for singly-linked list:
# class ListNode(object):
# def __init__(self, x):
# self.value = x
# self.next = None
#
def rearrangeLastN(l, n):
if n == 0:
return l
front, back = l, l
@sheldonrobinson
sheldonrobinson / reverseNodesInKGroups.py
Created October 5, 2019 07:17
CodeSignal solution reverseNodesInKGroups
def reverseList(head, tail):
prev = None
while prev != tail:
prev, prev.next, head = head, prev, head.next
return prev
def reverseNodesInKGroups(l, k):
if k < 2:
return l
@sheldonrobinson
sheldonrobinson / isTreeSymmetric.py
Created October 6, 2019 00:14
CodeSignal Solution isTreeSymmetric
#
# Binary trees are already defined with this interface:
# class Tree(object):
# def __init__(self, x):
# self.value = x
# self.left = None
# self.right = None
def isEqual(left, right):
if left == None and right == None:
@sheldonrobinson
sheldonrobinson / kthSmallestInBST.py
Created October 6, 2019 00:26
CodeSignal Solution kthSmallestInBST
#
# Binary trees are already defined with this interface:
# class Tree(object):
# def __init__(self, x):
# self.value = x
# self.left = None
# self.right = None
def kthSmallestInBST(t, k):
def inorder(r):
return inorder(r.left) + [r.value] + inorder(r.right) if r else []