# Info & Summary

• Date: 2025-06-07
• Completion Status: A ✅ / B ✅ / C ❌ / D ✅ / E ✅ / F ❌ / G ❌
• Problem Type:

Problem	Type(s)	Data Structure / Algo	🔥 Key Insight / Mark
D	Math	Prefix Sum	🧠
D	String	Constructive	🧠
E	Tree DP	DFS / Tree DP	🧠🛠️
F	DSU	DSU	🌀
G	Math	Fast Fourier Transform	🌀

# Info & Summary

• Date: 2025-05-24
• Completion Status: A ✅ / B ✅ / C ✅ / D ✅ / E ❌ / F ❌ / G ❌
• Problem Type:

Problem	Type(s)	Data Structure / Algo	🔥 Key Insight / Mark
C	Simulation	Math	⭐🧠🔥
D	bitmask, DP	Bitmask DP	⭐🧠🔥
E	Constructive	Constructive	🌀
F	Math		🌀
G	Graph		🌀

# Info & Summary

• Date: 2025-05-17
• Completion Status: A ✅ / B ✅ / C ❌ / D ✅ / E ❌ / F ❌ / G ❌
• Problem Type:

Problem	Type(s)	Data Structure / Algo	🔥 Key Insight / Mark
C	String	Brute Force	🌀
E	Digit DP	Digit DP	🌀
F	Tree	DFS & Fenwick Tree	🌀
G	DP	DP/Fenwick Tree	🌀

# Info & Summary

• Date: 2025-04-19
• Completion Status: A ✅ / B ✅ / C ✅ / D ❌ / E ✅ / F ❌ / G ❌
• Problem Type:

Problem	Type(s)	Data Structure / Algo	🔥 Key Insight / Mark
D	Efficient Counting	Math	⭐
E	Expected Value Optimization	DP/Bottom-Up DP/DFS	🔥🧠
F	Path Enumeration	Meet-in-the-Middle/Bitmask	🔥🛠️

Problem	Data Structure / Algo	🔥 Key Insight / Mark
Tree Diameter	BFS	⭐🛠️🔥
Subtree Size	DFS	⭐🛠️🔥

📌 Description

A bipartite graph is a type of graph where the set of vertices can be divided into two disjoint sets $U$ and $V$ such that:

# Info & Summary

• Date: 2025-03-29
• Completion Status: A ✅ / B ✅ / C ✅ / D ❌ / E ✅ / F ❌ / G ❌
• Problem Type:

Problem	Type(s)	Data Structure / Algo	🔥 Key Insight / Mark
C	Graph	DFS/BFS/DSU	⭐🛠️🔥
D	Pairwise Pattern Check with Indexed Constraints	Simulation	⭐
E	String/Graph	DSU	🧠🌀⭐
F	Algebraic Dynamic Programming	DP/Prefix Sum	🌀
G	Tree	Matroid	🧠🌀

# Info & Summary

• Date: 2025-03-15
• Completion Status: A ✅ / B ✅ / C ✅ / D ✅ / E ❌ / F ❌ / G ❌
• Problem Type:

Problem	Type(s)	Data Structure / Algo	🔥 Key Insight / Mark
C	Distinct elements	Prefix Sum/Suffix Sum	⭐🔥
D	Quadratic formula	Math/Binary Search	⭐
E	Subtree Size	DFS/Tree DP	🔥🛠️
F	Distinct elements	DP/Lazy Segment Tree	🌀🧠🛠️🔥
G	Maximize Distance	Binary Search/Max Flow	🌀

# Info & Summary

• Date: 2025-02-22
• Completion Status: A ✅ / B ✅ / C ✅ / D ✅ / E ❌ / F ❌ / G ❌
• Problem Type:

Problem	Type(s)	Data Structure / Algo	🔥 Key Insight / Mark
E	Shortest Path	BFS	🧠🔥
F	Tree DP	Tree DP/DFS	🔥

# Info & Summary

• Date: 2025-02-08
• Completion Status: A ✅ / B ✅ / C ✅ / D ✅ / E ❌ / F ❌ / G ❌
• Problem Type:

Problem	Type(s)	Data Structure / Algo	🔥 Key Insight / Mark
D	Math	Math	⭐
E	Connected component	DSU/DFS/BFS	🔥🛠️
F	Constructive	Fenwick Tree	🔥🛠️🧠