# Indexing a list in Python
# Example list
fruits = ["apple", "banana", "cherry", "date"]
# Accessing elements by index
first_fruit = fruits[0] # "apple"
second_fruit = fruits[1] # "banana"
last_fruit = fruits[-1] # "date"
# Slicing a list
some_fruits = fruits[1:3] # ["banana", "cherry"]
print(first_fruit) # Output: apple
print(second_fruit) # Output: banana
print(last_fruit) # Output: date
print(some_fruits) # Output: ['banana', 'cherry']
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?