Probabilistic simultaneous polynomial reconstruction algorithm of Bleichenbacher, Kiayias, and Yung is extended to the polynomials whose degrees are allowed to be distinct. Specifically, for a finite field , positive integers n, r, t and distinct elements , we present a probabilistic algorithm which can recover polynomials of degree less than respectively for a given instance satisfying for all and for all such that with probability at least and with time complexity at most if . Next, by using this algorithm, we present a probabilistic decoder for interleaved Reed–Solomon codes. It is observed that interleaved Reed–Solomon codes over with rate R can be decoded up to burst error rate probabilistically for an interleaving parameter r. Then, it is proved that q-folded Hermitian codes over with rate R can be decoded up to error rate probabilistically.