g | x | w | all
Bytes Lang Time Link
103Python 3250521T010228ZCrSb0001
035Charcoal250521T003029ZNeil
2325Vyxal j250520T234050Zlyxal
062TinyAPL250520T210011ZRubenVer

Python 3, 77 103 bytes

print(*map(lambda n:'Fizz'*(n%3==0)+'Buzz'*(n%7==0)+'Bazz'*(n%5==0)+'Pazz'*(n%10==0)or n,range(1,101)))

Shortest way I could think of doing this, but there's probably a shorter method using some wizardry I don't know about.

I had to lose 26 bytes, as I didn't realize until starting to refactor the OP's question formatting that I was supposed to print all values from 1 to 100. (however if it is fine to just have it be a function that outputs individual items, I can simply put back my 77-byte solution)

Charcoal, 35 bytes

E¹⁰⁰∨⭆⪪FiBuBaPa²⎇﹪⊕ι⊕§2649μω⁺λzzI⊕ι

Try it online! Link is to verbose version of code. Explanation:

 ¹⁰⁰                                Literal integer `100`
E                                   Map over implicit range
       FiBuBaPa                     Literal string `FiBuBaPa`
      ⪪                             Split into substrings of length
               ²                    Literal integer `2`
     ⭆                              Map over substrings and join
                   ι                Outer value
                  ⊕                 Incremented
                 ﹪                  Modulo
                      2649          Literal string `2649`
                     §              Indexed by
                          μ         Inner index
                    ⊕               Incremented
                ⎇                   If non-zero then
                           ω        Empty string else
                             λ      Current substring
                            ⁺       Concatenated with
                              zz    Literal string `zz`
    ∨                               Logical Or
                                  ι Current value
                                 ⊕  Incremented
                                I   Cast to string
                                    Implicitly print

Vyxal j, 186 bitsv2, 23.25 bytes

₁ƛ375f₀JḊkF½«∨"k⟑ẏ«½Jǐ*∑∨

Try it Online!

Bitstring:

101011000110101010011011001100000100110101111010001000101011101000000101101110111001000011100001001101001001000001111100000001101101100101101101110111100111100110010001101010110000101110

I had to.

Explained

₁ƛ375f₀JḊkF½«∨"k⟑ẏ«½Jǐ*∑∨­⁡​‎‎⁡⁠⁡‏⁠‎⁡⁠⁢‏‏​⁡⁠⁡‌⁢​‎‎⁡⁠⁣‏⁠‎⁡⁠⁤‏⁠‎⁡⁠⁢⁡‏⁠‎⁡⁠⁢⁢‏⁠‎⁡⁠⁢⁣‏⁠‎⁡⁠⁢⁤‏⁠‎⁡⁠⁣⁡‏‏​⁡⁠⁡‌⁣​‎‎⁡⁠⁣⁢‏⁠‎⁡⁠⁣⁣‏⁠‎⁡⁠⁣⁤‏‏​⁡⁠⁡‌⁤​‎‎⁡⁠⁤⁡‏⁠‎⁡⁠⁤⁢‏⁠‎⁡⁠⁤⁣‏⁠‎⁡⁠⁤⁤‏⁠‎⁡⁠⁢⁡⁡‏⁠‎⁡⁠⁢⁡⁢‏⁠‎⁡⁠⁢⁡⁣‏⁠‎⁡⁠⁢⁡⁤‏⁠‎⁡⁠⁢⁢⁡‏‏​⁡⁠⁡‌⁢⁡​‎‎⁡⁠⁢⁢⁢‏‏​⁡⁠⁡‌⁢⁢​‎‎⁡⁠⁢⁢⁣‏⁠‎⁡⁠⁢⁢⁤‏⁠‎⁡⁠⁢⁣⁡‏‏​⁡⁠⁡‌⁢⁣​‎‏​⁢⁠⁡‌­
₁ƛ                         # ‎⁡Over each `n` in the range [1, 100]
  375f₀JḊ                  # ‎⁢  Push [n divisible-by 3?, n divisible-by 7?, n divisible-by 5?, n divisible-by 10?]   
         kF½               # ‎⁣  Everybody's favourite ["Fizz", "Buzz"] list
            «∨"k⟑ẏ«½J      # ‎⁤  With all items of the list ["bazz", "pazz"] added
                     ǐ     # ‎⁢⁡  And title-cased
                      *∑∨  # ‎⁢⁢  The classic "multiply, sum, and then if that string is empty get the original n else return the string" combo
# ‎⁢⁣In the usual fashion, the `j` flag joins on newlines
💎

Created with the help of Luminespire.

TinyAPL, 62

⎕P¨⟨3:"Fizz"⋄7:"Buzz"⋄5:"Bazz"⋄10:"Pazz"⟩⦅⍕⥼↾⟜∊⊇⥽⌿⍨0=⊃⊸|⦆ᑈ…100

The classic generic fizzbuzz, subbing in the asked strings.

⎕P¨⟨3:"Fizz"⋄7:"Buzz"⋄5:"Bazz"⋄10:"Pazz"⟩⦅⍕⥼↾⟜∊⊇⥽⌿⍨0=⊃⊸|⦆ᑈ…100­⁡​‎‎⁡⁠⁤‏⁠‎⁡⁠⁢⁡‏⁠‎⁡⁠⁢⁢‏⁠‎⁡⁠⁢⁣‏⁠‎⁡⁠⁢⁤‏⁠‎⁡⁠⁣⁡‏⁠‎⁡⁠⁣⁢‏⁠‎⁡⁠⁣⁣‏⁠‎⁡⁠⁣⁤‏⁠‎⁡⁠⁤⁡‏⁠‎⁡⁠⁤⁢‏⁠‎⁡⁠⁤⁣‏⁠‎⁡⁠⁤⁤‏⁠‎⁡⁠⁢⁡⁡‏⁠‎⁡⁠⁢⁡⁢‏⁠‎⁡⁠⁢⁡⁣‏⁠‎⁡⁠⁢⁡⁤‏⁠‎⁡⁠⁢⁢⁡‏⁠‎⁡⁠⁢⁢⁢‏⁠‎⁡⁠⁢⁢⁣‏⁠‎⁡⁠⁢⁢⁤‏⁠‎⁡⁠⁢⁣⁡‏⁠‎⁡⁠⁢⁣⁢‏⁠‎⁡⁠⁢⁣⁣‏⁠‎⁡⁠⁢⁣⁤‏⁠‎⁡⁠⁢⁤⁡‏⁠‎⁡⁠⁢⁤⁢‏⁠‎⁡⁠⁢⁤⁣‏⁠‎⁡⁠⁢⁤⁤‏⁠‎⁡⁠⁣⁡⁡‏⁠‎⁡⁠⁣⁡⁢‏⁠‎⁡⁠⁣⁡⁣‏⁠‎⁡⁠⁣⁡⁤‏⁠‎⁡⁠⁣⁢⁡‏⁠‎⁡⁠⁣⁢⁢‏⁠‎⁡⁠⁣⁢⁣‏⁠‎⁡⁠⁣⁢⁤‏⁠‎⁡⁠⁣⁣⁡‏‏​⁡⁠⁡‌⁢​‎⁠‎⁡⁠⁣⁣⁢‏⁠‎⁡⁠⁤⁣⁡‏⁠‎⁡⁠⁤⁣⁢‏⁠‎⁡⁠⁤⁣⁣‏⁠‎⁡⁠⁤⁣⁤‏⁠‎⁡⁠⁤⁤⁡‏⁠‎⁡⁠⁤⁤⁢‏‏​⁡⁠⁡‌⁣​‎‎⁡⁠⁤⁢⁢‏⁠‎⁡⁠⁤⁢⁣‏⁠‎⁡⁠⁤⁢⁤‏‏​⁡⁠⁡‌⁤​‎‎⁡⁠⁤⁡⁤‏⁠‎⁡⁠⁤⁢⁡‏‏​⁡⁠⁡‌⁢⁡​‎‎⁡⁠⁣⁤⁤‏⁠‎⁡⁠⁤⁡⁡‏⁠‎⁡⁠⁤⁡⁢‏⁠‎⁡⁠⁤⁡⁣‏⁠‏​⁡⁠⁡‌⁢⁢​‎⁠‎⁡⁠⁣⁤⁢‏⁠‎⁡⁠⁣⁤⁣‏‏​⁡⁠⁡‌⁢⁣​‎‎⁡⁠⁣⁣⁣‏⁠‎⁡⁠⁣⁣⁤‏⁠‎⁡⁠⁣⁤⁡‏‏​⁡⁠⁡‌⁢⁤​‎‎⁡⁠⁡‏⁠‎⁡⁠⁢‏⁠‎⁡⁠⁣‏‏​⁡⁠⁡‌­
   ⟨3:"Fizz"⋄7:"Buzz"⋄5:"Bazz"⋄10:"Pazz"⟩                       ⍝ ‎⁡dictionary of divisors to strings
                                         ⦅              ⦆ᑈ…100  ⍝ ‎⁢map each number from 1 to 100:
                                                     ⊃⊸|        ⍝ ‎⁣modulo by the keys of the dict
                                                   0=           ⍝ ‎⁤is equal to zero
                                               ⊇⥽⌿⍨             ⍝ ‎⁢⁡keep values of the dict where true
                                             ⟜∊                 ⍝ ‎⁢⁢concatenate strings
                                          ⍕⥼↾                   ⍝ ‎⁢⁣keep longer string between the one just computed and the stringification of the number
⎕P¨                                                             ⍝ ‎⁢⁤print each string
💎

Created with the help of Luminespire.