We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Search
  4. Sherlock and Array
  5. Discussions

Sherlock and Array

  • alban_tyrex
     + 0 comments

    Here is my c++ solution, you can watch the explanation here : https://youtu.be/-kwepBHt_jM

    string balancedSums(vector<int> arr) {
    int ls = 0, rs = accumulate(arr.begin(), arr.end(), 0);
    for(int i = 0; i < arr.size(); i++){
        rs -= arr[i];
        if(i != 0) ls += arr[i-1];
        if(ls == rs) return "YES";
    }
    return "NO";
}