Can i you give me an example of solving an equivalent problem?

Certainly! Consider the problem of finding the shortest path in a graph. An equivalent problem is finding the minimum spanning tree of the same graph, as both involve optimizing distance. While the shortest path focuses on connecting two specific nodes, the minimum spanning tree connects all nodes with the least total weight, and solving one can provide insights or techniques applicable to the other.