Coding & Algorithms Interview Questions
Practice 3,429 real Coding & Algorithms interview questions for 2026. Covers companies like Meta, Amazon, Google, Uber, and Microsoft. Real questions from actual interviews with detailed solutions — ideal for focused interview preparation. Coding & Algorithms interview questions are the single most common technical gate for software engineering roles and are used to evaluate problem framing, algorithm selection, complexity trade-offs, correctness, edge-case reasoning, and clear communication under time pressure. Expect this category to appear in early technical screens and repeatedly across onsite loops at companies that weight it heavily (notably Meta, Google, and Amazon). Interviews will test arrays and strings, trees and graphs, dynamic programming, hashing and two‑pointer techniques, and the candidate’s ability to test and optimize code in a shared editor. Prepare with timed mock interviews, practice in the same editor you’ll use live, and build a progressive schedule that moves from fundamentals to medium/hard problems; typical candidates invest several weeks to a few months of focused practice depending on seniority and target company.
"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."
Calculate Ordered Job Makespan Across Parallel Workers
Calculate Ordered Job Makespan Across Parallel Workers A single stage has jobs with different durations and a fixed number of identical workers. Jobs ...
Search a Pattern Across the Leaf Text of a Binary Tree
Search for a pattern across the left-to-right concatenation of binary-tree leaf strings, including matches that cross leaf boundaries. This algorithm ...
Minimum Cars for Rental Requests
Minimum Cars for Rental Requests You receive rental requests, each with a unique request identifier, pickup time, and return time. Every request must ...
Find the Most Frequently Used Meeting Room
Find the Most Frequently Used Meeting Room Problem Implement mostBookedRoom(roomCount, meetings) -> roomId. Rooms are numbered 0 through roomCount - 1...
Compute the Minimum Number of Meeting Rooms
Compute the Minimum Number of Meeting Rooms Problem Implement minimumMeetingRooms(intervals) -> roomCount. Each meeting is a half-open interval [start...
Find the Lowest Common Ancestor in a Binary Tree
Find the Lowest Common Ancestor in a Binary Tree Problem Implement lowestCommonAncestor(left, right, root, first, second) -> nodeId. The binary tree h...
Merge Overlapping Closed Intervals
Implement merge_intervals(intervals) for closed intervals. Return disjoint closed intervals that cover exactly the same points, sorted by start. Inter...
Report Tree Levels and Balanced Subtrees
Implement describe_balanced_nodes(values) for a binary tree represented as a zero-based heap array. For an existing node at index i, its children are ...
Count Completed Jobs in a Serial Multi-Worker Pipeline
Count Completed Jobs in a Serial Multi-Worker Pipeline An automation pipeline contains stages that execute in order. Each stage is represented as [num...
Minimum Delivery Cost Between Cities
Minimum Delivery Cost Between Cities Implement minimum_delivery_costs(delivery_charges, queries). There are n cities indexed from 0 to n - 1, and city...
Count Pairs of Strings with Disjoint Character Sets
Count Pairs of Strings with Disjoint Character Sets Problem Implement countDisjointStringPairs(words) -> count. Count unordered index pairs (i, j) wit...
Maximize Valid Trains from Shared Equipment
You have a pool of locomotives and railcars. Partition any subset of them into valid trains while using each locomotive and railcar at most once. A va...
Validate a Balanced INDENT and DEDENT Token Stream
Validate a Balanced INDENT and DEDENT Token Stream Problem A tokenizer has already converted a document into a sequence of tokens. Two token values ha...
Traverse All Reachable Pages With Parallel BFS
Problem A collection of web pages is modeled as a directed graph. graph[page] lists the pages linked from page in a stable order. Implement reachable_...
Delete One Character Type to Minimize Unique Segments
Problem Implement min_unique_segments_after_deletion(s) for a nonempty lowercase English string. Choose exactly one character value that appears in s ...
Maximal Square and Longest Increasing Subsequence
Problem Implement analyze(matrix, nums) and return [max_square_area, lis_length]. Part A: Maximal Square matrix is a rectangular grid containing only ...
Allocate IPO Shares and Split a Weighted Tree
Two Allocation and Tree Problems Implement both independent parts. Part A - IPO Share Allocation Each bid is [user_id, requested_shares, price, timest...
Kth Employee Reached in an Ordered Hierarchy
Kth Employee Reached in an Ordered Hierarchy Implement kth_recipients(boss, queries). Employees are numbered 0 through n - 1. boss[0] == -1; for every...
Count Perfect Digit-Frequency Substrings
Count Perfect Digit-Frequency Substrings Problem Implement countPerfectSubstrings(s, k). The string s contains only decimal digits. A nonempty substri...
Build a Progressive Banking Ledger
Build a Progressive Banking Ledger The source reports the four feature stages but not exact ledger semantics. The APIs, event priorities, cashback tim...