Tim Rinkel
LightNews LightNews
dbugg.dev
Tim Rinkel
@dbugg.dev
19 followers 77 following 61 posts
Posts Replies Media Videos
dbugg.dev
With sooooooooooo many things on my plate to 'crastinate, I figured "What the hey, lets give it a go".

github.com/trinkel/0-in...
const repeatedIntegers = (input: number): number[] => { const output: number[] = []; for (let i = 1; i <= input; i++) { i.toString() .concat(' ') .repeat(i) .trim() .split(' ') .map((x) => output.push(Number(x))); } return output; }; console.log(repeatedIntegers(4)); // Array [1, 2, 2, 3, 3, 3, 4, 4, 4, 4] console.log(repeatedIntegers(14)); // Array [1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14]
November 18, 2025 at 3:35 AM
dbugg.dev
A few loops around the light and we're golden.

GitHub repo: github.com/trinkel/0-in...
TypeScript solution to this week's interview question: const validSequence = ['green', 'yellow', 'red']; const jMax = validSequence.length - 1; const isValidTrafficSequence = (sequence: string[]): boolean => { let result = true; let j: number; sequence.map((color, i) => { if (!i) { j = validSequence.indexOf(color); } if (color !== validSequence[j]) { result = false; } j >= jMax ? (j = 0) : j++; }); return result; };
June 11, 2025 at 2:58 AM
dbugg.dev
A little more wordy than I would have liked, but it's waaaay past my bedtime. (Sorry C, my up-in-the-middle-of-the-night-with-an-infant are three decades behind me. But do have fun with yours!)

github.com/trinkel/0-in...
const initialValue = []; const nestArray = (input) => { return input.reduceRight((accumulator, currentValue, i, array) => { i === array.length - 1 ? (accumulator = [currentValue]) : (accumulator = [currentValue].concat([accumulator])); return accumulator; }, initialValue); }; // Tests let inputs = [ [1, 2, 3, 4], // [1, [2, [3, [4]]]] [1], // [1] [10, 20, 30, 40, 50, 60], // [10, [20, [30, [40, [50, [60]]]]]] ]; inputs.forEach((input) => { console.dir(nestArray(input), { depth: null, color: true, breakLength: Infinity, compact: true, }); });
June 3, 2025 at 4:02 AM
dbugg.dev
In a million years I never thought I’d have to deal with RS232 again 🤯
An old dark gray Dell laptop, sitting on a stack of boxes. On the keyboard, are two RS232 cables which can’t be connected despite a series of nine pin to 25 pin and mail to female adapters.
May 9, 2025 at 9:41 PM
dbugg.dev
Ya know, one of these day I WILL get `.reduce()`. I think I'm getting close
const findLongestStreak = (values: boolean[], goal: number): number => { let streak = 0; const returns = values.reduce((streak, value) => (value ? streak + 1 : 0), 0); return returns >= goal ? returns : 0; }; console.log(findLongestStreak([true, true, false, true, true, true], 3)); // 3; console.log(findLongestStreak([true, true, true, false, true], 4)); // 0; console.log(findLongestStreak([true, true, true, true], 2)); // 4;
March 25, 2025 at 5:50 PM
dbugg.dev
I'd like to say the equation has been banging around inside my head since high school algebra, but that would be a lie.

Temporal will be nice. It's a bit sad that dealing with date formats for the proof (see the repo) was more work than than figuring out the discount 🤣 (github.com/trinkel/0-in...)
const discount = 0.1; const week = 60 * 60 * 24 * 7 * 1000; const calculatePrice = ( closeDate: Date, visitDate: Date, price: number ): number => { const weeks = Math.floor((closeDate.getTime() - visitDate.getTime()) / week); if (weeks <= 0) { return price; } else { return Math.pow(1 - discount, weeks) * price; } };
March 4, 2025 at 7:10 PM
dbugg.dev
Where I’ve lived for the last 28 years.
A desktop including a MacBook Pro with two Cinema Display Monitors. On showing VSCode, the other showing Wes Bos’ post. A Windows XP monitor with an old version of Crystal Reports displayed. And an older iMac that I’m afraid to turn on.
March 4, 2025 at 6:16 PM
dbugg.dev
We need more shields. Here's my try:
github.com/trinkel/0-in...
const findShieldBreak = (hits: number[], capacity: number): number => { let total = 0, breakIndex = -1; // fallthrough value for (let i = 0; i < hits.length; i++) { total += hits[i]; if (total > capacity) { breakIndex = i; break; // Exit if condition is met } } return breakIndex;
February 18, 2025 at 4:44 AM
dbugg.dev
Hey @cassidoo.co! Here's my attempt: github.com/trinkel/0-in...

Haven't had to think much about sets and unions since my Math for Elementary Education class in college. That's actually kind of shocking.
interface AvailableNumbersType { ranges: number[][]; available: number[]; } const playerPositions: Map<string, AvailableNumbersType> = new Map(); //available numbers from NFL table playerPositions .set('QB', { ranges: [[1, 19]], available: [] }) .set('RB', { ranges: [ [1, 49], [80, 89], ], available: [], }) .set('WR', { ranges: [ [1, 49], [80, 89], ], available: [], }) .set('TE', { ranges: [ [1, 49], [80, 89], ], available: [], }) .set('LS', { ranges: [[1, 99]], available: [] }); // etc . . . // expand available numbers playerPositions.forEach((position) => { let available: number[] = []; position.ranges.forEach((range) => { const length = range[1] - range[0] + 1; position.available.push( ...[...Array(length).keys()].map((n) => n + range[0]) ); }); }); const availableNumbers = (player: string, existingNumbers: number[]) => { const position = playerPositions.get(player); if (position) { return position.available.filter((x) => !existingNumbers.includes(x)); } else { console.log(`Player ${player} improperly defined`); return []; } }; // console.log(playerPositions.get('WR')); const players = ['QB', 'RB', 'WR', 'TE', 'OL', 'DL', 'LB', 'DB', 'KP', 'LS']; const vikingsNumbers = [ 3, 5, 6, 9, 15, 16, 18, 20, 22, 29, 30, 32, 42, 43, 44, 50, 51, 56, 58, 61, 64, 65, 67, 71, 75, 78, 83, 84, 87, 94, 97, 98, ]; players.map((player) => console.log( `Numbers available for ${player}:\n[${availableNumbers( player, vikingsNumbers )}]\n` ) ); Numbers available for QB: [1,2,4,7,8,10,11,12,13,14,17,19] Numbers available for RB: [1,2,4,7,8,10,11,12,13,14,17,19,21,23,24,25,26,27,28,31,33,34,35,36,37,38,39,40,41,45,46,47,48,49,80,81,82,85,86,88,89]
February 12, 2025 at 4:31 AM
dbugg.dev
It was kind of a blast to an earlier life seeing PostScript mentioned in the RPN article at Wikipedia. Who all out there has programmed in PostScript 🙋‍♂️.

Here's my evaluator. So hard to avoid using `eval()` even though its in the name: github.com/trinkel/0-in...
const evaluatePostfix = (str) => { answer = str.split('').reduce((a, b) => { if (Number(b)) { a.push(Number(b)); return a; } else { if (a.length < 2) { console.log( `\nStack underflow\n Stack: [${a}]\n Current operand: ${b}` ); return []; } switch (b) { case '+': a.push(Number(a.splice(-2, 1)) + Number(a.splice(-1, 1))); return a; break; case '-': a.push(a.splice(-2, 1) - a.splice(-1, 1)); return a; break; case '*': a.push(a.splice(-2, 1) * a.splice(-1, 1)); return a; break; case '/': a.push(a.splice(-2, 1) / a.splice(-1, 1)); return a; break; case '%': a.push(a.splice(-2, 1) % a.splice(-1, 1)); return a; break; default: console.log(`\n${b} is not a valid operator\nStack: [${a}]\n`); return []; } } }, []); if (answer.length > 1) { console.table( `\nWe're out of input but there's stuff left on the stack.\n Stack: [${answer}]\n Last value: [${answer.slice( -1 )}]\n` ); return []; } return answer.join(); }; const str = [ '12+', // 3 '56+7*', // 77 '452*+5+', // 19 '5935+%9--', // 10 '96/99+-45+53+4*/32*48-*', //-24 '31+92+-45+4*/4-8-', //-12.194 '31+92+-45+4*/4-8-*/+/', // Stack underflow '31+92+-45+4*k', // Not valid ]; str.forEach((str) => console.log(`Answer: ${evaluatePostfix(str)}\n-----------\n`) );
February 8, 2025 at 6:17 AM
dbugg.dev
Things that keep a nominal insane person awake at night . . .
let indices: number[] = []; const findAnagrams = (s: string, p: string): number[] => { const indices: number[] = []; for (let i = 0; i < s.length; i++) { let j = i; let test = p.split(''); const runner = () => { if (test.indexOf(s[j]) >= 0) { test.splice(test.indexOf(s[j]), 1); j++; test.length ? runner() : indices.push(i); } else { test = p.split(''); } }; runner(); } return indices; }; const subjects: [string, string][] = [ ['cbaebabacd', 'abc'], ['fish', 'cake'], ['abab', 'ab'], ['mononucleosis', 'on'], ['subsequences', 'es'], ]; subjects.forEach((subject) => { indices = findAnagrams(...subject); console.log(`${subject[1]} in ${subject[0]} (indices): [${indices}]`); });
January 30, 2025 at 1:50 AM
dbugg.dev
I gotta getta life.
type Integer = number; function longestSubsequence(seq: Integer[]) { if (!seq.every((el) => Number.isInteger(el))) { throw new Error('List is invalid (contains non-integer)'); return; } else { const results: number[] = []; let prev: number, leng = 1; seq.forEach((int: Integer, i) => { if (prev) { Math.abs(int - prev) === 1 ? leng++ : (leng = 1); } prev = int; leng === 1 ? results.push(0) : results.push(leng); // console.log(`results ${i}: ${results}`); }); return results.reduce((a, b) => Math.max(a, b)); } } const seq = [ [1, 2, 3, 4, 5], // 5 [5, 4, 3, 2, 1], // 5 [4, 2, 3, 1, 5], // 2 [10, 11, 7.2, 8, 9, 12], // Runtime error: List is invalid (contains non-integer) [10, 11, 7, 8, 9, 12, 3, 6, 24, 25, 26, 27, 28, 29, 10, 11, 15, 20], // 6 [35, 114, 115, 116, 117, 102, 115.13, 45, 46, 47, 48], // Runtime error: List is invalid (contains non-integer) [17, 345, 49, 45, 43, 12], // 0, // [44, 77, 46, 47, 48, 'string', 50], // Typescript: Compiler error // Javascript: Runtime error: List is invalid (contains non-integer) ]; for (var i = 0; i < seq.length; i++) { try { console.dir(`[${seq[i]}]: Longest sequence: ${longestSubsequence(seq[i])}`); } catch (error) { if (error instanceof Error) { console.error(error.message); } } }
January 24, 2025 at 7:07 AM
dbugg.dev
const natoWords = [ 'Alfa', 'Bravo', 'Charlie', 'Delta', 'Echo', 'Foxtrot', 'Golf', 'Hotel', 'India', 'Juliett', 'Kilo', 'Lima', 'Mike', 'November', 'Oscar', 'Papa', 'Quebec', 'Romeo', 'Sierra', 'Tango', 'Uniform', 'Victor', 'Whiskey', 'Xray', 'Yankee', 'Zulu', ]; const natoNumbers = [ 'Zero', 'One', 'Two', 'Three', 'Four', 'Five', 'Six', 'Seven', 'Eight', 'Nine', ]; const natoBit = {}; natoWords.forEach((bit) => { natoBit[bit.at(0).toLowerCase()] = bit; }); natoNumbers.forEach((num, i) => { natoBit[i.toString()] = num; }); // Add some punctuation natoBit['.'] = '(period)'; natoBit[','] = '(comma)'; natoBit[' '] = '(space)'; natoBit['!'] = '(exclamation)'; function natoify(str) { // replace accented characters with latin "equivalent" (not exhaustive) str = str.normalize('NFD').replace(/[\u0300-\u036f]/g, ''); return str .split('') .map((char) => natoBit[char.toLowerCase()]) .join(' '); } console.dir(natoify('Love 3 Crème Brûlée!')); // 'Lima Oscar Victor Echo (space) Three (space) Charlie Romeo Echo Mike Echo (space) Bravo Romeo Uniform Lima Echo Echo (exclamation)'
January 15, 2025 at 7:05 PM
dbugg.dev
function newYearsDay(year) { const options = { weekday: 'long' }; const day = new Date(`${year}-01-01`).getDay(); return new Intl.DateTimeFormat('en-US', options).format(day); } const year = 2025; console.log(`New Year's Day ${year} falls on ${newYearsDay(year)}`);
December 30, 2024 at 8:25 PM
dbugg.dev
Well, umm, yeah, best not to ask.

Closest thing to:
IBM Selectric II typewriter. Tan body with black keys sitting at an angle with no background. One of the more advanced model’s from the 1970s.
November 30, 2024 at 3:59 AM
dbugg.dev
I’m this old
IBM keyboard attached to computer punch card stacker with input and output stacks.
November 14, 2024 at 10:03 PM