goodscore logo
Goodscore· SDE II

GoodScore SDE2 interview

Posted
24 Sept 2026
90 reads

Summary

I interviewed for an SDE2 position at GoodScore, discussed two coding problems, and was ultimately rejected.

How it went

  1. Counting Bits

    Solved first using brute force: O(n log n) Then optimized to O(n) using a single-pass DP approach. Both approaches were discussed.

  2. Minimum Jumps to Reach Home

    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)

  1. 01

    Counting Bits

    Data Structures & Algorithms · Easy

    Given a non‑negative integer n, return an array ans of length n + 1 where ans[i] is the number of 1 bits in the binary representation of i.

    For example, for n = 2, the answer is [0,1,1] because:

    • 0 in binary is 0 → 0 set bits
    • 1 in binary is 1 → 1 set bit
    • 2 in binary is 10 → 1 set bit
    Open the problem
  2. 02

    Minimum Jumps to Reach Home

    Data Structures & Algorithms · Medium

    You are at position 0 on 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.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Goodscore recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!