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."
Minimize maximum height along a grid path
This question evaluates algorithmic pathfinding and graph-modeling skills, specifically reasoning about grid-based route selection where the objective...
Generate all subsets (handle duplicates)
This question evaluates understanding of power-set generation and handling of duplicate elements, measuring competency in combinatorics, enumeration t...
Reconstruct original array from doubled shuffle
This question evaluates array manipulation, multiset/frequency reasoning, pairing logic, and careful handling of edge cases such as zeros and negative...
Find shortest subarray to restore order
Given an integer array, find the shortest contiguous segment which, if sorted in ascending order, makes the entire array non-decreasing. Return the le...
Solve Three OA Coding Tasks
This set of problems evaluates string and array manipulation, spatial placement and packing logic, and parity-based subarray counting within the Codin...
Calculate Per-User Usage Charges
This question evaluates algorithmic data aggregation, numeric billing computations, and the ability to model proration and threshold semantics across ...
Check palindrome and find next larger palindrome
This question evaluates proficiency in string and numeric manipulation, specifically palindrome detection and generation of the next strictly larger n...
Solve three algorithm tasks
Solve the following algorithm tasks and explain your approach, time complexity, and space complexity for each: 1) Fully justify text: Given an array o...
Solve tree traversal and interval merging tasks
Part A — Column-wise Binary Tree Grouping: You are given the root of a binary tree. Group nodes by vertical column index, where the root has column 0,...
Implement Union-Find for connectivity
Implement a Disjoint Set Union (Union-Find) data structure with path compression and union by rank. Support operations: make_set, find(x), union(x, y)...
Validate Password Against Multiple Rules
This question evaluates string processing and input validation skills, specifically character-class checks, frequency constraints, and enforcement of ...
Compute root-to-leaf number sum
This question evaluates understanding of binary tree data structures and the competency to aggregate values along root-to-leaf paths, combining tree t...
Assign tasks to workers with types and accounts
This question evaluates algorithmic scheduling and dynamic resource-allocation skills, including priority-queue/heap usage, time-based simulation, and...
Refactor a chat message processing function
This question evaluates a candidate's ability to refactor and implement clear, maintainable message-processing logic—covering code organization, comma...
Compute dasher pay with peak-hour query
This question evaluates a candidate's ability to perform time-interval arithmetic, prorated pay aggregation, robust handling of missing or inconsisten...
Implement a dictionary without built-in Dictionary
This question evaluates understanding of hash tables and low-level data-structure implementation, including hashing, collision resolution, resizing/re...
Check whether an integer is a power of two
This question evaluates proficiency in bit-level reasoning and integer arithmetic, specifically understanding binary representations and the propertie...
Compute distinct sums from limited coins
You are given two integer arrays, denom[0..n-1] and count[0..n-1], where denom[i] > 0 is a coin denomination and count[i] >= 0 is the number of availa...
Find top-k lottery winners by spending
This question evaluates skills in selection and ordering of numeric-keyed records, covering concepts such as order statistics, deterministic tie-break...
Implement an in-memory order book API
This question evaluates understanding of in-memory data structures and API design for maintaining ordered collections with FIFO semantics, correctness...