Card Range Obfuscation Part 2
Reported by candidates from Stripe's online assessment. Pattern, common pitfall, and the honest play if you blank under the timer.
Stripe's Card Range Obfuscation Part 2 hit candidates in November 2024, and it's a string manipulation problem wrapped in payment domain logic. You're not building a payment processor. You're taking card ranges, applying obfuscation rules, and outputting a formatted result. The trick is parsing the input format correctly and handling edge cases around what gets masked and what stays visible. If you blank on the exact obfuscation scheme during the live OA, StealthCoder reads the problem statement and feeds you the pattern in real time.
Pattern and pitfall
This is a string and array problem that tests your ability to work with structured data and conditional masking logic. You'll need to parse input (likely card ranges in a specific format), apply obfuscation rules (probably masking certain digits while preserving others), and format the output. The common pitfall is misunderstanding which digits to obfuscate, off-by-one errors in range boundaries, or getting confused by the 'Part 2' context (there's likely a Part 1 with simpler rules). The pattern is pattern matching and conditional logic, not deep algorithms. Build a clean parsing step, apply the masking rule consistently, and validate against examples. StealthCoder is your safety net if you misread the obfuscation spec under interview pressure.
If you see this problem in your OA tomorrow, the play is to recognize the pattern in 30 seconds. StealthCoder buys you that recognition.
You can drill Card Range Obfuscation Part 2 cold, or you can hedge it. StealthCoder runs invisibly during screen share and surfaces a working solution in under 2 seconds. The proctor sees the IDE. They don't see what's behind it. Built by an Amazon engineer who passed his OA cold and still thinks the filter is broken.
Get StealthCoderRelated leaked OAs
You've seen the question.
Make sure you actually pass Stripe's OA.
Stripe reuses patterns across OAs. Built by an Amazon engineer who passed his OA cold and still thinks the filter is broken. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Card Range Obfuscation Part 2 FAQ
Is this actually hard or just confusing?+
It's confusing, not hard. The algorithm is straightforward once you parse the input format. The 'Part 2' means they added a twist to Part 1, so the obfuscation rule is probably more nuanced. Read the examples carefully. They tell you everything.
What does 'obfuscation' mean in the Stripe context?+
It means masking sensitive digits (usually replacing them with '*' or '0') while keeping a prefix or suffix visible for card identification. The rule likely specifies: show first N digits, hide middle M, show last K. Find that rule in the examples.
How do I handle multiple card ranges?+
Expect an array or list of ranges. Loop through each, apply the obfuscation rule to each range, and return formatted output. No sorting needed unless the problem says so. Keep it simple.
Can I solve this in 15 minutes?+
Yes, easily, if you parse the input correctly in the first 3 minutes. Spend time on examples, not on algorithm design. The hard part is understanding what the problem wants, not coding it.
What if I don't know what card ranges are?+
A card range is a start and end card number (e.g., 4111111111111111 to 4111111111111120). You're transforming them, not validating them. Treat them as strings or integers. The problem will clarify.