Feature Flag Service

Interview-Ready Approach

1) Clarify Scope and SLOs

• •Problem statement: Design a feature flag service that lets teams toggle features, run A/B tests, and do gradual rollouts.
• •Design for a peak load target around 500 RPS (including burst headroom).
• •Applications / projects: ~500
• •Total flags: ~10,000
• •Flag evaluations/second: ~100,000
• •SDK evaluation time: < 10 ms (local cache)
• •Config propagation delay: < 60 seconds

2) Capacity Planning Method

• •Convert traffic and growth constraints into request rate, storage growth, and concurrency budgets.
• •Keep at least 2-3x safety margin per tier (ingress, compute, storage, async workers).
• •Reserve explicit latency budgets per hop so p95 can be defended in review.

3) Architecture Decisions

• •Databases: Define a clear system-of-record and design read/write paths separately before adding optimizations.
• •API Design: Standardize API boundaries, idempotency keys, pagination, and error contracts first.
• •Caching: Put cache on hot read paths first and pick cache-aside or write-through explicitly.

4) Reliability and Failure Strategy

• •Use strong write constraints (transactions or conditional writes) and explicit backup/restore strategy.
• •Apply strict input validation and backward-compatible versioning.
• •Bound staleness with TTL + invalidation hooks for critical entities.

5) Validation Plan

• •Run one peak-load test, one dependency-degradation test, and one failover test.
• •Verify idempotency for all retried writes and async consumers.
• •Track user-facing SLOs first: p95 latency, error rate, and successful throughput.

6) Trade-offs to Call Out in Interviews

• •Databases: SQL gives stronger transactional guarantees; NoSQL often gives better write scaling and flexibility.
• •API Design: Rich APIs improve developer speed but can create long-term compatibility burden.
• •Caching: Higher hit rate cuts latency/cost, but stale data and invalidation bugs become primary risks.

Practical Notes

• •SDKs should cache all flag rules locally - evaluation happens in-memory with no network call. The SDK polls the server periodically for updates.
• •Server-side: store flag rules in a database, cache in Redis. On flag change, update the cache; SDKs pick up changes on next poll.
• •Percentage rollouts: hash(user_id + flag_name) % 100 → deterministic, consistent bucketing. The same user always gets the same variant.