There are 21 PLL cases, and full PLL uses one algorithm for each. 2-look PLL needs only 6: T Perm or Y Perm to place the corners, then Ua Perm, Ub Perm, H Perm, or Z Perm to cycle the edges.
Which PLL algorithms are the shortest?
Shortest: Ua Perm, Ub Perm, and H Perm, 7 moves each. Longest: Na Perm, 21 moves. Move counts exclude cube rotations (x, y, z).
How often does each PLL case come up?
16 of the 21 cases each come up with probability 1/18. Rarer: Z Perm and E Perm (1/36 each); H Perm, Na Perm, and Nb Perm (1/72 each). A PLL skip (the last layer already solved) happens with probability 1/72.