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."
Find k pairs with smallest sums
You are given two sorted integer arrays arr1 and arr2 (each sorted in non-decreasing order), and an integer k. Consider all possible pairs formed by t...
Implement a Leaky Bucket Limiter
Design and implement an in-memory leaky-bucket rate limiter. A limiter is configured with: - capacity: the maximum amount of queued load the bucket ca...
Maximize profit with bounded sell window
Given an array prices[0..n-1] of daily stock prices and an integer D ≥ 1, you may perform at most one transaction (buy then sell). The sell day j must...
Solve tree view and parentheses cleanup
Solve the following two algorithm problems. 1. Right-side view of a binary tree Given the root of a binary tree, return the values of the nodes that w...
Implement price-based order matcher
Design and implement a price-based order matcher for unit-sized orders. You are given an array orders where each element is [type, price]: type = 1 de...
Find Words in a Character Grid
Implement findWords(board, words) for a word-search game. You are given an m x n grid of lowercase English letters and a list of lowercase dictionary ...
Find Minimum Time Across a Grid
You are given an n x n grid of non-negative integers. Each value represents the earliest time at which that cell becomes traversable. You start at the...
Determine Reporting Relationships
Build an in-memory organization model that supports three operations on employee IDs: 1. add_manager(a, b): employee a is the direct manager of employ...
Solve BFS and grid tasks
The coding rounds included several algorithmic problems: 1. Threshold search with binary search: You are given floors 1..n and an API canOperate(floor...
Return sorted squares of a sorted array
Problem You are given an integer array nums sorted in non-decreasing order. The array may contain negative numbers. Return a new array containing the ...
Compute max profit with forced trades
Given an array prices where prices[i] is the stock price on day i, solve two related tasks under a forced-trade constraint: (a) Exactly one transactio...
Solve common string and subarray problems
You are given three coding tasks: 1) Reverse a string - Input: a string s. - Output: the string with characters in reverse order. 2) Maximum sum of a ...
Schedule batched register operations optimally
Problem You are given a text file that describes batches of register operations (reads and writes) on integer-indexed registers. Your task is to sched...
Solve jump maximization and palindromic path queries
You are given two independent algorithmic problems. --- Problem 1 — Jump game with special destinations (maximize score) You are given an integer arra...
Build User Journey Path Summary
Implement a function build_summary(logs) -> str that summarizes user journeys as a trie-like path tree. You are given a list of action logs. Each log ...
Solve four classic algorithm problems
You are given four independent coding tasks. For each task, implement the required function. --- Problem 1: Zigzag level-order traversal of a binary t...
Compute shortest paths with blocked nodes
Given a graph with nodes and edges and a designated source node s, compute the shortest distance from s to every other node. Some nodes are inaccessib...
Compute nearest dashmart distances for queries
You are given an m x n grid where each cell is one of: -1 for a wall (impassable), 0 for a dashmart (a store), and INF = 2^31 - 1 for an empty room. M...
Implement Composable Range Iterators
Implement an iterator library: range(start, end, step= 1) supporting forward/backward iteration, inclusive/exclusive endpoints, negative steps, and ov...
Implement Binary Search in C++
From scratch in C++, implement binary search over a sorted array to locate a target value. Provide a correct iterative implementation, handle not-foun...