GoodScore SDE2 interview
- Posted
- 24 Sept 2026
Summary
I interviewed for an SDE2 position at GoodScore, discussed two coding problems, and was ultimately rejected.
How it went
-
Solved first using brute force: O(n log n) Then optimized to O(n) using a single-pass DP approach. Both approaches were discussed.
-
Initially solved using DP. The solution was accepted. The expected approach from the interviewer was BFS using a queue, since the problem can be modeled as a shortest‑path problem where each position is a state. Did not switch to the expected BFS approach during the interview.
Verdict: Rejected
Questions asked (2)
- 01
Counting Bits
Data Structures & Algorithms · Easy
Open the problemGiven a non‑negative integer n, return an array ans of length n + 1 where ans[i] is the number of
1bits in the binary representation of i.For example, for n = 2, the answer is
[0,1,1]because:0in binary is0→ 0 set bits1in binary is1→ 1 set bit2in binary is10→ 1 set bit
- 02
Minimum Jumps to Reach Home
Data Structures & Algorithms · Medium
Open the problemYou are at position
0on an infinite number line. Your home is at position home. You can make the following moves:- Jump forward by a units.
- Jump backward by b units.
- Jump to any forbidden position listed in the array forbidden (these positions are blocked).
Find the minimum number of jumps required to reach home without landing on a forbidden position. If it is impossible, return
-1.Constraints typically include
0 <= forbidden.length <= 1000,1 <= a, b, home <= 2000.