📌 Description

0-1 BFS is a variation of the Breadth-First-Search(BFS) algorithm, optimized for graphs where edge weights are either 0 or 1. This optimization takes advantage of the deque data structure to achieve faster performance compared to standard BFS or Dijkstra's algorithm

# Info & Summary

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

Problem	Type(s)	Data Structure / Algo	🔥 Key Insight / Mark
C	Binary Search	Binary Search	⭐🛠️🔥
D	0-1 BFS	0-1 BFS	⭐🛠️🔥
E	Linear Sieve	Linear Sieve	⚠️
F	DP	Range DP	🔥
G	DP	DP	🌀