https://leetcode.com/explore/featured/card/30-day-leetcoding-challenge/
https://leetcode.com/problems/single-number/
/**
// https://leetcode.com/problems/valid-parentheses/solution/ | |
/** | |
* @param {string} s | |
* @return {boolean} | |
*/ | |
function isValid(s) { | |
const stack = [] | |
const open = { | |
"(": true, |
function SequencePool(start=0, _next=(num)=>num+1) { | |
let pool = [start] | |
function next() { | |
let item = pool.pop() | |
if (!pool.length) { | |
pool.push(_next(item)) | |
} | |
return item | |
} |
function createStore(reducer, preloadedState) { | |
let state = preloadedState | |
const idPool = [0] | |
const listeners = new Map() | |
function getState() { | |
return state | |
} | |
function subscribe(listener) { |
function backspaceCompare(S, T) { | |
const s = evaluate(S) | |
const t = evaluate(T) | |
return s === t | |
}; | |
function evaluate(str) { | |
const output = [] | |
for (const char of str) { | |
if (char !== '#') { |
I hereby claim:
To claim this, I am signing this object:
0xe757E4deFDC56De8ab339fD912b16711C1B5380D |
player1 deck - d1 | |
player2 deck - d2 | |
d1_e == e(ki, d1) | |
d2_e == e(ki, d2) | |
p1 <-- d1, d2_e | |
p2 <-- d2, d1_e | |
seed - s |
{ | |
"name": "express-device", | |
"author": { | |
"name": "Rodrigo Guerreiro", | |
"url": "@rguerreiro" | |
}, | |
"description": "Browser detection library, built on top of express", | |
"keywords": [ | |
"browser", | |
"mobile", |
[ | |
{ "keys": ["super+right"], "command": "next_view" }, | |
{ "keys": ["super+left"], "command": "prev_view" }, | |
{ "keys": ["ctrl+z"], "command": "move_to", "args": {"to":"hardeol", "extend":false}} | |
] |