Range Sum Query and Inversion Count Using BIT | Part 2

In this video I have discussed questions related to binary indexed trees data structure. This Part 2 of the series. If you haven't watched Part 1, Go check it out here : https://youtu.be/DPiY9wFxGIw Will drop a Part 3 of this video soon in which i will discuss a little advanced question related to this data structure. Code Question 1: https://github.com/luvk1412/youtube_codes/blob/master/binary_indexed_trees/q1_rangesum.cpp Question 2: https://github.com/luvk1412/youtube_codes/blob/master/binary_indexed_trees/q2_inversion_ct.cpp Practice questions : Range sum query : https://leetcode.com/problems/range-sum-query-mutable/ Inversion Count : https://www.spoj.com/problems/INVCNT/ Follow me on below platforms for all latest updates Facebook : https://www.facebook.com/luvk1412/ Instagram : https://www.instagram.com/i._m_.luv/ Twitter : https://twitter.com/Luvk1412 Linkedin : https://www.linkedin.com/in/luvk1412/ Part 1 : (0:00) Range Sum Query : (0:24) Inversion Count : (3:57) Hashtag : #inversioncount #rangesum #binaryindexed #competitivecoding #interviewpreparation