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."
Compute maximum path sum in a binary tree
Question You are given the root of a binary tree where each node contains an integer value (which may be positive, zero, or negative). Return the maxi...
Solve three mini-game algorithm tasks
Solve three mini-game algorithm tasks: (a) Move-House Puzzle: Given initial and target arrangements of N labeled blocks ("houses") on a 2D grid with o...
Compute earliest arrival in time-grid
Question LeetCode 778. Swim in Rising Water – Given an n x n integer grid where grid[i][j] is the earliest time you can enter the cell, starting from ...
Determine reachability and optimize task scheduling
Question LeetCode 780. Reaching Points: Given four integers a, b, c, d (1 <= a, b, c, d <= 1000). Starting from (a, b) you may repeatedly apply either...
Implement an Integer Hash Map
Design a data structure MyHashMap that stores integer keys and integer values without using any built-in hash table library. Implement the following o...
Find top-K frequent elements in a stream
You receive a large stream of items (e.g., integers or strings) that may not fit in memory. Design an algorithm that can return the top K most frequen...
Find top-k lottery winners by spending
You are building a lottery system where each user’s chance of winning is linearly proportional to how much they spent (e.g., user with spend s has wei...
Design a stack with max removal
Design a stack-like data structure for integers that supports the following operations efficiently: - push(x): insert x onto the stack. - pop(): remov...
Count Connected Land Regions
You are given an m x n 2D grid representing a map. Each cell is either land ('1') or water ('0'). A land region is formed by connecting adjacent land ...
Maximize weighted subsequence pairs with wildcards
You are given a string s of length n consisting only of characters '0', '1', and '!'. Each '!' can be replaced by either '0' or '1'. For the final bin...
Simulate robot on grid with obstacles
A robot starts at (0, 0) on an unbounded integer grid. You are given a sequence of commands consisting of characters U, D, L, and R, and a set of bloc...
Implement binary search from scratch
Question Implement binary search on a sorted integer array without using any library helpers (no bisect, Arrays.binarySearch, etc.). Provide both iter...
Implement Time-Aware GPU Credit Ledger
Implement an in-memory GPU credit ledger with three operations: - create_grant(amount, start_time, expire_time): add a credit grant. The grant is acti...
Find users with at least one valid session
You are given: - A list of log entries logs, where each entry is a string in the format: ` "userId action timestamp" ` - userId is a non...
Find first and last index of target
You are given an integer array nums sorted in non-decreasing order and an integer target. Return a pair [left, right] where: - left is the index of th...
Find path between two nodes in a binary tree
Problem Given a binary tree and two target nodes a and b, return the simple path from a to b (inclusive) as an ordered list of node values. - The path...
Detect duplicate files efficiently
You are given access to a very large file system containing file paths and read access to file contents. Design an algorithm to identify groups of fil...
Maintain real-time top-K products from events
Design a data structure/class that ingests a stream of product events and returns the current top‑K products at any time. Events include {timestamp, p...
Design a transactional in-memory key–value store
Implement an in-memory key–value store that supports transactions. The system must process these commands: ( 1) SET key value — assign or overwrite a ...
Solve powers, phases, grid pops, and swaps
Solve the following four problems: 1) Count powers of k in an array: Given an array of positive integers nums and an integer k >= 1, return how many e...