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."
Merge Exact-Word Highlights and Rank Their Citations
Highlight Exact Source Phrases and Attach Citations You are given a text string and an indexed list of source phrases. All input tokens are alphanumer...
Count Rectangle Coverage on a Grid
Count Rectangle Coverage on a Grid You are given an n x n grid initially filled with zeroes and a list of inclusive rectangular updates. Each rectangl...
Deduplicate and Order Batch and Streaming Logs
Deduplicate and Order Batch and Streaming Logs A log is (timestamp, message), where timestamp is an integer and message is compared exactly. Input ord...
Find Paths Across a Weighted Binary Grid
Find Paths Across a Weighted Binary Grid Given an m by n binary grid, a cell with value 1 is traversable and 0 is blocked. Movement is allowed up, dow...
Match Limit Orders with Price-Time Priority
Implement an in-memory limit-order matcher that processes orders in arrival order and returns both the executed trades and the final resting order boo...
Count Legal Tic-Tac-Toe Games from the Empty Board
Count Legal Tic-Tac-Toe Games from the Empty Board Start with an empty 3-by-3 Tic-Tac-Toe board. X always moves first, and the players alternate placi...
Implement a Removable Nested-List Iterator
Implement a Removable Nested-List Iterator Implement an iterator over a mutable array of integer arrays. Traversal goes left to right within each inne...
Reorder a String by Alternating Its Left and Right Ends
Reorder a String by Alternating Its Left and Right Ends Given a string text, construct a new string by taking characters in this order: 1. first chara...
Find the Minimum Absolute Difference
Find the Minimum Absolute Difference Implement minimum_absolute_difference(values). Given at least two integers, return the smallest absolute differen...
Convert Leveled Rich-Text Tokens into Nested Lists
Convert Leveled Rich-Text Tokens into Nested Lists Problem Implement read_rich_text(tokens). Each token is a pair (level, text) in document order, whe...
Intervals with Exactly X Concurrent Meetings
Intervals with Exactly X Concurrent Meetings Given half-open meeting intervals and an integer X, return every maximal half-open time interval during w...
Determine All Players with Fixed Rankings
Determine All Players with Fixed Rankings There are N players and directed match results. A pair [a, b] means player a defeated player b. Results are ...
Last Truck to Leave a One-Dimensional Lane
Last Truck to Leave a One-Dimensional Lane Implement last_exit_time(lane_length, positions, velocities). Distinct trucks start at integer positions st...
Count Connected Clusters of Two-Dimensional Points
Count Connected Clusters of Two-Dimensional Points Problem Implement count_clusters(points, radius). points is a list of two-dimensional integer coord...
Merge Overlapping Intervals with a Sweep
Merge Overlapping Intervals with a Sweep Implement merge_intervals(intervals) for closed integer intervals [start, end] with start <= end. Return thei...
Implement Generalized Tic-Tac-Toe
Implement Generalized Tic-Tac-Toe Implement a TicTacToe class for two players on an m by n board with a configurable winning length k. `text TicTacToe...
Return the Lexicographically Smallest Topological Order
Return the Lexicographically Smallest Topological Order Problem Implement topologicalOrder(nodeCount, edges) -> order. The directed graph contains nod...
Minimize Direction Violations in a Directed Road Network
Minimize Direction Violations in a Directed Road Network There are n nodes numbered from 0 through n - 1. Every input edge [u, v] has an original dire...
Find the K Closest Pairs in a Sorted Array
Implement k_closest_pairs(nums, k) for a strictly increasing sorted array. Consider every pair of indices (i, j) with i < j. Its distance is nums[j] -...
Maintain an Escape-Room Leaderboard
Design and implement an EscapeRoomGame for a fixed set of players and rooms 0 through R. - advance(player_id) moves that player forward by one room in...