Skip to content
Avio Lines
D23

Segment Tree & BIT

21 stations · 15h

Range queries with updates: segment trees and Fenwick trees. 8 concept lectures and 13 interview problems explained by codestorywithMIK (15h of video), grouped into 5 patterns such as Build & Range Query, Point Update, Lazy Propagation.

Start this line →
problems by zone (pattern)
  • Build & Range Query6
  • Point Update2
  • Lazy Propagation1
  • Fenwick Tree (BIT)4
  • Segment Tree Applications4
  1. Segment Tree54:43
  2. Segment Tree22:23
  3. Segment Tree29:01
  4. Segment Tree14:30
  5. Range Maximum Index Query34:19
  6. Range Maximum Index Query20:26
  7. Range Update32:44
  8. Maximize Active Section with Trade IILC 3501 · 1:05:55
    HardGoogle · Amazon · +1 more companiesLeetCode ↗ (opens in a new tab)

All 21 stations in order

  1. 1.Segment Tree
  2. 2.Segment Tree
  3. 3.Segment Tree
  4. 4.Segment Tree
  5. 5.Range Maximum Index Query
  6. 6.Range Maximum Index Query
  7. 7.Range Update
  8. 8.Maximize Active Section with Trade II (LeetCode 3501)
  9. 9.Query Sum II
  10. 10.Range Minimum Query
  11. 11.Range Update Query
  12. 12.Range Sum Query - Mutable (LeetCode 307)
  13. 13.Find Building Where Alice and Bob Can Meet (LeetCode 2940)
  14. 14.Count Good Triplets in an Array (LeetCode 2179)
  15. 15.Fruits Into Baskets II & III (LeetCode 3477)
  16. 16.Longest Balanced Subarray II (LeetCode 3721)
  17. 17.Block Placement Queries (LeetCode 3161)
  18. 18.Longest Substring of One Repeating Character (LeetCode 2213)
  19. 19.Distribute Elements Into Two Arrays II (LeetCode 3072)
  20. 20.Find X Value of Array II (LeetCode 3525)
  21. 21.Subarrays Distinct Element Sum of Squares II (LeetCode 2916)