Python | Count occurrences of an element in a Tuple

In this program, we need to accept a tuple and then find the number of times an item is present in the tuple. This can be done in various ways, but in this article, we will see how this can be done using simple approach and how inbuilt functions can be used to solve this problem.

Examples:

Tuple: (10, 8, 5, 2, 10, 15, 10, 8, 5, 8, 8, 2)

Input : 4
Output : 0 times

Input : 10
Output : 3 times

Input : 8
Output : 4 times



Method 1(Simple Approach):
We keep a counter that keeps on increasing if the esquired element is found in the tuple.

filter_none

edit
close

play_arrow

link
brightness_4
code

# Program to count the number of times an element
# Present in the list
def countX(tup, x):
    count = 0
    for ele in tup:
        if (ele == x):
            count = count + 1
    return count
   
# Driver Code
tup = (10, 8, 5, 2, 10, 15, 10, 8, 5, 8, 8, 2)
enq = 4
enq1 = 10
enq2 = 8
print(countX(tup, enq))
print(countX(tup, enq1))
print(countX(tup, enq2))

chevron_right


Output:

0 times
3 times
4 times

Method 2(Using count()):
The idea is to use method count() to count number of occurrences.

filter_none

edit
close

play_arrow

link
brightness_4
code

# Program to count the number of times an element
# Present in the list
# Count function is used
def Count(tup, en):
    return tup.count(en)
  
# Driver Code
tup = (10, 8, 5, 2, 10, 15, 10, 8, 5, 8, 8, 2)
enq = 4
enq1 = 10
enq2 = 8
print(Count(tup, enq), "times")
print(Count(tup, enq1), "times")
print(Count(tup, enq2), "times")

chevron_right


Output:

0 times
3 times
4 times


My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.




Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.