L06 : Lazy Propagation Introduction | Segment Tree Course
This is the 6th lecture of this Segment Tree course series.
In this lecture I will introduce you with Lazy Propagation technique , which is a range update technique using which range updates can be performed in O(logN) time.
Course Support : https://discuss.codechef.com/t/segment-tree-course-codencode-youtube-8-may-2020-new-video-added/65096
if you think my work is worth praise you can donate using google pay , phone pay , paytm
UPI : 8010248418@ybl
You can follow me at
Instagram : https://www.instagram.com/code_ncode/
Github : https://github.com/Code-N-Code
linkedin : https://www.linkedin.com/in/waqar-ahmad-092b5a193/
Thank you guys for watching and keep coding.
CodeNCdode
Видео L06 : Lazy Propagation Introduction | Segment Tree Course канала Code NCode
In this lecture I will introduce you with Lazy Propagation technique , which is a range update technique using which range updates can be performed in O(logN) time.
Course Support : https://discuss.codechef.com/t/segment-tree-course-codencode-youtube-8-may-2020-new-video-added/65096
if you think my work is worth praise you can donate using google pay , phone pay , paytm
UPI : 8010248418@ybl
You can follow me at
Instagram : https://www.instagram.com/code_ncode/
Github : https://github.com/Code-N-Code
linkedin : https://www.linkedin.com/in/waqar-ahmad-092b5a193/
Thank you guys for watching and keep coding.
CodeNCdode
Видео L06 : Lazy Propagation Introduction | Segment Tree Course канала Code NCode
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
L07 : Lazy Propagation Implementation | Segment Tree CourseLazy Propagation Segment TreeWavelet Trees for competitive programming | IOI preparation #3Episode 4 - Segment TreesLazy Propagation in Segment Tree | GeeksforGeeksSegment Tree (Implementation)L03 : Lowest Common Ancestor | Part 1Distribute Coins in a Binary Tree | Problem - 979 | Complete Algorithm | LeetCode | CoderJA&DS S02E02. Segment Trees, Lazy PropagationSegment Trees - The Best Introduction in 10 minsSegment Tree - Range Queries with Lazy UpdatesSegment Tree #3 (Bangla | বাংলা) Lazy PropagationBinary Indexed Tree or Fenwick Tree | Construction and Operations | GeeksforGeeksFlood Fill - Codeforces Round #538Efficient Segment tree (Iterative method) || Range-Update Query || Competitive ProgrammingBreadth First Search Algorithm | Shortest Path | Graph TheorySegment Tree: Build and Query | Live Coding..Persistent Segment Trees - SPOJ - MKTHNUM5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search