I try to find a solution to compare two hashmaps in javascript but I have a difficulty.
This is my situation, I have a hashmap composed of a key + value in form of an array.
Example : 125 : [1 , 2 , 3].
And then I take this data and I compare it with another hashmap with this kind.
Example :
123 : [[1 , 1 , 1][2 , 8.7 , 10]]
124 : [[0 , 0, 5.4][3 , 4 , 5][7, 9.1 , 6]
125 : [[1 , 2 , 3][0.4 , 4 , 8]]
The second hashmap is similar to the first , but its value could contain an array of N arrays. The goal : To parse the second hashmap with my first hashmap and search if once it finds the value of the first in an array of the second it must return "OK"
For example in this case : it will return "OK" because we can notice that the key 125 and her value in the first hashmap is include in 125 : [[1 , 2 , 3][0.4 , 4 , 8]]
I should not only test on the values but also on the keys