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 Top K Frequent Elements
Question LeetCode 347. Top K Frequent Elements – given an integer array nums, return the k most frequent elements. Initial requirement: return the top...
Solve diverse LeetCode algorithm problems
Question LeetCode 695. Max Area of Island LeetCode 380. Insert Delete GetRandom O( 1) LeetCode 19. Remove Nth Node From End of List LeetCode 1004. Max...
Review Python geodata code
Question You are given a Python codebase that performs geolocation data processing. Conduct a thorough code review: identify readability, correctness,...
Reverse a linked list
Question LeetCode 206. Reverse Linked List — Given the head of a singly linked list, reverse the list and return the reversed list. https://leetcode.c...
Count deletions making array fair
Question LeetCode 1664. Ways to Make a Fair Array – Given an integer array nums, count the indices whose removal results in the sum of elements at eve...
Solve LeetCode string and list problems
Question LeetCode 767. Reorganize String LeetCode 23. Merge k Sorted Lists LeetCode 138. Copy List with Random Pointer https://leetcode.com/problems/r...
Reconstruct tree from inorder and postorder
Given two arrays representing the inorder and postorder traversals of a binary tree with unique values, reconstruct the original binary tree and retur...
Detect runs and answer suffix queries
Given an array of comparable elements a[0..m-1] and an integer N: 1) Write a function that returns the maximum length of any run of consecutive equal ...
Find index of first unique character
Find index of first unique character Given a string s, return the index of the first character that appears exactly once; if none exists, return -1. A...
Design a temporal key-value store with historical reads
Implement a key–value store supporting set(key, value, timestamp) and get(key, timestamp) -> the value at the greatest timestamp ≤ the given timestamp...
Generate constrained NFT metadata
Generate constrained NFT metadata Given a set of trait types (e.g., background, eyes, hat), each with a list of allowed values, and a target count N, ...
Compute minimum-cost service cover
You are given: ( 1) a list of rental service packages, where each package contains a set of services (strings) and a non-negative price, e.g., [(["wif...
Design order stream with state transitions
Design order stream with state transitions Implement an in-memory order stream service with operations: add(order), delete(order_id), pause(order_id),...
Track article votes and last three flips
Problem Design an in-memory data structure for voting on articles. Users can vote on an article with either: - Thumbs up - Thumbs down - No vote (user...
Build a time-based key-value store
Problem Design a data structure that stores multiple values for the same key at different timestamps, and can retrieve the most recent value as of a g...
Find longest run of identical consecutive shows
Given an array shows of integers, find the maximum length of a contiguous run where all values are equal. Function signature - Input: shows: List[int]...
Implement a parallelized sort
Problem: Parallelized Sort (Shared-Memory) Implement a function that sorts an array using parallelism. Task Write a function (language of your choice)...
Find path between nodes in Fibonacci tree
You are given a recursively defined Fibonacci tree F(k): - F(0) is a single node. - F(1) is a single node. - For k >= 2, F(k) consists of: - a root ...
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...
Design command executor with undo
Problem Design and implement a command-execution framework that supports executing commands and undoing the most recently executed command. Requiremen...