NP Hard and NP Complete Problems Concept Discussion

NP-hard or Non Deterministic Polynomial Time Hard problem is a situation where an algorithm that solves it can be converted to one for solving other NP-Problems.

It's also written that a problem is NP-hard if and only if there is an NP-complete problem.

Please explain this concept (with suitable example if possible). 😐