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."
Identify members lacking specialty coverage
Identify members lacking specialty coverage Oscar wants to ensure that every insurance member has adequate access to in-network healthcare providers w...
Explain algorithm strategies and complexity
Explain algorithm strategies and complexity You are faced with a complex, potentially ambiguous coding problem. Describe how you would clarify require...
Solve Matrix and Array Distance Problems
This question evaluates competency in graph traversal and shortest-path reasoning for grid-based problems as well as array-based distance computation ...
Remove Target Values from a Linked List
Given the head of a singly linked list and an integer target, remove every node whose value equals target and return the new head of the list. The tar...
Implement Multiple Interview Coding Tasks
This multi-part prompt evaluates algorithmic problem-solving and data structure design skills across string processing and greedy formatting, dynamic ...
Implement Ultimate Tic-Tac-Toe
This question evaluates object-oriented design, state management, rule validation, and algorithmic reasoning for both standard and Ultimate Tic-Tac-To...
Can You Place N Objects?
This question evaluates array traversal, adjacency-constraint reasoning, and greedy placement intuition, emphasizing handling of boundary conditions a...
Implement an LFU Cache
This question evaluates understanding of algorithmic design and data structure management for cache eviction policies, focusing on frequency- and rece...
Design event timeout detector
Design and implement an event-timeout detector for a job scheduler. Inputs: a global timeout T and a stream of events; each event has {event_id, type ...
Compare common data structures and uses
Compare common data structures and uses Compare common data structures and select appropriate ones for specific tasks. For arrays, linked lists, stack...
Process document edit events
Implement a line-based document editor. You are given: - an initial document represented as an array of strings, where each string is one line - a lis...
Find k-th recipient in command propagation order
Chain of Command (k-th Receiver in DFS-by-Child-Id Order) A company org chart forms a rooted tree with n people (nodes), labeled 1..n. You are given a...
Minimize Operations to Balance Shipments
A shop has n item types, where quantity[i] is the positive integer quantity of the i-th item type. The item types must be shipped in two non-empty con...
Find the Best Connected Strength for Every Tree Node
Find the Best Connected Strength for Every Tree Node A tree contains n neurons. Each neuron is either strong or weak. Assign weight +1 to a strong neu...
Maximize a Product After a Shared XOR
Maximize a Product After a Shared XOR Given positive integers a and b and a bit width n, choose an integer x with 0 <= x < 2**n that maximizes: `text ...
Count Subsequences That Move Between Positions
Practice a Visa coding interview problem focused on count subsequences that move between positions. The prompt emphasizes edge cases, clean implementa...
Count Target-Sum Paths in an N-ary Tree
This question evaluates a candidate's competency in tree data structures and traversal algorithms, specifically counting path sums in N-ary trees and ...
Count Connected Components in an Undirected Graph
This question evaluates understanding of graph connectivity and cycle detection, measuring competency in reasoning about connected components and the ...
Simulate turn-based monster team battle
Design an object-oriented model and implement the core battle logic for a turn-based fight between two teams of monsters. The system should simulate t...
Return a valid course completion order
You are given an integer n representing n courses labeled 0..n-1 and a list of prerequisite pairs prerequisites, where each pair [a, b] means you must...