marctrem

#!/usr/bin/env ocaml

#use "topfind"
#thread
#require "core"

open Core

type name_unset
type name_set

marctrem

#!/usr/bin/env ocaml

#use "topfind"
#thread
#require "core"

open Core

type name_unset
type name_set

marctrem

#!/usr/bin/env ocaml

#use "topfind"
#thread
#require "core"

open Core

type name_unset
type name_set

marctrem

#!/usr/bin/env ocaml

#use "topfind"
#thread
#require "core"

open Core

type name_unset
type name_set

marctrem

{
  "type": "record",
  "namespace": "gov.ed.schoolofrock",
  "name": "Student",
  "doc": "Represents a student",
  "fields": [
    {
      "name": "name",
      "type": "string"
    },

marctrem

Keybase proof

I hereby claim:

• I am marctrem on github.
• I am marctrem (https://keybase.io/marctrem) on keybase.
• I have a public key whose fingerprint is 37B8 7FED C17E 1618 E791 0A3B A4F4 2127 2352 1613

To claim this, I am signing this object:

marctrem

(defn solution [num] 
  (let [num (str num) 
        freq (frequencies num) 
        biggest (->> (map #(repeat (get freq (char (+ 48 %)) 0) %) (range 9 -1 -1)) 
                     flatten 
                     (clojure.string/join "") 
                     read-string)] 
       
        (if (> biggest 100000000) -1 biggest)))

marctrem

#!/usr/bin/python3

'''
 The MIT License (MIT)

Copyright (c) 2015 Marc-André Tremblay

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights

marctrem

#!/usr/bin/python3 
import collections

def find_new_paths(graph, destination, current_paths, closed_paths):
    new_paths = []
    for path in current_paths:
        last_element = path[-1]
        for next_element in graph[last_element]:
            new_path = list(path)
            new_path.append(next_element)