Given two hashmap type data structures (expected, actual) compare the two maps and return the differences in the maps. Map values can be another map or it can be an integer value. A map can look like the following: Apple - 3 Orange Banana - 4 Strawberry - 7 Key Apple maps to 3 Key orange maps to another map containing banana mapped to 4 and strawberry mapped to 7
Anonimo
Recursive type solution where you have to flatten the keys of both maps. So for example on the map above: Apple - 3 Orange.Banana - 4 Orange.Strawberry - 7 And then compare the flattened key value mappings for differences.