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."
Implement Euclidean distance and k-nearest neighbors
You are working with points in an n-dimensional Euclidean space, where each point is represented as a list (or array) of numeric coordinates. Assume: ...
Return right and left side views of a tree
Given the root of a binary tree, compute two “side views”: 1. right_view: the list of node values visible when looking at the tree from the right side...
Merge multiple sorted arrays using min-heap
Problem You are given k sorted arrays of integers: - arrays[0], arrays[1], ..., arrays[k-1] - Each arrays[i] is sorted in non-decreasing order. - The ...
Implement three whiteboard coding tasks
The interview report described several coding questions in the same category: 1. Binary search: Given a sorted array of integers and a target value, r...
Maximize area between vertical lines
Problem You are given an integer array h where h[i] represents the height of a vertical line drawn at x-coordinate i. Choose two different indices i <...
Compute nearest courier for each customer
Question You are given two sets of 2D points: customers C = {c1..cn} and active couriers (dashers) D = {d1..dm}. Each customer i has coordinates (xi, ...
Implement 3x3 matrix transforms and rotation
For a 3x3 matrix, write Python code to: (a) transpose it in-place; (b) swap any two rows and any two columns; (c) reverse a specified column and rever...
Compute sliding-window average excluding top k
Problem You are given an integer array nums, a window size windowSize = w, and an integer k. For every contiguous subarray (window) of length w as the...
Compute Sliding Window Averages
Given a list of numbers nums and a positive integer window_size, compute the average of every contiguous subarray of length window_size. Return a list...
Apply sliding window techniques
Explain the sliding window technique and apply it to solve: ( 1) Given an array of positive integers and a target S, return the minimal length of a co...
Implement two array-cost minimization algorithms
Implement two array-cost minimization algorithms that appeared back-to-back in an AWS SDE online assessment. Each can be solved independently. Part 1 ...
Parse and expand an IPv6 address
Implement an IPv6 address parser/normalizer. You are given a string s that may represent an IPv6 address using standard notation: - Up to 8 groups (“h...
Shuffle array using random integer API
You are given an array nums of length n representing a deck of distinct cards. You do not have access to a built-in shuffle function, but you are give...
Find user pairs with overlapping last K movies
You are given the same user movie-watching histories as in the previous problem. Each user’s history is an ordered list of movie IDs from earliest to ...
Compute root-to-leaf number sum
Given the root of a binary tree where each node stores a digit from 0 to 9, every root-to-leaf path represents a decimal number formed by concatenatin...
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...
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...
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 ...
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...