Competitive Programming Guide - Fenwick Trees Explained (Range Queries #3)

preview_player
Показать описание

Fenwick trees (also known as BIT - binary-indexed tree) are a useful data structure for range sums with short but mysterious code. I explain what's going on behind the scenes.

Fun fact: I only actually understood Fenwick trees after trying to explain them for this video. Hopefully this explanation helps you too.

  1. Jonathan Paulson
Рекомендации по теме
Competitive Programming Guide 0:20:21

Competitive Programming Guide - Fenwick Trees Explained (Range Queries #3)

Fenwick Tree Tutorial 0:17:51

Fenwick Tree Tutorial | Foolw-up problem from Codeforces | Check first comment before starting

Competitive Programming Guide 0:07:24

Competitive Programming Guide - Range Queries #1

Range Queries | 0:15:54

Range Queries | (Part 3) Fenwick Trees and their uses | CodeChef Tutorials | Yashodhan Agnihotri

Solving competitive programming 0:00:35

Solving competitive programming problems using Segment trees || Surya Kiran

PART 1 -Binary 1:24:19

PART 1 -Binary Indexed Tree/Fenwick Tree From Scratch | With CodeForces Problems | D - Multiset

[Part 7] BIT 0:06:02

[Part 7] BIT or Fenwick Tree || Competitive Programming Series

Competitive Programming Guide 0:13:45

Competitive Programming Guide - Sorting and Searching #13

From Beginner to 1:08:32

From Beginner to Grandmaster - Complete Roadmap for Competitive Programming

Fenwick tree/Binary Indexed 0:19:44

Fenwick tree/Binary Indexed tree

Competitive Programming Guide 0:05:30

Competitive Programming Guide - Math #2

Task 3 - 0:03:51

Task 3 - Beginner Guide into Competitive Programming

Fenwick Tree (Binary 0:34:18

Fenwick Tree (Binary Indexed Tree) | Competitive Programming

SQRT Decomposition vs 0:03:48

SQRT Decomposition vs Fenwick Tree(BIT) | Competitive Programming

Fenwick Tree Crash 0:44:04

Fenwick Tree Crash Course | Point Update & Range Query | Part - I

Binary Indexed Tree 0:18:57

Binary Indexed Tree | Fenwick Tree

Fenwick Tree (BIT) 0:10:43

Fenwick Tree (BIT) Preprocessing in O(n) | Competitive Programming

Codeforces Education Round 0:04:13

Codeforces Education Round #87 | Multiset | Binary Lifting on Fenwick Tree Approach

Which is faster? 0:00:46

Which is faster? Fenwick Tree (BIT) vs Segment Tree Stress Test

Roadmap for competitive 0:24:00

Roadmap for competitive programming(A complete sequence to follow)

How to Win 0:01:10

How to Win Coding Competitions: Secrets of Champions | ITMOx on edX | Course Video

Beginner's Guide to 0:04:33

Beginner's Guide to Competitive Programming || The Geeks Club

Create Sorted Array 0:17:44

Create Sorted Array through Instructions | Competitive Programming

Topics You Must 0:22:54

Topics You Must Know to Reach Expert on Codeforces || 5* on CodeChef || Free Resources

Комментарии
Автор

thank you, Jonathan!
the Fenwick Trees are hard to explain, but you did a good explanation. :)
I wonder if these structures are used in companies because I never learned Fenwick or Segment Trees in college. I mean, if I didn't participate in competitive programming contests I would never hear of these.

jpfr
join shbcf.ru