Coinbase Coding Interview Questions

Showing 6 problems of 28

• #1easyfrequently asked

  1. Two Sum

  Given an array of integers and a target, return the indices of two numbers that add up to the target. Coinbase asks this as a warm-up to gauge whether you reach for hash maps over nested loops on the very first problem.

  Solve →
• #2easyfrequently asked

  2. Valid Parentheses

  Determine if a string of brackets is balanced and properly nested. Coinbase uses this to test stack fundamentals — order-book matching engines lean on the same LIFO discipline.

  Solve →
• #3easyfrequently asked

  3. Merge Two Sorted Lists

  Splice two sorted linked lists into one sorted list. Coinbase uses this to test pointer manipulation — a common building block when merging streams of order-book updates from different feeds.

  Solve →
• #6easyfrequently asked

  6. Search Insert Position

  Given a sorted array, find the index where a target should be inserted to maintain order. Coinbase asks this because it's the building block for inserting a new limit order at the right price level in an order book.

  Solve →
• #7easyfrequently asked

  7. Maximum Subarray

  Find the contiguous subarray with the largest sum. Coinbase asks this to test the local-vs-global pattern — the same shape shows up when finding the most profitable contiguous holding window in price data.

  Solve →
• #9easyfrequently asked

  9. Merge Sorted Array

  Merge two sorted arrays in place, with nums1 sized large enough to hold both. Coinbase asks this because in-place merges show up everywhere in matching engines — the destination buffer is already allocated.

  Solve →