← Ramp Interview InsightsSoftware Engineer

Ramp·Software Engineer·Technical Phone Screen·Intermediate

IntermediatePrefer not to say
Jun 2026

Summary

Ramp SWE interview with a practical HTTP crawling problem. Less about clever algorithms and more about writing real working code that handles the messy parts, retries, deduplication, parsing, concurrency. Felt like a production task someone pulled straight from their codebase.

Questions Asked (1)

Q1

Given a starting URL, implement a crawler that follows URLs returned in HTTP responses until it finds one containing the string 'congrats'. Return that URL.

API & IntegrationsSystem DesignTechnical Trade-offs
Author's notes

My first instinct was to reach for recursion and I sketched that out, but the interviewer kept nudging me toward the practical stuff.

Create a free account to read the full note

AI HintsAI Generated

Suggested Approach

Start by clarifying requirements and constraints, then outline a BFS-based crawler with a visited set to avoid cycles. Discuss trade-offs around concurrency, politeness, and error handling, and mention how you would test and scale the solution.

Pro tip: Emphasize the importance of a visited set to prevent infinite loops and duplicate work, and discuss how you would handle rate limiting and robots.txt to show production awareness.

1. Clarify Requirements

Ask about constraints: maximum depth, concurrency limits, politeness policies, handling of non-HTML content, and whether the target string can appear in headers or only body.

2. Design Core Algorithm

Choose BFS with a queue and a visited set to explore URLs level by level, ensuring termination and avoiding cycles. Explain why BFS is suitable for finding the shortest path to the target.

3. Address Practical Concerns

Discuss error handling (timeouts, HTTP errors), rate limiting, robots.txt compliance, and concurrency (e.g., worker pool) to balance speed and politeness.

4. Implement and Test

Write pseudocode or actual code for the crawler, including URL normalization and content checking. Outline test cases: simple chain, cycles, multiple paths, and error scenarios.

5. Discuss Scalability and Trade-offs

Talk about scaling with distributed crawling, using a database for visited URLs, and trade-offs between depth-first and breadth-first, or between synchronous and asynchronous requests.

Key Points to Mention

  • Use a visited set to avoid infinite loops and duplicate processing.
  • BFS ensures the shortest path to the target URL.
  • Handle HTTP errors, timeouts, and non-200 responses gracefully.
  • Respect robots.txt and implement rate limiting to be a good citizen.
  • Consider concurrency with a worker pool to improve throughput while maintaining politeness.
  • Normalize URLs (e.g., resolve relative paths, remove fragments) to avoid duplicates.

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