Java, C programs can be used for checking of duplication in an 2-d array.
In C++, you could std::sort (as a sequence of std::pairs) and then std::unique or std::adjacent_find in a loop or whatever you need.
Or you could add them to a std::set (or even std::unordered_set) of such pairs, tracking where set.insert().second is false. There are plenty of ways to manipulate a sequence like this.
If you check this 14
You've to print the duplicate entries and use C++ containers. For accurate results and check. Thanks