Skip to contentSkip to footer

Software Developer New Grad Interview Questions

Salaries
Interviews

6,139 software developer new grad interview questions shared by candidates

Q1: Freebie. Totally forgot Q2: Flatten digits and return the largest most frequent digit e.g. [123, 24, 12, 30, 89 ] => [6, 6, 3, 3, 8] => return 6 Q3: A variant of Task Scheduler, Greedy + Heap Q4: Given three arrays [a, b, operations], where the a and b arrays are int arrays, and the operations array represents a list of operations to be performed on the a and or the b array. Return the result of all operations in a list. There are two possible operations: [0, idx, val]: assign val to b[idx]; b[idx] = val, return nothing [1, target]: return the number of all possible combinations of [i, j] so that a[i] + b[j] == target Example: [[1, 2, 3], [2, 2], [[1, 5], [0, 0, 1], [1, 5]] => [4, 2] Walkthrough: First operation returned 4 The second operation modifies array b and returns nothing The third operation returned 2
avatar

SWE New Grad

Interviewed at Uber

3.7★
Jul 25, 2025

Q1: Freebie. Totally forgot Q2: Flatten digits and return the largest most frequent digit e.g. [123, 24, 12, 30, 89 ] => [6, 6, 3, 3, 8] => return 6 Q3: A variant of Task Scheduler, Greedy + Heap Q4: Given three arrays [a, b, operations], where the a and b arrays are int arrays, and the operations array represents a list of operations to be performed on the a and or the b array. Return the result of all operations in a list. There are two possible operations: [0, idx, val]: assign val to b[idx]; b[idx] = val, return nothing [1, target]: return the number of all possible combinations of [i, j] so that a[i] + b[j] == target Example: [[1, 2, 3], [2, 2], [[1, 5], [0, 0, 1], [1, 5]] => [4, 2] Walkthrough: First operation returned 4 The second operation modifies array b and returns nothing The third operation returned 2

You are given a 2-D grid of integers matrix, where each integer is greater than or equal to 0. Return the length of the longest strictly increasing path within matrix. From each cell within the path, you can move either horizontally or vertically. You may not move diagonally.
avatar

SWE New Grad

Interviewed at Google

4.4★
Dec 12, 2025

You are given a 2-D grid of integers matrix, where each integer is greater than or equal to 0. Return the length of the longest strictly increasing path within matrix. From each cell within the path, you can move either horizontally or vertically. You may not move diagonally.

Viewing 3441 - 3450 interview questions

Glassdoor has 6,139 interview questions and reports from Software developer new grad interviews. Prepare for your interview. Get hired. Love your job.