Need help in BIT

Can somebody explain “Range Updates And Range Queries in BIT”?
Can’t Understand…Please Help…

Hi @avik26091998,

I recommend you to do it in this sequence:

  1. Understand BIT
    https://www.youtube.com/watch?v=CWDQJGaN1gY
  2. Range Query logic
    http://codeforces.com/blog/entry/619
  3. Just code a simple inplementation
    https://www.hackerearth.com/practice/notes/binary-indexed-tree-or-fenwick-tree/
  4. Code a slightly complicated one
    https://www.hackerearth.com/practice/notes/binary-indexed-tree-made-easy-2/
  5. You cannot become good at it unless you code it multiple times. So it’s okay to study the code from the above sites and write it on paper, if need help then check the code again.
  6. Repeat 3-5 until you are able to code it perfectly without referring the reference material.
  7. Solve these to improve your concepts
    https://www.hackerearth.com/practice/data-structures/advanced-data-structures/fenwick-binary-indexed-trees/practice-problems/
  8. Upvote this post if you liked it :slight_smile:
1 Like

@obi1 great post.
Can you suggest such a post for segment tree. I know basic of segment trees like rmq, point update.

Hi @pavitra_ag,
I personally am not very good with segment trees but I can suggest you the approach I took to get started.

  1. Tushar Roy’s basics
    https://www.youtube.com/watch?v=ZBHKZF5w4YU
  2. Lazy propogation
    https://www.youtube.com/watch?v=xuoQdt5pHj0
  3. Fast Iterative implementation of segment tree
    http://codeforces.com/blog/entry/18051
  4. Recursive segment tree
    https://www.hackerearth.com/practice/notes/segment-trees-for-beginners/
  5. What I personally refer to
    https://www.hackerearth.com/practice/notes/segment-tree-and-lazy-propagation/
  6. There’s simply no substitute to just solving it again and again using pen and paper(kinda fun doing in class when the lecture going on is pretty boring)
  7. I am currently solving these to get the hang of it
    https://www.hackerearth.com/practice/data-structures/advanced-data-structures/segment-trees/practice-problems/
1 Like

BIT is binary indexed tree(fenwick tree) ??

Yeah In Binary Indexed Tree.