theabbie

from random import *

# Floyd Sampler
def sampler(N, K):
    res = set()
    for i in range(N - K, N):
        j = randint(0, i)
        if j not in res:
            res.add(j)
        else:

theabbie

from random import *

def randTree(N):
    edges = []
    comps = [[i] for i in range(N)]
    for _ in range(N - 1):
        i = randint(0, len(comps) - 1)
        j = randint(0, len(comps) - 2)
        if j == i:
            j += 1

theabbie

Lights Out: https://veerasundar.com/lights-out-online-game/

Run Here: https://ideone.com/a1Go1a

Edit beg variable to set initial state, 1 for lights on and 0 for off.

Program outputs list of (x, y) coordinates you need to press to solve it in optimal moves.

The Algorithm uses Breadth-First-Search by considering state of game as graph node.

theabbie

def merge(arr, i, mid, j, extra):
    x = i
    y = mid
    while x < mid and y < j:
        if arr[x] <= arr[y]:
            extra[x + y - mid] = arr[x]
            x += 1
        else:
            extra[x + y - mid] = arr[y]
            y += 1

theabbie

1 two-sum
2 add-two-numbers
3 longest-substring-without-repeating-characters
4 median-of-two-sorted-arrays
5 longest-palindromic-substring
6 zigzag-conversion
7 reverse-integer
8 string-to-integer-atoi
9 palindrome-number
10 regular-expression-matching

theabbie

import random
from time import sleep

class Human:
    def __init__(self):
        self.human = [[" ", "o", " "], ["/", "|", "\\"], ["/", " ", "\\"]]
        self.front = False
        self.commandmap = {
            "left hand to head": self.leftHandToHead,
            "left hand to hip": self.leftHandToHip,

theabbie

def encode(s):
    n = len(s)
    res = []
    i = 0
    while i < n:
        ctr = 1
        while i < n - 1 and s[i] == s[i + 1]:
            ctr += 1
            i += 1
        if ctr == 1:

theabbie

def pow(a, b):
  curr = a
  res = 1
  while b:
    if b & 1:
      res *= curr
    b = b >> 1
    curr *= curr
  return res

theabbie

class Node:
  def __init__(self, val = None):
    self.left = None
    self.right = None
    self.val = val
    self.end = False

class TrieMap:
  def __init__(self):
    self.root = Node()

theabbie

class Node:
  def __init__(self):
    self.child = {}
    self.end = False

class Trie:
  def __init__(self):
    self.root = Node()
    
  def insert(self, s):