1. [Counting Bits](https://leetcode.com/problems/counting-bits/description/)

    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](https://leetcode.com/problems/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 🥲

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.


Minimum Jumps to Reach Home
Initially solved using DP.
The solution was accepted.
The expected approa

GoodScore SDE2 interview