📌 Description

Extended Dijkstra refers to a class of shortest path algorithms derived from Dijkstra, adapted to problems where each node must track additional state information, such as the number of operations used, remaining power, or whether a bonus has been applied

# Info & Summary

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

Problem	Type(s)	Data Structure / Algo	🔥 Key Insight / Mark
E	Shortest distance	Extended Dijkstra	🧠🔥
F	Binary Search	Binary Search	🔥