Software Engineer Coding & Algorithms Interview Questions
Practice 2,712 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."
Drone Circular Route — Minimum Total Travel Cost
This question tests a candidate's ability to apply dynamic programming to combinatorial optimization, specifically the Traveling Salesman Problem (TSP...
Solve interval, grid-fill, and heap tasks
You are asked to solve the following algorithmic problems. Problem 1: Concurrent users from online intervals You are given n inclusive time intervals ...
Build Quadtree and Find Grid Words
This question evaluates divide-and-conquer tree construction and recursive spatial data structures for the quadtree task, and grid-based search and ba...
Build a React team builder with role constraints
This question evaluates frontend React skills including component state management, enforcing role-based constraints and invariants, handling user int...
Implement short algorithms on logs, grids, and strings
This multi-part Coding & Algorithms question evaluates algorithmic problem-solving skills and mastery of core competencies including temporal window r...
Design an elevator control system
Design the software for a multi-elevator control system in a high-rise building. Specify classes, scheduling algorithms for car assignments, handling ...
Compute Earliest Completion Times
You are given n tasks numbered from 0 to n - 1. Each task i has a positive duration duration[i]. You are also given a list of prerequisite relationshi...
Add Consecutive-Value Bonuses to Grid Paths
Extend the maximum-score grid path with bonuses for equal adjacent values and strictly increasing triples of visited cells. Dynamic programming must r...
Minimum Moves on a Grid with k-Cell Jumps
You are given an m x n grid. Each cell is either open or blocked: - grid[i][j] = 0 means the cell is open. - grid[i][j] = 1 means the cell is blocked....
Dot Product of Two Vectors (Dense, then Sparse)
This question assesses proficiency in array manipulation and algorithmic efficiency by asking for a vector dot product, first over dense arrays and th...
Return Top Department Suggestions
This question evaluates proficiency in prefix-based search and top-k ranking, familiarity with in-memory data structures and preprocessing strategies,...
Implement BFS-based maze solver
Maze Printing and BFS Solver You are given a 2D grid representing a maze. Each cell of the grid is one of: - '#' – wall (cannot be passed) - '.' – emp...
Implement four string-processing functions
This question evaluates string-processing and list-manipulation skills, including character membership testing and sequence filtering, reflecting comp...
Count Complete Tic-Tac-Toe Game Sequences
Count Complete Tic-Tac-Toe Game Sequences Two players play on a standard 3 x 3 board. X moves first and the players alternate. A game ends immediately...
Find a Maximum-Sum Window in a Sparse Array
Find a Maximum-Sum Window in a Sparse Array An integer array is represented by constant-value segments instead of individual elements. Each segment [s...
Product of Array Except Self Without Division
Product of Array Except Self Without Division Given an integer array, return an array in which output[i] is the product of every input element except ...
Detect robot state after movements
Detect robot state after movements Implement an algorithm to determine whether a robot following a given set of movement instructions ends in a valid ...
Implement Courier Delivery Cost Tracking
This question evaluates skills in time-interval arithmetic, in-memory state management, and billing computation for delivery records, including handli...
Two Sum — Indices Summing to a Target
This question evaluates a candidate's ability to design an efficient array-searching algorithm that maps values to indices under a target-sum constrai...
Return the Vertical Traversal of a Binary Tree
Return the Vertical Traversal of a Binary Tree Problem Implement verticalTraversal(nodeValues, left, right, root) -> columns. Node root is at row 0, c...