goodscore

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 Interview Experience: Cleared DSA & LLD, Received Congratulations Mail, Then Ghosted. A Similar Experience Shared by OthersRound 1: DSAQuestion 1: Dynamic Programming (1D) based on bit manipulation — MediumQuestion 2: Dynamic Programming (2

4YOE at a fintechApplied on LinkedinRecruiter call Education, professional background, compensation detailsRound 1: DSA Scheduled with InterviewVector. The interviewer asked me to code on leetcode itself, skipping questions that were already solved b