Modifying Efficient Solution - Problem - 1287 - Element Appearing More Than 25 Time

Author: Vanditg

Element_Appearing_More_Than_25_time/EfficientSolution.py

@@ -15,8 +15,6 @@
 #
 #Input: arr = [1,2,2,6,6,6,6,7,10]
 #Output: 6
-from collections import Counter as c 
 class Solution:
     def finaSpecialInteger(self, arr):
-        tmp = c(arr)	#Initialize tmp and count the occurance of numbers 
-        return (''.join([str(key) for key, val in tmp.items() if val/len(arr) > 1/4]))	#Return the number whose occurance is more tha 25% times
+        return (''.join([str(key) for key, val in collections.Counter(arr).items() if val/len(arr) > 1/4]))	#Return the number whose occurance is more tha 25% times