🧠 Before you code — what pattern fits?
Given an array of integers nums, return the leftmost pivot index: the index where the sum of all numbers strictly to its left equals the sum of all numbers strictly to its right. Return -1 if no such index exists.
[1,7,3,6,5,6] → 3
[1,2,3] → -1
[2,1,-1] → 0
🎬 Video explanation · NeetCode
Your solution runs against 3 unit tests, including edge and large-value cases.
Loading...
Test console · 3 unit tests
Submit your code to run it against all 3 unit tests. Results appear here.
JavaScript, TypeScript & Python run sandboxed in your browser; other languages run on the execution server. Your code is saved locally as you type.