I hereby claim:
- I am daronstinnett on github.
- I am daronstinnett (https://keybase.io/daronstinnett) on keybase.
- I have a public key ASDKpf5jR5y3tu-wDD_eMjNt5e51xpYBqja7Zv2eeR6GcAo
To claim this, I am signing this object:
Daron Stinnett daronstinnett
daronstinnett
/ finexio_payment_file_schema.json
Last active
April 3, 2021 18:15
Finexio's Payment File JSON Schema
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| { | |
| "$id": "https://gist.githubusercontent.com/daronstinnett/082a47e344732157571923bdcf6a584f/raw/e4f9747c1a1f065bcfe4a495d3b35e0972626417/finexio_payment_file_schema.json", | |
| "$schema": "https://json-schema.org/draft/2020-12/schema", | |
| "title": "Finexio Payment File (Standard)", | |
| "type": "array", | |
| "properties": { | |
| "BuyerID": { | |
| "type": "string", | |
| "description": "A value provided by the Customer to uniquely identify the Buyer (the entity making the payment).", | |
| "maxLength": 100 |
daronstinnett
/ keybase.md
Created
May 14, 2018 20:56
daronstinnett
/ wordpattern.py
Last active
February 2, 2016 16:43
My solution to coding problem: write a function that determines if a string matches a pattern where pattern is expressed as a string of characters.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| recursions = 0 | |
| words_at_position = {} | |
| def matches_pattern(pattern, input, start, pattern_map): | |
| global recursions | |
| recursions = recursions + 1 if start else 0 | |
| # empty pattern or end of input that we've gone as | |
| # far as possible. If both are true: jackpot |