Software Engineer Coding & Algorithms Interview Questions
Practice 2,306 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."
Settle Group Expenses with Transfers
You are given a list of group expense transactions from a trip. Each transaction contains: - payer: the person who paid the full amount. - amount: the...
Implement Python LRU cache with args and persistence
Implement an LRU cache in Python as a decorator or class that correctly supports variable-length positional arguments and keyword arguments. Ensure th...
Design a versioned key-value store
Design a versioned key-value store Design and implement a versioned key-value store that supports set(key, value, timestamp) and get(key, timestamp) t...
Compute shortest recursive string encoding
Given a string s, compress it by replacing any consecutive repetition of a substring with the form k{pattern} where k > 1 and pattern may itself be re...
Find exit URL via BFS API calls
Question Design and implement a function that, given a starting URL "/", performs BFS or DFS by repeatedly sending HTTP GET requests of the form GET "...
Minimize cost & recommend movies
Question Given arrays size[] and cost[] where size[i] is the size of the i-th product and cost[i] is the cost to increase size[i] by one unit, compute...
Match logs to prior queries
Question You receive a stream of strings, each beginning with either "Q:" (query) or "L:" (log). A query consists of space-separated words and should ...
Implement weighted-eviction cache
Question Design and implement a weighted cache supporting get(key) and put(key, value, weight) operations. The cache has a total weight limit; when in...
Remove elements to avoid k-prefix duplicates
Question Given two lists listA and listB and an integer k, delete elements from listB so that the first k elements of the new listB share no value wit...
Implement bank account with cashback
Implement a bank account processor. Given an initial non-negative integer balance B and a list of operations (n up to 1e 5), apply each operation in o...
Design weighted random index picker
Design and implement a data structure that, given an array of positive integer weights w[0..n−1], supports pick() that returns index i with probabilit...
Convert Integer to Non-Adjacent Form
Convert Integer to Non-Adjacent Form Implement toNAF(n) that converts an integer n (allow negative n) to its Non-Adjacent Form using digits from {-1, ...
Design a no-repeat top-frequency music player
Design and implement a music player that receives song lists from new users and returns songs to play in frequency order without repeating a song in t...
Compute longest increasing path in a matrix
Compute longest increasing path in a matrix Given an m × n integer matrix, return the length of the longest path of strictly increasing values, where ...
Compute Available Offers per User
You are given a set of promotional offers and a CSV event stream read from standard input. Each Offer has the following fields: - name: string - start...
Produce asymmetric side views of a binary tree
Produce asymmetric side views of a binary tree Given a binary tree, output two sequences: ( 1) Left-bottom-up view: for each depth, the first node vis...
Solve median extremes and segment flips
Solve median extremes and segment flips Part A — Sliding-window median extremes: - Input: an integer k (1 ≤ k ≤ n) and an array nums of length n. - Fo...
Implement an in-memory order book API
Problem Implement an in-memory limit order book for a single trading symbol. You do not need to implement order matching/execution—only store and main...
Solve array, tree, and maze problems
The onsite interview included the following algorithmic tasks: 1. Building visibility from the right: Given an integer array heights, where heights[i]...
Find all pairs summing to target in sorted array
Given a non-decreasing array of integers nums and an integer target, return all unique pairs of indices (i, j) with i < j such that nums[i] + nums[j] ...