Code Monk: Binary Indexed Tree
Difference between en3 and en4, changed 154 character(s)
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! :)↵
↵
Edit: The contest has started. Good luck!↵
↵
Edit: The top 3 winners are:↵
      1. [user:I_love_Tanya_Romanova,2015-10-07]↵
      2. [user:P_Nyagolov,2015-10-07]↵
      3. [user:AliA,2015-10-07]

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English rivudas 2015-10-07 21:45:11 154
en3 English rivudas 2015-10-07 18:30:51 41 Tiny change: 'ne! :)\n\n' -> 'ne! :)\n\nEdit: The contest has started. Good luck!'
en2 English rivudas 2015-10-07 17:19:50 137
en1 English rivudas 2015-10-07 17:00:50 848 Initial revision (published)