Hello everyone,↵
↵
I want to invite you to participate in HackerEarth's Code Monk Contest where questions will be based on the topic Binary Indexed Tree. It is 3 hour long contest scheduled on 7th October. To check your timezone, click [here](http://goo.gl/V8P1Ki).↵
↵
The link to the contest: [https://www.hackerearth.com/code-monk-binary-indexed-tree/](https://www.hackerearth.com/code-monk-binary-indexed-tree/)↵
↵
The problem set consists of 4 algorithmic tasks with partial solutions allowed — you get points for every test that your solution passes. The problem set was prepared by [user:harshil,2015-10-07]. I am the tester and the editorials are presented by [user:usaxena95,2015-10-07].↵
↵
Also, top 3 newbie winners to get HackerEarth T-shirts in each Code Monk challenge!↵
↵
To learn more about Binary Indexed Tree — click [here](https://www.hackerearth.com/notes/binary-indexed-tree-or-fenwick-tree/).↵
↵
Good luck everyone! :)↵
↵
↵
I want to invite you to participate in HackerEarth's Code Monk Contest where questions will be based on the topic Binary Indexed Tree. It is 3 hour long contest scheduled on 7th October. To check your timezone, click [here](http://goo.gl/V8P1Ki).↵
↵
The link to the contest: [https://www.hackerearth.com/code-monk-binary-indexed-tree/](https://www.hackerearth.com/code-monk-binary-indexed-tree/)↵
↵
The problem set consists of 4 algorithmic tasks with partial solutions allowed — you get points for every test that your solution passes. The problem set was prepared by [user:harshil,2015-10-07]. I am the tester and the editorials are presented by [user:usaxena95,2015-10-07].↵
↵
Also, top 3 newbie winners to get HackerEarth T-shirts in each Code Monk challenge!↵
↵
To learn more about Binary Indexed Tree — click [here](https://www.hackerearth.com/notes/binary-indexed-tree-or-fenwick-tree/).↵
↵
Good luck everyone! :)↵
↵
