Coinbase Coding & Algorithms Interview Questions
Coinbase Coding & Algorithms interview questions focus on algorithmic rigor applied to high-throughput, security-sensitive systems. What’s distinctive is the product context: many problems are framed around integrity, ordering, and performance (for example ledger-like chains, streaming windows, and concurrency-safe logic), so interviewers often look for solutions that are not only correct but robust and efficient. You should expect an initial online assessment (usually timed), followed by live coding rounds and complementary conversations on system trade-offs and reliability. Practical coding skills, clear communication, and thoughtfulness about edge cases matter as much as getting a working solution. For interview preparation, emphasize mastery of core data structures and algorithms (arrays, hashes, trees/graphs, heaps, dynamic programming) plus patterns for streaming, hashing, and concurrency when relevant. Practice timed problems, explain your approach out loud, and write clean, testable code. In the week before interviews, do mock interviews that mimic the CodeSignal/online-assessment environment and review complexity analysis and common pitfalls like off-by-one errors and null handling. Paired practice and concise trade-off discussions will help you translate algorithmic solutions into engineering-ready answers.

"I got asked a hardcore MCM DP question and I saw it on PracHub as well. Solved that question in 5 minutes. Without PracHub I doubt I could solve it in 5 hours. Though somehow didn't get hired, perhaps I guess I solved it too fast? /s"

"Believe me i'm a student here jn US. Recently interviewed for MSFT. They asked me exact question from PracHub. I saw it the night before and ignored it cause why waste time on random sites. I legit wanna go back and redo this whole thing if I had chance. Not saying will work for everyone but there is certainly some merit to that website. And i'm gonna use it in future prep from now on like lc tagged"

"10 years of experience but never worked at a top company. PracHub's senior-level questions helped me break into FAANG at 35. Age is just a number."

"I was skeptical about the 'real questions' claim, so I put it to the test. I searched for the exact question I got grilled on at my last Meta onsite... and it was right there. Word for word."

"Got a Google recruiter call on Monday, interview on Friday. Crammed PracHub for 4 days. Passed every round. This platform is a miracle worker."

"I've used LC, Glassdoor, and random Discords. Nothing comes close to the accuracy here. The questions are actually current — that's what got me. Felt like I had a cheat sheet during the interview."

"The solution quality is insane. It covers approach, edge cases, time complexity, follow-ups. Nothing else comes close."

"Legit the only resource you need. TC went from 180k -> 350k. Just memorize the top 50 for your target company and you're golden."

"PracHub Premium for one month cost me the price of two coffees a week. It landed me a $280K+ starting offer."

"Literally just signed a $600k offer. I only had 2 weeks to prep, so I focused entirely on the company-tagged lists here. If you're targeting L5+, don't overthink it."

"Coaches and bootcamp prep courses cost around $200-300 but PracHub Premium is actually less than a Netflix subscription. And it landed me a $178K offer."

"I honestly don't know how you guys gather so many real interview questions. It's almost scary. I walked into my Amazon loop and recognized 3 out of 4 problems from your database."

"Discovered PracHub 10 days before my interview. By day 5, I stopped being nervous. By interview day, I was actually excited to show what I knew."

"I recently cleared Uber interviews (strong hire in the design round) and all the questions were present in prachub."
"The search is what sold me. I typed in a really niche DP problem I got asked last year and it actually came up, full breakdown and everything. These guys are clearly updating it constantly."
Design an in-memory banking system
Implement an in-memory banking system (e.g., in Java) that supports the following operations on user accounts. Assume user IDs are unique strings and ...
Implement cursor-based query pagination
You are building a small in-memory database that stores rows with the following fields: - id (string, unique) - score (integer) - payload (string) You...
Implement Plus One
Given an integer represented as an array of digits digits, where the most significant digit comes first, return the array representing the integer plu...
Implement Game Physics and Block Mining
You are given two independent coding tasks from the same interview category. Solve both. Task A: Flappy-Bird-Style Jump Boundary Function Implement a ...
Implement banking, knapsack, and pagination tasks
Problem A — Banking system command processor Implement an in-memory banking system that processes a sequence of commands in timestamp order. Entities ...
Maximize block fee with transaction selection
You are given N transactions. Each transaction has: - id (unique identifier) - size (positive integer) - fee (positive integer) You are building a blo...
Select transactions to maximize fees under size
Problem: Max-fee block assembly You are given N transactions. Each transaction has: - id (unique) - size (positive integer) - fee (non-negative intege...
Parse logs and generate NFT attributes
You are given two independent coding tasks. Task 1: Parse and group a log file by thread ID You are given a list of log lines (strings). Each line con...
Paginate forward and backward through results
You are asked to extend a basic pagination system to support forward and backward navigation, similar to a cursor-based API. You are given: - A zero-i...
Implement local maxima, bagging, and k-means
You have 70 minutes for three programming tasks. Task 1 — Find local maxima Given an integer array a of length n (1 <= n <= 2e5), return all indices i...
Compute Total Manual Distance
A package must be delivered on a one-dimensional line from position 0 to position target. You are given an array stations, where each element is the p...
Implement a Coin-Constrained Jump Strategy
You are implementing an autopilot strategy for a simple side-scrolling jump game. A character moves forward automatically. On each game tick, your str...
Solve restaurant path and order event tasks
You are given two independent coding tasks. Task 1: Shortest paths in a restaurant grid Context: A restaurant is represented as a 2D grid. The waiter ...
Implement a Flappy Bird Jump Agent
Implement a function should_jump(state) -> bool for a simplified Flappy Bird game. The bird has a fixed horizontal position bird_x and a vertical posi...
Implement a versioned recipe management system
You are asked to implement an in-memory Recipe Management System (similar in difficulty to a simple banking/in-memory DB exercise). The system support...
Write SQL to rank top products per category
You are given two tables: products - product_id (int, primary key) - category (string) order_items - order_id (int) - product_id (int) - quantity (int...
Implement Composable Range Iterators
Implement an iterator library: range(start, end, step= 1) supporting forward/backward iteration, inclusive/exclusive endpoints, negative steps, and ov...
Increment Digit Array
Given a non-empty array of digits representing a non-negative integer, add one to the integer and return the resulting array of digits. Assumptions: -...
Implement a Simple Banking Ledger
Design and implement a banking ledger for n accounts labeled 1..n with initial balances. Provide an API: deposit(id, amount) -> bool, withdraw(id, amo...
Implement Plus One
Given a non-empty array of digits representing a non-negative integer, where the most significant digit comes first and each element is in [0, 9], add...