Calculate min for a grid starting from top row and going down in 3 directions (down-left, down, down-right). 00 01 02 -> j 10 11 12 20 ...

Process items in batches with bool batch.tryAdd(item). This is a bit clunky as it mixes the batch population and sending. process(sender,...

range: min max // pre-condition: ranges are sorted and are not overlapping // O(logn) range find(x, ranges): if ranges == null:...

- Break (or open) circuit on consecutive 'n' handled exception or handled result for breakDuration interval. Throw brokenCircuitEx w...

scenarios: - POST 202 GET 404, 200 - POST 409 - POST 202 GET 500 retry POST - POST 500 retry POST Due to two operations (cach...

rng = new // dialValue: 0 - 100% bool toDial(dialValue): if !(0

// polly retry pollyRetry_ExecuteAndCapture( work, retryCount, delayer, handlesException, handlesResult): pollyResult = ...

se m 12 21 sme 123 231 312 int findMinRotated(a, start = 0, end = a.length() -1): if start > end: throw if start == e...

For left, right, up, down directions. path maze(m, r = 0, c = 0): if m == null || m.length() == 0 || m[0].length() == 0: throw ...

binarytreeIterator: stack, prevn ctor(tree): if tree == null: throw stack = new prevn = null ...