The same problem, technique or solution willl fix hit em both, right? So yet, tell us about that one. Ye, it's totally different. N plus more equals money is what we call a crypt arithmetic problem. If you line up the letters s, e, n, d and the letters m, o, e,. What digits can we fill in for each of those letters that will lead to sen plus more equalling money? Well, if you think about it, it actually is a constraint satisfaction problem. But when you first look at it, you might be like, wyl this seems totally different from the map coloring problem. But actually they're the same kind of