Software Engineer Coding & Algorithms Interview Questions
Practice 2,306 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 mode in a trinary search tree
You are given the root of a trinary search tree where each node has up to three children: `text class Node { int val; Node left; // all values ...
Solve interval merge and string dedup problems
You are given three coding questions from a phone screen. Solve each independently. 1) Merge overlapping intervals Input: A list of intervals interval...
Solve Linked-List and Iterator Problems
You are asked to solve two coding problems. Problem 1: Detect shared nodes between possibly cyclic linked lists You are given the heads of two singly ...
Find Top Errors in Time Window
Implement a function that analyzes request-response logs stored as JSON records. Each record contains a timestamp, a response status, and optionally a...
Solve sliding-window and disjoint-string-pairs tasks
Task A (Sliding Window) Given a string s, find the length of the longest contiguous substring that contains no repeated characters. - Input: a string ...
Solve Four Online Assessment Problems
Complete the following four independent coding tasks. For each task, write a function that returns the requested result. 1. Find the best value index ...
Merge K timestamped lists with timestamp coalescing
You are given k sorted lists (or linked lists) of records. Each record has: - timestamp (integer) - values (an array of integers sorted in non-decreas...
Remove adjacent duplicates and handle tree input
You are asked three related coding questions. 1) Remove adjacent duplicates (repeatedly) Given a string s (lowercase English letters), repeatedly remo...
Implement flood fill using BFS and DFS
Problem You are given a 2D grid image of size m × n, where each cell contains an integer color value. You are also given a starting cell (sr, sc) and ...
Design log queries and a buffered writer
Part A — Log store with time-range queries: Implement a data structure that ingests log entries with ISO-8601 timestamps (e.g., YYYY-MM-DD HH:MM:SS) a...
Compute max profit across dated stock quotes
You are given an unsorted list of price records for multiple stocks, each record as (date, symbol, price). Dates may be repeated across different symb...
Solve two coding assessment tasks
The online assessment contained two coding problems: 1. Maximize store revenue You are given an integer array quantity of length n, where quantity[i...
Implement bus route simulation features
Bus Route Simulation – Boarding, Capacity, and Priority Passes You are given a partially implemented codebase for simulating bus routes in a city. Bus...
Merge two sorted arrays in-place
You are given two integer arrays sorted in non-decreasing order, and two integers m and n: - nums1 has length m + n. The first m elements of nums1 con...
Maximize revenue by choosing one query type
You are given a virtual warehouse that can execute queries. There are n query types, and you must choose exactly one query type to run repeatedly for ...
Answer suffix maximum-frequency queries
You are given: - An integer array nums of length n. - An integer array queries of length m, where each queries[k] is an index i (0-based) into nums. F...
Decompress encoded string with nested repeats
Given an encoded string, decompress it into its expanded form. Encoding rules: - Parentheses (...) denote a group. - A repetition count is written in ...
Implement command-driven in-memory key-value database
Implement a command-driven in-memory key–value database. Supported commands (one per line): 1) SET key value 2) GET key → print value or NULL 3) DELET...
Simulate document assignment to indexers
You are given a system with m parallel indexers (workers), numbered from 0 to m-1. Documents arrive over time and are placed in a processing queue. Ea...
Compute Exclusive Execution Times
You are given n functions labeled from 0 to n - 1 and a chronological list of execution logs from a single-threaded CPU. Each log has the format: `tex...