Am I programming the "testing Mars rover"? In reality it'd just be a 2D array because there's no need to over complicate something with the abstraction of efficiency

You know, this is a valid point. If you haven't seen my last video, it talks about how do you represent Battle ships in terms of a data structure. And if you look at the comments, we have people fighting over which one is better, bit set a hash map, a 2D array, which one funny enough, I went with the 2D array implementation during the interview. I wrote out the implementation if like a ship was hit given a specific position or if someone lost if the game state was over or if all the ships were down. Then at the end and I was asked like if it was an infinitely going grid, how would you implement it with a finite number of ships? And that's a hash map of course. But it's funny how everyone has different of opinions. And I think that's fundamental to what software engineering is is like everyone took the word efficient differently, right? Efficient in terms of implementation, efficient in terms of CPU, efficient in terms of memory, like there's so many different efficiencies. Like a bit set would be more efficient in terms of memory, but like in terms of implementation, you'd probably have easier with a 2D array. And then like a hash map has a lot of overhead, so is it really more efficient? That's why it's important to look at through all the comments and see so many different, you know, outlooks on it. Um but yeah, this is this is this is valid.