MAXIMUM SPLIT OF POSITIVE EVEN INTEGERS | LEETCODE # 2178 | PYTHON SOLUTION

In this video we are solving a cool Google interview question: Maximum Split of Positive Even Integers (Leetcode # 2178).
On the surface this seems like quite the tricky question but once you see the solution it's very simple and intuitive as to how you are supposed to solve it.

[@tianmingguo8271]

Hi Cracking FAANG. Thank you for the explanation. For finding the index, you could use index=(cur_sum-finalSum)//2-1 to find index fast since your res list is ordered even numbers.

[@TheQuancy]

Explanations are some of the best ive seen. It's up there with Neetcode. Thank you

[@crackfaang]

Thanks! I'd say better than Neetcode but maybe I'm biased 😂

[@AnandKumar-kz3ls]

great explanation as always one thing to add here time complexity would be sqrt(finalSum) lets say 2 + 4 + ... + 2*N = finalSum we need to find the value of N 2*(1 + 2 + .... N) = finalSum (N*(N+1)) = finalSum finalSum approx equal to N = sqrt(finalSum) approx

[@subee128]

Thank you very much

[@harjeetkajal]

What is N in the time complexity?

[@gstar10811]

The code is nice and simple, but how can we prove it?

[@crackfaang]

No clue. We aren’t here to prove the solution works. As long as you can write the code and understand the solution well enough to explain it clearly and concisely, that’s all that matters. The interviewers have no clue about the proof, let alone candidates under pressure 😂