Twitter | OA | Coding Round | Weird Faculty | Minimum Questions to Outscore

Problem Title: Weird Faculty | Minimum Questions to Outscore Problem Analysis You are given an array v of n binary values representing question results (1 for correct, 0 for wrong). Your Result: The score for the first k questions. Friend's Result: The score for the remaining n−k questions. The Scoring Rule: Correct (1) →+1 point Wrong (0) →−1 point The Goal: Find the minimum k (0≤k<n) such that your score is strictly greater than your friend's score: Your_result>Friend_result