Given an integer array of size n, find all elements that appear more than [n/3] times. If no such element exists, return -1. Input_1:Array : 20,30,10,10,5,4,20,1,2…
Given an integer array of size n, find all elements that appear more than [n/3] times. If no such element exists, return -1. Input_1:Array : 20,30,10,10,5,4,20,1,2…