Computer scienceProgramming languagesPythonAdditional instrumentsAlgorithms and data structures

Index() and in under the hood

Time complexity

Report a typo

You keep the poem you wrote in a string. But you are not sure whether your poem contains certain words or not. You want to check the existence of these words using the in operator. What would be the time complexity of this program?

Select one option from the list

O(n)

O(log(n))

O(1)

O(n^2)

___

Create a free account to access the full topic