New Grad Software Engineer Interview Questions
New grad software engineer loops are the most algorithm-heavy interviews you'll face: typically two to four coding rounds plus a behavioral, with medium-difficulty data structures and algorithms doing most of the work. These questions were reported by candidates interviewing for new grad and entry-level SWE roles, so they're calibrated to that bar — harder than intern, lighter on system design than mid-level. The skill that carries you through is pattern recognition: spotting a BFS, a sliding window, or a backtracking problem within seconds of reading the prompt. There are 50+ real, recently reported new grad SWE questions here, and most come with a detailed solution that walks through the approach and complexity, not just the final code.
"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 the longest palindromic substring
Problem Given a string s, find the longest contiguous substring of s that is a palindrome (reads the same forward and backward). Input - A string s co...
Implement a random fixed-size load balancer
Problem: Build a simple load balancer Implement a minimal in-memory load balancer that routes each incoming request to one backend node chosen uniform...
Implement a thread-safe money transfer
Problem: Implement a concurrent-safe transfer function You are given an in-memory store of bank accounts: - Each account has an accountId and a balanc...
Design KV store with sliding-window average QPS
Problem Design an in-memory key–value store that supports mutation operations and can report the average QPS (queries per second) over a recent time w...
Answer common behavioral questions for new grad
You are in a 35-minute behavioral round for a new-grad software role. Prepare concise, structured answers (1–3 minutes each) to the following question...
Implement an LRU cache
Design a key-value cache with a fixed capacity. It must support: - get(key): return the value for the key if it exists, otherwise return -1. - put(key...
Determine Whether Queries Can Zero Array
This question evaluates competency in array manipulation, range updates, and feasibility under constraints, focusing on reasoning about sequential int...
Optimize a SQL query plan tree
This question evaluates understanding of relational algebra, query optimization techniques, and tree-based plan transformations such as predicate push...
Compute the Nth Recency Value
Given an integer n >= 1, define a sequence a as follows: - a[0] = 0 - For each i >= 1: - If a[i - 1] has appeared earlier in the sequence, meaning t...
Maintain a Stream Median
This question evaluates the ability to design and implement efficient online data structures and algorithms for maintaining dynamic order statistics a...
Find numbers with exactly two sum-of-squares forms
This question evaluates understanding of integer representations as sums of two squares and the ability to reason about counting distinct unordered re...
Build a CSV Query Engine
This question evaluates proficiency in text parsing, data modeling, and implementing in-memory query semantics, including CSV parsing rules, type infe...
Explain Python and Web Basics
In a software engineering interview, explain the following fundamentals: 1. In Python, what are the differences between a list and a tuple? When would...
Solve Anagram Without Sorting
Given two strings s and t, return true if t is an anagram of s, and false otherwise. You may not sort either string. An anagram uses exactly the same ...
Implement Interview Coding Problems
Solve the following independent coding tasks from a new-grad software engineering interview. 1. Implement a hash map from scratch. - Support integer k...
Minimum Drone Delivery Time on a Ring of Hubs
This question tests a candidate's grasp of circular graph traversal and greedy distance minimization on ring-structured topologies. It evaluates algor...
Detect and Break a Cycle in a Singly Linked List
This question tests practical knowledge of linked list traversal and pointer manipulation, specifically the ability to detect and resolve cycles using...
Remove Repeated Character Groups
You are given a string s and an integer k. Repeatedly remove any contiguous group of k identical characters. After a removal, the remaining parts of t...
Solve Two Coding Interview Problems
You are asked to solve two independent coding problems. Problem 1: Evaluate Nested Math Expressions Implement a function that evaluates a string expre...
Schedule Ready Tasks by Deadline
You are building a workflow scheduler. Each task has: - a unique task_id - an integer deadline - an optional list of prerequisite tasks that must be c...