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."
Solve three OA coding questions
You are given a 90-minute online assessment containing three coding questions. Implement solutions for all questions. --- Question 1: Group strings th...
Find balanced subarray and increasing tree path
You are given two coding problems. Problem 1: Longest balanced subarray (0/1) Given an integer array nums of length n where each element is either 0 o...
Determine validity after digit-constrained deletions
You're given a string S of length n consisting only of '(' , ')' , and digits '0'–'9'. For every digit at index i with numeric value v: ( 1) you must ...
Check if all substrings are anagrams of words
You are given a string s (letters only) and access to an English dictionary dict (a set of valid words). Return true if every contiguous substring of ...
Compress editor keystrokes into insert/delete/skip
You are implementing a simplified collaborative editor sync format. You are given: - An initial document string doc. - A list of user input operations...
Implement a Composable Event Recommendation Engine
Design and implement a flexible event recommendation engine in Java. You are given domain objects such as Event, Customer, Inventory, and a LocationSe...
Compute longest increasing path in matrix
You are given an m x n grid (matrix) of integers grid, where m >= 1 and n >= 1. A path in the matrix is a sequence of cells where: - You may move from...
Design paint editor with undo/redo
Implement a simplified Paint editor that supports drawing on a 2D canvas and reverting changes using undo and redo operations. Canvas You are given a ...
Simulate a Turn-Based Two-Player Game
Design and implement a simulator for a two-player turn-based board game similar to tic-tac-toe. Requirements: - The game is played on an n x n board. ...
Solve Two Coding Interview Problems
You are asked to solve two independent coding problems. Problem 1: Evaluate Nested Math Expressions Implement a function that evaluates a string expre...
Distinguish Permit Requirement Outcomes
Your platform helps determine whether construction projects require permits in different municipalities. The current system can record conditions unde...
Solve Dependency, Prefix, and Cache Problems
Solve the following three coding problems. Problem 1: Determine Whether All Tasks Can Be Completed You are given numTasks, the number of tasks labeled...
Remove duplicates in linked list
Question Given a linked list, remove all duplicate values so that each value appears only once. Provide solutions for both sorted and unsorted linked ...
Optimize file reading and expression DFS
Question Given a large password file, build a program to read the required password(s) while minimizing memory usage. How would you optimize the space...
Design rotating warehouse simulator with closures
Given an integer array cap[0..n-1] for warehouses 0..n-1 and a sequence of events, simulate package processing. Events: ( 1) "PACKAGE": process one pa...
Find root from child adjacency lists
You're given an unordered list describing a rooted n-ary tree. Each item is a record of the form {id: int, children: set<int>} listing a node's direct...
Heapify an array into a max-heap
Given the array [6, 15, 2, 4, 3, 8, 19], apply heapify to build a max-heap using the standard in-place bottom-up method with a 0-indexed array represe...
Optimize 0/1 to bounded knapsack DP
Solve the 0/1 knapsack problem: given arrays weight[i], value[i] for i=0..n-1 and capacity W, return the maximum value and reconstruct one optimal set...
Detect cycle in a directed graph
Given a directed graph represented by an adjacency list with n vertices and m edges, determine whether the graph contains a cycle. Describe and implem...
Implement top-K over a stream
Given a high-volume stream of events (e.g., account IDs from new account openings), design and implement a data structure that supports: ( 1) insertin...