Coding & Algorithms Interview Questions
Practice 3,469 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."
Maximize profitable pairs
Maximize profitable pairs You are given an array profits of n integers representing net profit per item and an integer threshold T. You may form disjo...
Find longest substring with at least k repeats
Find longest substring with at least k repeats Longest substring where each character appears at least k times You are given: - a string s consisting ...
Implement LRU cache with O(1) ops
Implement LRU cache with O(1) ops Design and implement a fixed-capacity cache supporting get(key) -> value and put(key, value) in O( 1) average time. ...
Validate 9x9 grid in one pass
Validate 9x9 grid in one pass Given a partially filled 9x9 board using digits '1'–'9' and '.' for empty cells, determine whether the current configura...
Design algorithms for test scheduling
Design algorithms for test scheduling You have tens of thousands of graphics test cases with inter-test dependencies and hardware/driver constraints. ...
Determine if a multiple-sum subarray exists
Determine if a multiple-sum subarray exists Given an integer array nums and an integer k, determine whether there exists a contiguous subarray of leng...
Find minimum processing rate
Find minimum processing rate You are given an array piles where piles[i] is the number of items in the i-th pile and an integer H (total hours). Find ...
Solve capital selection and grid escape
Solve capital selection and grid escape Implement two functions for algorithmic practice: 1) MaximizeCapitalAfterProjects(k, initialCapital, requiredC...
Count vowel-only substrings with all vowels
Count vowel-only substrings with all vowels Given a lowercase English string s, return the number of contiguous substrings that ( 1) consist only of v...
Solve graph path, interval deletion, and robbery
Solve graph path, interval deletion, and robbery Part A — Optimal path with transport modes: You are given a directed weighted graph of a city. Each e...
Solve swaps, graph paths, and movie DP
Solve swaps, graph paths, and movie DP Design and implement solutions for three tasks derived from a HackerRank-style assessment. 1) Minimum swaps to ...
Determine string segmentability with dictionary
Determine string segmentability with dictionary Given a string s and a dictionary of words, determine whether s can be segmented into a sequence of di...
Generate the next lexicographic array arrangement
Generate the next lexicographic array arrangement Given an integer array nums (which may include negative numbers and duplicates), modify nums in plac...
Compute nearest courier for each customer
Compute nearest courier for each customer You are given two sets of 2D points: customers C = {c1..cn} and active couriers (dashers) D = {d1..dm}. Each...
Recommend movies by shared ratings
Recommend movies by shared ratings Write a function recommendations(user, ratings) that returns a list of movies to recommend to the given user based ...
Count users over n connections
Count users over n connections Given a stream of relationship events in the form [[user_a, user_b, op], ...], where op ∈ {"connect", "disconnect"}, tr...
Design LCA with flexible inputs and rule
Design LCA with flexible inputs and rule Design a function to find the lowest common manager of two employees in an organizational tree. Support two i...
Describe std::string copy semantics
Describe std::string copy semantics In C++, what happens with std::string when you write: std::string a = "123"; std::string b = a; Describe which ope...
Sort a string by custom order
Sort a string by custom order Given a priority string P of distinct characters and a text string S, reorder S so that all characters appearing in P co...
Find power-of-two subarrays within sum range
Find power-of-two subarrays within sum range Given an integer array nums and an integer k, find all subarrays whose length is a power of two and whose...