Interview Experience
Problem Two strings are "fingerprint-equivalent" if one can be obtained from the other by consistently renaming characters. That is, there exists a bijection between the character sets such that applying it to every position of string A produces string B. Given a list of strings, group them by fingerprint equivalence class and return the groups. Example: Explanation: "aab" -> normalize as 0,0,1; "xxy" -> 0,0,1; "bba" -> 0,0,1. "abc" -> 0,1,2; "xyz" -> 0,1,2. Approach Normalize each string by map…
Full Details
🔒
Unlock all Affirm questions
Full insider details, leaked discussions, and candidate experiences.
Get full access — $100 a year, unlimited accessAbout This Question
This is a candidate experience report from a affirm interview during the phone round.
It covers the following topics: Coding, Onsite, Phone, Strings .
More Affirm Interview Questions
1p3a
affirm fulltime software engineer tech phone screen interview overview
InterviewDB
Card Game - OOD Deck, Hand, and Turn-Based Game Engine
1p3a
Affirm Full-Time Tech Phone Screen Interview Experience
InterviewDB
Decision Tree - Implement Predict Traversal for a Binary Classification Tree
InterviewDB
Dispute Status - State Machine for Payment Dispute Lifecycle