LeetCode 1712. Ways to Split Array Into Three Subarrays

[@artistic__08]

Amazing explaination!!
But this is a O(nlogn) solution, is a O(n) solution possible ?

[@8thFloorHarmony]

fatser than 100.0% looks so amazing :p

[@popemuhammed5749]

ive never seen that in my life

[@artistic__08]

sad@@popemuhammed5749

[@jaatharsh]

clear explanation, thanks dude

[@sandeepnallala48]

Sir why it is r-l+1 will be the no.of ways for that particular i iteration.. please explain

[@happycoding1093]

l and r are the two boundaries that we can split between 2nd and 3rd, which means any split between l and r are a valid split, so in total, r-l+1

[@sandeepnallala48]

@@happycoding1093 Thanks sir 💯❤️

[@palukurisainikhil1228]

Sir done using backtracking but TLE,can we do it in top down sir

[@happycoding1093]

given the constraints 10^5, I would say no backtracking

[@anishsuman1371]

N 2 solution is bruteforce