BitFont Renderer

CodingStripeLast reported May 2026High Frequency
Reported
10× across candidate reports
First seen
April 2025
Last reported
May 2026
Reported outcome
mixed

Problem Overview

You are given a bitmap lookup table (a dictionary/map) where each key is a character (e.g., 'J') and the value is a 2D array representing the character's bitmap, with 0 for background and 1 for foreground. The problem has three progressive parts. Part 1 is the same in every report;…

  • 5 candidate-reported follow-ups — the exact probes interviewers asked, with the trigger for each
  • The rest of the problem statement — full requirements, constraints, and edge cases
  • Approach and trade-offs — what passing candidates did, and the mistakes that sink people
Unlock the full Stripe catalog
Full problem statements, candidate-reported follow-ups, and walkthroughs — for every Stripe question.
Unlock with Pro
Already a member? Sign in
Verified Source
Every question is reconstructed from multiple independent candidate reports. Verbatim follow-ups, not invented ones.
Codex Fact-Checked
Technical claims, formulas, and scale numbers are reviewed against primary sources.
Interviewer Follow-ups
The exact follow-ups reported by candidates, with the trigger that prompts each one — plus the mistakes that sink people.
Is this helpful?