Use BFS algorithm to find the accessible area of a robot in a 2D graph
![Image](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiWwW_LIyooCunJ1qubVhJQ7aF5KRc9qp9p1yPbHtJFRCD69F0Rckj8xFhyphenhyphenuKpfxffR-w-oKHus9Y3yM7B167vkIgOsAuvQwjD5UIi3k5BdvMIo8Fe3jCFEZXau6NgcZEp5TGolGCO6g3c/s0/Animated_BFS.gif)
Recently, I found myself started to love working with algorithms. The funny thing is I was never interested in algorithms back in my university time. Maybe because I'm more attracted to something that has a visual appearance or has real-life applications, something like Physics I thought. After more than 10 years working in the field of cloud computing, networks, and computer system, I realized everything are operating by algorithms. Algorithms to optimize network configurations, algorithms to make the application process faster, algorithms to auto-scale the clusters, etc. It may be a little bit too late but right now I can tell algorithms are beautiful. I tried some HackerRank coding challenges and the problem below caught my eye because it's used in pathfinder, searching, etc. They can be very useful for a cloud architect like myself when optimizing network configurations or building some automation apps. The Problem: There is a robot that can move around on a grid. The robot