Segment tree problem!!
Difference between en1 and en2, changed 19 character(s)
I just started with segment tree based problems but thinking about a lot on this question i just need a small hint or something↵
to actually have a drive in this problem,can anybody just give me a hint how to approach this problem,↵
↵
Thanks!!↵
↵
[PROBLEM LINK](http://https://www.hackerearth.com/practice/data-structures/advanced-data-structures/segment-trees/practice-problems/algorithm/xor-sum-1-af648068/description/)

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Vesper_Lynd 2018-10-12 16:08:43 19
en1 English Vesper_Lynd 2018-10-12 15:54:20 443 Initial revision (published)