leetcode 2660 INDEXLAST10-3 PATTERN: winner of bowling game c++ solution

LeetCode problem 2660, "Determine the Winner of a Bowling Game," is a fun twist on logic problems that might appear in tech interviews. It assesses your ability to solve without complex data structures (unlike maps or sets).
The problem presents you with two integer arrays representing bowling scores for two players. You need to write a C++ function to determine the winner based on their total score.
The solution relies on simple logic and iterating through each player's score array. You can keep track of the cumulative score for each player and utilize conditional statements to account for strikes and spares (bonus scoring). Finally, comparing the final scores determines the winner.
Practicing this problem with mock interviews hones your problem-solving skills and demonstrates your ability to tackle challenges without relying solely on complex data structures. This can impress interviewers at FAANG/MAG companies.