· 2 min read

Python tricks for Leetcode

If you use python for competitive programming, you might find these tricks useful. I have compiled a list of python tricks that can help you solve LeetCode problems faster.

If you use python for competitive programming, you might find these tricks useful. I have compiled a list of python tricks that can help you solve LeetCode problems faster.

Here I have compiled a list of python tricks that can help you solve LeetCode problems faster. If you use python for competitive programming, you might find these tricks useful.

Python

This is a collection of Python tips and tricks that I have found useful.

Table of Contents

  • Useful Functions
    • Enumerate
    • Divmod
    • Any and All
  • Data Structures
    • Sets

Useful Functions

Enumerate

The enumerate() function is used to iterate over a list and keep track of the index of the current item. It returns a tuple containing the index and the item at that index.

nums = ['apple', 'banana', 'cherry']

for i, num in enumerate(nums):
    print(i, num)

"""
Output:
0 apple
1 banana
2 cherry
"""

Divmod

The divmod() function returns a tuple containing the quotient and the remainder when dividing two numbers.

quotient, remainder = divmod(10, 3)
print(quotient, remainder)

"""
Output:
3 1
"""

Any and All

The any() function returns True if any of the elements in the iterable are True, and False otherwise. The all() function returns True if all of the elements in the iterable are True, and False otherwise.

nums = [1, 2, 3, 4, 5]
all(nums) # True
any(nums) # True

nums = [0, 0, 0, 0, 0]
all(nums) # False
any(nums) # False

nums = [1, 0, 0, 0, 0]
all(nums) # False
any(nums) # True

Strings

Data Structures

Sets

The set() function is used to create a set.

# Create an empty set
empty_set = set()

# Create a set with elements
fruits = set(['apple', 'banana', 'cherry', 'apple'])
print(fruits)

"""
Output:
{'apple', 'banana', 'cherry'}
"""
Back to Blog

Related Posts

View All Posts »

Dynamic Programming

Are you frustrated like me when you see a dynamic programming problem? This post will help you REALLY understand the concept of dynamic programming and how to solve problems using it.

Greedy Algorithm

Greedy algorithms are simple and intuitive. They make a series of choices, each of which is the best choice at the time, and they never look back. This post will help you understand the concept of greedy algorithms and how to solve problems using them.