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."
Detect intersection of two linked lists
Given two singly linked lists that may converge to share a common tail, determine whether they intersect and return the first node at which they join....
Solve max-subarray, min-unique, and grid-jump
1) Given an integer array nums, find a contiguous subarray with the maximum possible sum. Return (maxSum, startIndex, endIndex). If multiple subarrays...
Compute discounted prices in a queue
Given an integer array prices where prices[i] is the price of the i-th item in a checkout line, apply the following rule: for each i, find the first j...
Reverse sublist between equal-value nodes
Given the head of a singly linked list and a target value v that appears at least twice, reverse the sublist starting at the first node with value v a...
Clone list with random pointers
Question You are given the head of a singly linked list where each node has two pointers: next and random. The random pointer may be null or point to ...
Find shortest path using BFS
Given an m×n grid grid where grid[r][c] = 0 represents an empty cell and 1 represents a wall, a start cell (sr, sc), and a target cell (tr, tc), you m...
Design an O(1) recency-evicting cache
Design and implement a fixed-capacity in-memory cache that supports get(key) and put(key, value) in average O( 1) time. When capacity is exceeded, evi...
Find top co-purchased products
You receive purchase logs where each order is represented as an integer array of product IDs bought together in a single transaction. Implement a func...
Count subarrays equal to target
Given an integer array nums and an integer k, return the number of contiguous subarrays whose sum equals k. Provide an algorithm better than O(n^ 2), ...
Check inorder subsequence and edit tree minimally
Given a binary tree whose nodes store integers and an array target, determine whether target is a subsequence of the tree's inorder traversal (element...
Plan bicycle routes on a city map
You are given a city bicycle network as a weighted graph where edges encode distance, bike-lane availability, elevation gain, and traffic risk. Comput...
Implement an expiring GPU-credit manager
Implement an expiring GPU-credit manager for a cloud provider. Each user receives credit grants with an amount and an expiration timestamp. Support: (...
Find mode or minimum with time-space tradeoffs
For an unsorted array of integers, implement two functions: ( 1) return the minimum value; ( 2) return the value that appears most frequently (the mod...
Compute max profit from single stock trade
Given an array prices where prices[i] is the stock price on day i, compute the maximum profit achievable with at most one transaction (one buy and one...
Detect cycles in lists and graphs
Given a singly linked list, determine whether it contains a cycle. Implement an O( 1)-space algorithm and explain the intuition and correctness. Follo...
Implement file deduplication at scale
Implement a command-line tool to find duplicate files in a directory tree. Use OS/pathlib primitives to recursively enumerate files. Apply prefilters ...
Implement binary search for boundary index
Given a sorted integer array nums (length n) and an integer target t, return the index of the first element in nums that is greater than or equal to t...
Find Path Between Fibonacci Tree Nodes
You are given a special family of binary trees called Fibonacci trees. Define the tree T(k) recursively: - T(1) is a single node. - T(2) is a single n...
Implement text wrapping, waitlist, and intervals
Answer the following coding questions. 1) Text wrapping: count lines in a fixed-width document You are rendering text into a document where each line ...
Design O(1) insert/delete and frequency-weighted random
Problem Design a data structure that supports the following operations in average \(O(1)\) time: 1. add(x) -> bool - Inserts value x into the colle...