Shortest Path All Pairs Floyd

Table of Contents

• 2642. Design Graph With Shortest Path Calculator (Hard)
• 1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance (Medium)
• 2976. Minimum Cost to Convert String I (Medium)
• 2959. Number of Possible Sets of Closing Branches (Hard)
• 2977. Minimum Cost to Convert String II (Hard)
• 2101. Detonate the Maximum Bombs (Medium)

2642. Design Graph With Shortest Path Calculator

• LeetCode | 力扣

• Tags: Graph, Design, Heap Priority Queue, Shortest Path

1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance

• LeetCode | 力扣

• Tags: Dynamic Programming, Graph, Shortest Path

2976. Minimum Cost to Convert String I

• LeetCode | 力扣

• Tags: Array, String, Graph, Shortest Path

2959. Number of Possible Sets of Closing Branches

• LeetCode | 力扣

• Tags: Bit Manipulation, Graph, Heap Priority Queue, Enumeration, Shortest Path

2977. Minimum Cost to Convert String II

• LeetCode | 力扣

• Tags: Array, String, Dynamic Programming, Graph, Trie, Shortest Path

2101. Detonate the Maximum Bombs

• LeetCode | 力扣

• Tags: Array, Math, Depth First Search, Breadth First Search, Graph, Geometry