#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/graph-theory/small-to-large-merging

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/graph-theory/small-to-large-merging

Lessons

1. Intro

2. The Merging Problem

3. Naive Merging

Practice Problems

Ready to start learning?

4. Worst Case: Chain Tree

5. The Important idea

6. Why O(n log n) Works

7. Implementation Pattern

8. Code Structure

9. Tracking Subtree Sizes

10. Reusing the Largest Set

11. Problem - Distinct Colors

12. Distinct Colors - Naive Approach

13. Distinct Colors - Algorithm

14. Distinct Colors - Implementation

15. Distinct Colors - Walkthrough

16. Distinct Colors - Lessons

17. Problem - Lomsat gelral

18. Lomsat gelral - Observation

19. Lomsat gelral - Algorithm

20. Lomsat gelral - Maintaining the Max

21. Lomsat gelral - Implementation

22. Lomsat gelral - Walkthrough

23. Lomsat gelral - Lessons

24. When to Use Small-to-Large

25. Alternatives to Small-to-Large

26. Memory Considerations

27. Connection to Heavy-Light Decomposition

28. Implementation Tips

29. Debugging Small-to-Large

30. Check Your Understanding

31. Check Your Understanding

32. Variations of the Technique

33. Practice Tips

34. Common Problem Variations

35. Online vs Offline

36. Space Improvement

37. Constant Factors

38. Combining with Other Techniques

39. Historical Note

40. Section 18 Recap