Leetcode 3788. Maximum Score of a Split | Prefix Array & Suffix Array | O(N) | Medium | C++

Hi, in this video, I have discussed LeetCode problem 3788. Maximum Score of a Split. 1. Explained the problem statement with examples. 2. Shared brute force approach of time complexity O(N^2). 3. Shared optimal approach by using prefix and suffix array. time complexity is O(N). 4. Shared C++ code. Problem Link:- https://leetcode.com/problems/maximum-score-of-a-split/ Code Link:- https://leetcode.com/problems/maximum-score-of-a-split/submissions/1867085141/