Problem $11($Contiguous Elements Summing to $0).$

Given an array $A[1$:$n]$ you need to decide whether or not there exists indices $1ijn$ such that

${\displaystyle \underset{ikj}{\overset{?}{}}}A[k]=0.$ Describe an $O(nlogn)$ time algorithm to solve this. Use Divide and Conquer.