Coding & Algorithms Interview Questions
Practice 3,469 real coding and algorithms interview questions reported from interviews at Meta, Amazon, Google, Uber and Microsoft. The mix follows what these loops actually ask: arrays and strings, hash maps, two pointers and sliding windows, binary search, linked lists, trees and graphs, BFS and DFS, recursion and backtracking, dynamic programming, heaps and priority queues, and the occasional design-a-data-structure round. Roughly four in five are rated medium, which is where most technical screens sit; 477 are hard and cluster in onsite loops. 3,033 of them open in a console where you can run your solution against the test cases in Python, Java, C++ or JavaScript. 2,712 come from Software Engineer interviews, with the rest from Machine Learning Engineer, Data Scientist and Data Engineer loops, and 404 were set as take-home projects rather than live sessions.
"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."
Implement rotated array binary search with duplicates
Given an integer array nums that is a non-decreasing array rotated an unknown number of times. Duplicates may exist. Implement a function that returns...
Analyze DFS, BFS, and A* trade-offs
Given a weighted graph with nodes {S,A,B,C,D,G} and edges: S–A(2), S–B(5), A–C(2), B–C(1), C–D(2), D–G(1), B–G(20). Heuristic for A*: h(A)=4, h(B)=3, ...
Reverse a singly linked list robustly
Reverse a Singly Linked List In-Place Context: You are given the head of a standard singly linked list (each node has value and next). Implement and e...
Implement Director awards with Python OOP
Python OOP Exercise: Director extends Cast Context You are working with a simple class hierarchy where Director extends Cast. Implement a robust, test...
Implement WordGuess feedback scoring
WordGuess (Wordle-like) scoring Implement a function that scores a guess against a secret word of the same length. Scoring rules (per character) Retur...
Solve substring and top‑K pair problems
This multi-part question evaluates algorithm design and data-structure proficiency across string processing (minimum window substring), pair-selection...
Find largest filename from ls -l output
You are given a multi-line string (via stdin) that represents the output of ls -l, with one entry per line. Each file line follows the typical ls -l f...
Find Maximum Window Sum
Given an integer array nums and an integer k, write code to find the maximum sum of any contiguous subarray of length exactly k. Assume 1 <= k <= len(...
Find LCA in a tree and extend to a DAG
This question evaluates proficiency in graph algorithms and data structures, focusing on lowest common ancestor computation in rooted trees and its ge...
Compute inverse-depth weighted sum of a nested list
This question evaluates competency in working with nested data structures and depth-based aggregation, measuring the ability to reason about hierarchi...
Implement web data fetch and storage tool
Problem You are asked to implement a small program that retrieves data from a remote web service protected by token-based authentication, parses the r...
Implement Billing Coding Exercises
This question evaluates skills in billing and payment reconciliation, datetime normalization and comparison, subscription-based scheduling, API integr...
Find minimum racks for 2D bin packing
You are given N machines. Machine i requires two types of resources: (x_i, y_i). Each rack has capacity (A, B) for the two resources, and a machine mu...
Find start indices of anagram substrings
You are given two strings: - s: the text string - p: the pattern string Return a list of all starting indices i such that the substring s[i : i + len(...
Implement Cache and Key-Value Store
The interview report mentions coding tasks similar to the following: 1. Bounded cache Implement a cache with a fixed capacity. Support: - get(ke...
Compute sliding-window average excluding top k
This question evaluates a candidate's understanding of sliding-window algorithms, order-statistics maintenance, and data-structure techniques for incr...
Implement templated string replacement
You are given: 1. A dictionary (map) of placeholder keys to values, for example: `python values = { "db_host": "example.com", "db_port": 5001 } ` ...
Design a no-repeat top-frequency music player
Design and implement a music player that receives song lists from new users and returns songs to play in frequency order without repeating a song in t...
Implement matrix multiplication and fast exponentiation
1) - A n × m - B m × p C = A × Bn × p - - - MOD MOD 2) Exponentiation by Squaring x k MOD - x^k - x^k mod MOD - O(log k) - k = 0x = 0 3) ...
Maximize total bandwidth of data channel pairs
You are optimizing how information flows through a network of processing nodes. There are n processing nodes. The bandwidth capability of the i-th nod...