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."
Find Shortest Unique Prefixes
This question evaluates string-processing skills and understanding of data structures for prefix management (e.g., tries), along with algorithmic effi...
Solve Three Array and Matrix Path Problems
This set of three problems evaluates algorithm design, complexity analysis, and data-structure reasoning across matrix path traversal, interval covera...
Implement a Longest-Match Tokenizer
Implement a Longest-Match Tokenizer The source reports longest matching, unknown-token handling, and an optional unknown-merging extension. The exact ...
Build a Versioned In-Memory Database
Build a Versioned In-Memory Database The source reports a four-stage in-memory database exercise but does not provide its exact method signatures. The...
Find maximum value in huge text file
You are given the path to a very large text file on disk. The file has the following properties: - Each line contains exactly one signed 64-bit intege...
Detect a Winner on a 3x3 Tic-Tac-Toe Board
Detect a Winner on a 3x3 Tic-Tac-Toe Board Implement tic_tac_toe_winner(board) for a completed or partially completed 3x3 board. Each cell is "X", "O"...
Build an Expression That Reaches a Target
Build an Expression That Reaches a Target Given a sequence of integers and a target, insert +, -, or * between adjacent numbers and add parentheses so...
Sort Matrix Diagonals By Their Values
Given an n x n matrix of lowercase letters, consider every diagonal that runs from bottom-left to top-right. There are 2n - 1 such diagonals. Assign e...
Debug and extend obstacle-run statistics classes
Problem: Obstacle course run statistics (debug + implement) You are building software to track how long racers take to complete an obstacle course. Do...
Build Event Notification Engine
You are implementing part of a marketing engine for an event marketplace. Assume the following data is available: - Customer: id, city, birth_month, b...
Elements Occurring More Than n/3 Times in a Sorted Array
This question evaluates a candidate's ability to design frequency-counting algorithms over sorted arrays, testing knowledge of majority-element patter...
Implement a Half-Open Interval Range Module
Implement a Half-Open Interval Range Module Implement a module that tracks subsets of the real-number line using half-open intervals [left, right). Pr...
Find invalid transactions in time-sorted input
Problem You are given a list of transaction records, already sorted in non-decreasing order by time. Each transaction is a string in the form: "name,t...
Find the Index Range of a Target in a Sorted Array
This question evaluates a candidate's grasp of binary search and its adaptation to locate boundary positions within a sorted array. It tests the abili...
Reconstruct itinerary with lexicographic ties
You are given m airline tickets as directed pairs [from, to]. Build an itinerary that starts at a specified airport start (e.g., "JFK") and uses every...
Build Prefix Lookup with a Trie
Build prefix lookup for repeated queries. Given words and query prefixes, return matching words for each query in lexicographic order. Implement: `pyt...
Implement a crash-resilient LRU cache
Implement an LRU-based memoization helper with behavior similar to a standard Python LRU cache. You are given an interface like this: `python class LR...
Implement Queue Operations Using Two Stacks
Implement Queue Operations Using Two Stacks Process a sequence of queue operations using exactly two LIFO stacks as the queue's internal data structur...
Palindrome After Deleting at Most One Character
This question evaluates a candidate's ability to reason about two-pointer string traversal and palindrome verification under a single edit constraint....
Least Frequently Used (LFU) Cache
This question tests practical data structure design by requiring an O(1) implementation of a Least Frequently Used cache with tie-breaking by recency....