parking function of length n is a sequence π = (π1, . . . , πn) of positive integers such that if λ1 ≤ · · · ≤ λn is the increasing rearrangement of π1, . . . , πn, then λi ≤ i for 1 ≤ i ≤ n. We give a survey into parking functions, concentrating in particular on the probabilistic and combinatorial aspects. Joint work with multiple collaborators.