Software Engineer Coding & Algorithms Interview Questions
Practice 2,743 real Coding & Algorithms interview questions for Software Engineer roles. From companies including Meta, Amazon, Google, Uber, Microsoft.
"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."
Implement web data fetch and storage tool
Problem You are asked to implement a small program that retrieves data from a remote web service protected by token-based authentication, parses the r...
Implement Billing Coding Exercises
This question evaluates skills in billing and payment reconciliation, datetime normalization and comparison, subscription-based scheduling, API integr...
Find start indices of anagram substrings
You are given two strings: - s: the text string - p: the pattern string Return a list of all starting indices i such that the substring s[i : i + len(...
Implement anagram check and odd-even linked list
You are given two independent coding tasks. Task 1: Check if two strings are anagrams Implement a function that determines whether two given strings a...
Implement Cache and Key-Value Store
The interview report mentions coding tasks similar to the following: 1. Bounded cache Implement a cache with a fixed capacity. Support: - get(ke...
Implement templated string replacement
You are given: 1. A dictionary (map) of placeholder keys to values, for example: `python values = { "db_host": "example.com", "db_port": 5001 } ` ...
Implement KV Store and Token Bucket
This question evaluates a candidate's skills in implementing core data structures and concurrent algorithms, specifically in-memory key-value store de...
Implement matrix multiplication and fast exponentiation
1) - A n × m - B m × p C = A × Bn × p - - - MOD MOD 2) Exponentiation by Squaring x k MOD - x^k - x^k mod MOD - O(log k) - k = 0x = 0 3) ...
Maximize total bandwidth of data channel pairs
You are optimizing how information flows through a network of processing nodes. There are n processing nodes. The bandwidth capability of the i-th nod...
Maximize memory capacity with primary-backup servers
You are helping to optimize the capacity of a cloud system. There are n servers, where n is always even. The memory capacity of the i-th server is giv...
Implement a recent-use eviction cache
This question evaluates a candidate's ability to design and implement a fixed-capacity key-value cache with a recent-use eviction policy, emphasizing ...
Implement a Log Rate Limiter
This question evaluates a candidate's ability to design and implement time-based rate limiting and stateful event tracking using appropriate data stru...
Implement stream line reader and settle balances
Part 1: Streaming line reader from chunked source You are given an existing class ChunkSource with a method nextChunk() that returns the next piece of...
Compute minimum resources for overlapping intervals
You are given n tasks as half-open time intervals [start, end) on a single day. Determine the minimum number of identical servers needed so that no tw...
Find first error and propagate failures
You are given a chronological log history where each entry is a string prefixed with one of [Info], [Warn], or [Error]. Two invariants hold: ( 1) once...
Pass functions and analyze basic data structures
Implement a function applyTwice(f, x) that accepts a function f and a value x and returns f(f(x)) in your preferred language. Demonstrate how to pass ...
Find substring where all chars appear at least k
You are given a string s and an integer k (1 ≤ k ≤ |s|). Return the length of the longest substring in which every distinct character occurs at least ...
Compute exclusive times and call stack from logs
Design an algorithm that, given a single-threaded program's execution log, computes per-function exclusive durations and reconstructs the active call ...
Solve build ordering and expression evaluation
Part A — Dependency ordering: You are given an integer n (0 ≤ n ≤ 200000) representing tasks labeled 0..n-1 and a list of prerequisite pairs [a, b] me...
Design file deduplication algorithm
Design an algorithm to deduplicate files in a storage system. Compare fixed-size versus content-defined chunking and explain how you would choose hash...