3341. 找到到达最后一个房间的最短时间 I
Medium | Array, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path
Medium | Array, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path
Medium | Array, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path
Medium | Array, Binary Search, Sliding Window, Sorting, Prefix Sum
Medium | Array, Binary Search
Medium | Array, Prefix Sum
Medium | Array, Two Pointers, Binary Search, Prefix Sum
Medium | Array, String, Prefix Sum
Medium | Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum
Medium | Hash Table, String, Sorting
Medium | Array, Dynamic Programming
Medium | Array, Hash Table, Counting, Enumeration
Medium | Tree, Depth-First Search, Breadth-First Search
Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Breadth-First Search, Bitmask
Medium | Math, Graph Theory, Heap (Priority Queue), Number Theory, Shortest Path
Medium | Array, Math, Binary Indexed Tree, Segment Tree, Geometry, Sorting, Enumeration
Medium | Array, Hash Table, Prefix Sum
Medium | Array, String, Depth-First Search, Breadth-First Search, Graph Theory
Medium | Array, Dynamic Programming
Medium | Array, Dynamic Programming, Bit Manipulation, Matrix
Medium | Array, Sorting