Rollback Idea on Union Find | Small to Large merging | Advanced Idea | Part 3
This is a part of 3 part Advanced Series, we are talking about some good advanced ideas on Union find. Link to 4 Videos: Fundamentals : • Disjoint Set Union Fundamentals | Union Fi... Advanced Idea 1 : • Weighted Union Find | Small to Large mergi... Advanced Idea 2 : • Rollback Idea on Union Find | Small to Lar... Advanced Idea 3 : • DSU on Tree | Small to Large merging | Adv... Do share with your friends who are doing CP besides you / Are preparing for internships and placements. ✨ Hashtags ✨ #VivekGupta #Competititve #CPStreams #codechef #codeforces #engineering #internship ------------------------------------------------------------------------------------------------------------- If you are a beginner, here are some resources to start with : ✅ Free Language course with certificate that i taught - https://bit.ly/3I52EAb ✅ More free courses - https://bit.ly/3SKoCNO If you are looking to train in a commado like regime for acing DSA (with DEV and System Design covered for placement too), do checkout : 🔴 https://bit.ly/3SKoM7S If you want to connect over social media or want more resources : https://linktr.ee/vivek_gupta

DSU on Tree | Small to Large merging | Advanced Idea | Part 4

Disjoint Set Union Fundamentals | Union Find | Small to Large merging | Part 1

Weighted Union Find | Small to Large merging | Advanced Idea | Part 2

The Scariest Chart in Electrical Engineering

EP1: Winning Greedy Ideas | CSES Missing Coin Sum Queries | Find what you can’t create | English

XOR Space | Competitive Programming Winning Technique 2 | Gaussian Elimination | Vivek Gupta

G-46. Disjoint Set | Union by Rank | Union by Size | Path Compression

Last Lecture Series: “How to Win Without Crushing Your Soul” - Graham Weaver

No Boss, No Money: The Raw Reality of China’s Gen-Z Freelancers

Turing Award Winner: Disagreeing with Google, Postgres, Future Problems | Mike Stonebraker

DSU on Trees Simplified by Arpa; ICPC World Finalist and Judge!

MIT Professor: Leetcode, P vs NP, SAT Solvers | Ryan Williams

Dynamic Connectivity for Competitive Programming | DSU Rollback on Segment Tree | Vivek

Awesome Hashing ideas no one told you about in Competitive Programming | XOR Hash | Set Hash & more

EP3: Winning Greedy Ideas | Minimum number of swaps to target | English

The Java Story | The Official Documentary

Creator of C++: Bell Labs, Negative Overhead Abstraction, Mistakes | Bjarne Stroustrup

A Top Mathematician's 9 Lessons for Anyone Who Feels Behind | Ken Ono, Axiom Math
![Yann LeCun's $1B Bet Against LLMs [Part 1]](https://i.ytimg.com/vi/kYkIdXwW2AE/hqdefault.jpg?sqp=-oaymwEjCNACELwBSFryq4qpAxUIARUAAAAAGAElAADIQj0AgKJDeAE=&rs=AOn4CLDbV4izF3i-wxevCVIn7FJjoy1vlA)
Yann LeCun's $1B Bet Against LLMs [Part 1]

