Hello @anjuyadav.1398
Hope you are doing great! Here is the answer to your question!
Use a Python Set for Faster Duplicate Checking: If you’re primarily concerned with checking duplicates, a Python set is much more efficient. Sets are implemented as hash tables, so membership checks (i.e., checking if an item exists) are generally O(1) on average. In contrast, for a Python list, membership checks are O(n), meaning that as the list grows larger, the time it takes to check for duplicates increases significantly.