I hereby claim:
- I am friedenberg on github.
- I am friedenberg (https://keybase.io/friedenberg) on keybase.
- I have a public key whose fingerprint is 19B2 F931 85BD 7C8C AB05 DFD8 1538 B6E2 521C 7FD5
To claim this, I am signing this object:
Regex | |
Object do( | |
regSwitch := method( | |
body := call argAt(0) | |
default := nil | |
while(body != nil, | |
if(RegexSwitchCase hasSlot(body name), | |
#this pulls the first message out of the chain and isolates it | |
current_body := body clone do(setNext(nil)) |
I hereby claim:
To claim this, I am signing this object:
Problem:
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
Example:
nums = [2, 5, 4], target = 6
Problem:
Example:
Input: [1, 2, 3, 4, 5, 6]
Result: 1->2->3->4->5->6->null
Input: [1, 3, 5, 2, 4]
Problem:
Restrictions:
Problem:
Example:
"hard so be to have not does interview coding"
"coding interview does not have to be so hard"
This is an OpenPGP proof that connects my OpenPGP key to this Github account. For details check out https://keyoxide.org/guides/openpgp-proofs
[Verifying my OpenPGP key: openpgp4fpr:EFBC28233D39BF28E26470D7FC97FFC960963978]
package main | |
import ( | |
"io" | |
"os" | |
"strings" | |
) | |
type ControlCharacter int |
function! Gf() | |
let l:f = expand("<cfile>") . ".md" | |
if !filereadable(l:f) | |
echo system("zit checkout -include-akte " . expand("<cfile>")) | |
endif | |
execute 'tabedit' l:f | |
" try |