Path finding algorithm for 2d game

I'm pretty sure you'll find thousands of A* algorithms with a simple search.

But that don't work for 2d games. I want implementation that work for 2d game. I have found many code links but that didn't work for 2d game.

All pathfinding projects I've seen you could just as well use sprites instead of 3d models and an orthographic camera and suddenly it's a 2d game that uses the same pathfinding.

I read in some post that it word with 3d colliders not 2d colliders. So I conclude that those A* algorithm not work for me. If you can suggest me better algorithm then it will become helpful to me.

A* is a generic algorithm for finding the shortest path beaten nodes on a network. As long as you can represent your path space as a network then A* is good. It doesn't really care about dimensions.