Skip to content
ı
Workspace
Workspace
Search anything…
⌘ K
Desk
Path
Problems
Review
More
PICK A CARD. FIND A PATTERN.
Priority-queue shortest paths
.
500 original challenges. Pick an index card and give it a go.
New problem
All problems
500
Bookmarked
My problems
Filters and order
1 active
Level
All
Level 0
Level 1
Level 2
Level 3
Level 4
Level 5
Level 6
Level 7
Level 8
Difficulty
All
Easy
Medium
Hard
Topic
All topics
Variables, loops, functions and conditionals
Variables and expressions
Conditionals
Loop accumulators
State in a loop
Helper functions
Arrays and strings
Adjacent array positions
String runs
Stable array filtering
Nested array traversal
String scanning
Maps, sets, counting and sorting
Frequency maps
Set membership
Set intersection
Map grouping
Comparator sorting
Two pointers, windows and prefix sums
Opposite-end pointers
Read and write pointers
Fixed sliding windows
Variable sliding windows
Prefix range subtraction
Two sorted streams
Stacks, queues, deques and simulations
Stack cancellation
Monotonic stacks
Queue simulation
Monotonic deques
Stack history
Recursion, sorting, binary search and bits
Divide-and-conquer recursion
Merge sort
Binary search boundaries
Binary search on answers
Bit counting
Prefix bit state
Linked lists, binary trees and search trees
Linked traversal
Linked pointer reversal
Fast and slow pointers
Tree preorder
Tree breadth-first traversal
BST range pruning
Graphs, heaps, union-find and tries
Graph breadth-first distances
Topological queues
Priority-queue shortest paths
Binary heaps
Union-find components
Trie prefix counts
Graph depth-first components
Greedy choices, dynamic programming and backtracking
Greedy interval selection
Counting dynamic programming
Unbounded dynamic programming
Zero-one knapsack
Sequence DP with binary search
Interval dynamic programming
Backtracking choices
Backtracking with occupancy
Scheduling DP and binary search
Status
Any
Solved
Attempted
Unsolved
Order
Path order
Title A–Z
Difficulty
STATUS
PROBLEM
DIFFICULTY
TOPIC
Weighted lines: Proof strip
Level 7 · Priority-queue shortest paths
Hard
Graphs, heaps, union-find and tries
Priority-queue shortest paths
Weighted lines: Total receipt
Level 7 · Priority-queue shortest paths
Hard
Graphs, heaps, union-find and tries
Priority-queue shortest paths
Weighted lines: Threshold file
Level 7 · Priority-queue shortest paths
Hard
Graphs, heaps, union-find and tries
Priority-queue shortest paths
Weighted lines: First qualifying slip
Level 7 · Priority-queue shortest paths
Hard
Graphs, heaps, union-find and tries
Priority-queue shortest paths
Weighted lines: Peak ticket
Level 7 · Priority-queue shortest paths
Hard
Graphs, heaps, union-find and tries
Priority-queue shortest paths
Weighted lines: Floor ticket
Level 7 · Priority-queue shortest paths
Hard
Graphs, heaps, union-find and tries
Priority-queue shortest paths
Weighted lines: Even-key census
Level 7 · Priority-queue shortest paths
Hard
Graphs, heaps, union-find and tries
Priority-queue shortest paths
Weighted lines: Positive-ink invoice
Level 7 · Priority-queue shortest paths
Hard
Graphs, heaps, union-find and tries
Priority-queue shortest paths
Weighted lines: Positive proof strip
Level 7 · Priority-queue shortest paths
Hard
Graphs, heaps, union-find and tries
Priority-queue shortest paths
Weighted lines: Boss receipt
Level 7 · Priority-queue shortest paths
Hard
Graphs, heaps, union-find and tries
Priority-queue shortest paths
10 of 500 problems
0 solved
Progress saved on this device
Not sure where to start? Try
the 30-day foundations plan
. One good problem at a time.