Code Monk: Binary Indexed Tree

Правка en3, от rivudas, 2015-10-07 18:30:51

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.

The link to the contest: 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 harshil. I am the tester and the editorials are presented by usaxena95.

Also, top 3 newbie winners to get HackerEarth T-shirts in each Code Monk challenge!

To learn more about Binary Indexed Tree — click here.

Good luck everyone! :)

Edit: The contest has started. Good luck!

Теги hackerearth, codemonk, binary indexed tree

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en4 Английский rivudas 2015-10-07 21:45:11 154
en3 Английский rivudas 2015-10-07 18:30:51 41 Tiny change: 'ne! :)\n\n' -> 'ne! :)\n\nEdit: The contest has started. Good luck!'
en2 Английский rivudas 2015-10-07 17:19:50 137
en1 Английский rivudas 2015-10-07 17:00:50 848 Initial revision (published)