Question Details
Problem Compress a string by replacing consecutive repeated characters with the character followed by its count. Likely LeetCode equivalent LC 443 - String Compression Tags Coding, strings, two_pointers, phone
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 reported interview question 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