Question d’entretien chez Infosys

Arrays and Prefix Sum Dynamic Programming (DP) Trees and Graphs

Réponse à la question d'entretien

Utilisateur anonyme

16 juil. 2025

I attempted only the first question, which was based on arrays. It involved logic around prefix sums and subarray manipulation. I was able to write a partial solution and passed some of the test cases. Though I couldn’t attempt the remaining questions, the challenge helped me understand how to approach array-based problems more efficiently.