##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
LeetCode 2215
Given two arrays and , return a list where contains all distinct integers in but not in , and contains all distinct integers in but not in .
For example, if and , then and .
This is the set difference operation applied twice. Try solving it before reading on.