← SOTI Interview Insights

SOTI·Software Engineer·Onsite - Cross-functional / Panel·Intermediate

Intermediate
Apr 2026

Summary

Second round at SOTI for a Software Engineer role, panel format with two Architects each throwing one question at you. Pretty focused on system design fundamentals.

Questions Asked (1)

Q1

Design an API that functions like an IP firewall blacklist. How would you structure the cache layer?

System DesignAPI & IntegrationsTechnical Trade-offs
Author's notes

The API surface itself wasn't the hard part, it's basically a lookup service.

Create a free account to read the full note

AI HintsAI Generated

Suggested Approach

Start by clarifying requirements: read-heavy vs write-heavy, latency tolerance, consistency needs, and scale. Then propose a layered cache architecture (in-memory + distributed) with a clear eviction and invalidation strategy, and discuss trade-offs between speed, memory, and accuracy.

Pro tip: Mention that a firewall blacklist is a classic read-heavy, low-latency use case, so caching is essential—but also highlight that false positives (blocking legitimate IPs) are costly, so you need a way to handle cache misses and stale entries gracefully.

1. Clarify Requirements and Constraints

Ask about scale (number of IPs, QPS), latency requirements, consistency needs (e.g., how quickly a newly blacklisted IP must be enforced), and whether the list is static or dynamic.

2. Choose Cache Layers and Data Structures

Propose an in-memory cache (e.g., LRU) for hot IPs and a distributed cache (e.g., Redis) for the full blacklist. Use a space-efficient data structure like a Bloom filter for probabilistic membership checks, backed by exact lookups.

3. Define Cache Population and Eviction

Explain how entries get into the cache: lazy loading on miss or proactive warming. Discuss eviction policies (LRU, LFU) and TTLs to bound staleness.

4. Design Invalidation and Consistency

Describe how updates propagate: write-through, write-behind, or pub/sub invalidation. Address how to handle cache misses and avoid blocking on the primary datastore.

5. Discuss Trade-offs and Failure Modes

Compare memory vs speed, consistency vs availability, and discuss what happens if the cache fails (e.g., fallback to database, rate limiting).

Key Points to Mention

  • Read-heavy workload: cache is critical for low-latency IP checks.
  • Use of Bloom filters to reduce memory footprint and false positives.
  • Cache invalidation strategies (TTL, pub/sub) to handle dynamic blacklists.
  • Eviction policies (LRU) and their impact on hit rate.
  • Handling cache misses: fallback to persistent store without causing latency spikes.
  • Trade-offs between consistency (immediate enforcement) and availability/performance.

AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.