Sidharth Shanker squidarth

The Problem

Blokus is a fun game that involves placing different size/shape/color pieces on a board.

The pieces look like this:

Errors for fig run web goose up

...
Step 8 : RUN godep restore
 ---> Running in aad26f30bad2
 ---> 6d9639abe01c
Removing intermediate container aad26f30bad2
Successfully built 6d9639abe01c

	-- Zoom Version

	on run
	tell application "zoom.us"
	activate
	tell application "System Events" to tell process "zoom.us" to keystroke "a" using {shift down, command down} -- Mute/Unmute command in Zoom
	end tell
	end run

	-- Google Meet Version

	fn incr_int(a: &mut u32) {
	*a += 1;
	}

	fn main() {
	let mut a = 42;
	let mut_ref = &mut a;
	incr_int(&mut *mut_ref);
	incr_int(&mut *mut_ref);

	import System.Environment
	import Data.List.Split
	import Data.List
	import Data.List.Utils (replace)
	import Data.String.Utils (strip)

	getStringList :: String -> [String]
	getStringList str = splitOn " " str

	-- costAtJ is the cost incurred by placing a newline

	# Usage: python consistent_printer.py max_line_length file_path
	# Summary: Prints out the contents of a file given a max line length,
	# ensuring that the space at the end of each line is minimal.
	# Example: `python consistent_printer.py 100 words.txt`

	import sys

	def get_consistent_lines(max_line_length, string):
	# This function takes a string and a maximum line length,
	# and returns a string with newlines inserted such that

	fzf-history-widget() {
	local selected restore_no_bang_hist
	if selected=$(fc -l 1 \| fzf +s --tac +m -n2..,.. --tiebreak=index --toggle-sort=ctrl-r -q "$LBUFFER"); then
	num=$(echo "$selected" \| head -1 \| awk '{print $1}' \| sed 's/[^0-9]//g')
	LBUFFER=!$num
	if setopt \| grep nobanghist > /dev/null; then
	restore_no_bang_hist=1
	unsetopt no_bang_hist
	fi
	zle expand-history

	#!/bin/bash
	i=0
	files=()
	for file in $(find ./spec -name "*_spec.rb")
	do
	if [ $(($i % $CIRCLE_NODE_TOTAL)) -eq $CIRCLE_NODE_INDEX ]
	then
	files+=" $file"
	fi
	((i++))