Joined
Last Seen
0 Reputation Points
Unknown Quality Score
No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
0 Endorsements
Ranked #55.1K
~660 People Reached
This member's community profile is only visible to logged in members until they have earned 15 reputation points.
Favorite Forums
Favorite Tags
2 Posted Topics
def get_inverse_dict(): """ returns a dictionary which maps a -> z, b->y ... z->a Hint: 1. see the constants in the string module, and the zip builtin function. 2. google lookup extended slicing notation to create a z..a string from a..z string In shell: help(zip) and experiment using zip in …
In the brute force pattern matching algorithm when all the characters in the pattern are unique then brute force can be implemented in Big-oh(n) complexity where n is the length of the string (reference: introduction to algorithms). can anyone help me with the algorithm? Thanks in advance
The End.