Thanks to some help from people here, I was able to get my code for Tasmanian camels puzzle working. However, it is horribly slow (I think. I’m not sure because this is my first program in Python). The example run in the bottom of the code takes a long time to be solved in my machine:
I’d like to compare 2 strings and keep the matched, splitting off where the comparison fails.
I am working on a problem out of CTCI.
What is the complexity of the in operator in Python? Is it theta(n)?
What’s the time complexity of slicing a Python string? Given that Python strings are immutable, I can imagine slicing them being either O(1) or O(n) depending upon how slicing is implemented.
I’m analysing the complexity of my code. From what I found online, since strings are immutable in python, a concatenation of a string and a character should be O(len(string) + 1). Now, here is my piece of code (simplified): word = "" for i in range(m): word = char_value + word return word The total … Read more
As seen in the documentation for TimeComplexity, Python’s list type is implemented is using an array.
What is the complexity of the function most_common provided by the collections.Counter object in Python?