JobsJob TrackerJob alerts

CRED · 13 questions

All 13Coding 7System Design 2Low-Level Design 2Behavioral 1
  • Design an Analytics SDK for mobileSystem Design
  • Design a Min StackCoding
  • Design a Notes appLow-Level Design
  • Design an LRU cacheLow-Level Design
  • Build a small CRED-like iOS app in one weekCoding
  • Animation-heavy Android proof of concept with Clean ArchitectureCoding
  • Core Android lifecycle and Clean Architecture discussion
  • Why move from backend to Android, and career goalsBehavioral
  • Animation-heavy POCCoding
  • DSA and PuzzlesCoding
  • Core Android and HLDSystem Design
  • CID Episode 100: Count distinct chemical drop areasCoding
  • No Pairs Allowed: Minimum substitutions for adjacent charactersCoding
← CRED questions
  1. Interview questions
  2. CRED
  3. No Pairs Allowed: Minimum substitutions for adjacent characters
Coding

No Pairs Allowed: Minimum substitutions for adjacent characters

Filed under CRED

The question

For each word in a list, determine the minimum number of character substitutions required so that no two adjacent characters are equal.

No write-up yet. Related questions below have one.

Related CRED questions

  • Design a Min Stack
  • Build a small CRED-like iOS app in one week
  • Animation-heavy Android proof of concept with Clean Architecture
  • Animation-heavy POC
  • DSA and Puzzles
← CID Episode 100: Count distinct chemical drop areas

Collected from public candidate posts and coding forums. Updated Nov 2026.