Moocable is learner-supported. When you buy through links on our site, we may earn an affiliate commission.
Syllabus
- 1. Longest Consecutive Sequence
- 2. Graph Valid Tree
- 3. Number of Islands II
- 4. Data Stream as Disjoint Intervals
- 5. Number of Provinces
- 6. Number of Distinct Islands II
- 7. Accounts Merge
- 8. Sentence Similarity II
- 9. Contain Virus
- 10. Similar String Groups
- 11. Minimize Malware Spread
- 12. Minimize Malware Spread II
- 13. Regions Cut By Slashes
- 14. Satisfiability of Equality Equations
- 15. Lexicographically Smallest Equivalent String
- 16. The Earliest Moment When Everyone Become Friends
- 17. Optimize Water Distribution in a Village
- 18. Synonymous Sentences
- 19. Graph Connectivity With Threshold
- 20. Rank Transform of a Matrix
- 21. Smallest String With Swaps
- 22. Number of Operations to Make Network Connected
- 23. Number of Ways to Wear Different Hats to Each Other
- 24. Remove Max Number of Edges to Keep Graph Fully Traversable
- 25. Checking Existence of Edge Length Limited Paths
Problem Set 
Free 
Intermediate 
No certificate 
-
TypeProblem Set
-
Provider
-
PricingFree
-
DifficultyIntermediate
-
CertificateNo certificate
- 1. Longest Consecutive Sequence
- 2. Graph Valid Tree
- 3. Number of Islands II
- 4. Data Stream as Disjoint Intervals
- 5. Number of Provinces
- 6. Number of Distinct Islands II
- 7. Accounts Merge
- 8. Sentence Similarity II
- 9. Contain Virus
- 10. Similar String Groups
- 11. Minimize Malware Spread
- 12. Minimize Malware Spread II
- 13. Regions Cut By Slashes
- 14. Satisfiability of Equality Equations
- 15. Lexicographically Smallest Equivalent String
- 16. The Earliest Moment When Everyone Become Friends
- 17. Optimize Water Distribution in a Village
- 18. Synonymous Sentences
- 19. Graph Connectivity With Threshold
- 20. Rank Transform of a Matrix
- 21. Smallest String With Swaps
- 22. Number of Operations to Make Network Connected
- 23. Number of Ways to Wear Different Hats to Each Other
- 24. Remove Max Number of Edges to Keep Graph Fully Traversable
- 25. Checking Existence of Edge Length Limited Paths
Loading...
Saving...
Loading...