data-structures-and-algorithms

401 data structures and algorithms code challenges

---

Project maintained by alsosteve Hosted on GitHub Pages — Theme by mattgraham

Data Structures and Algorithms

Language: Python

Hashmap: Repeated Word

Feature Tasks

Challenge Type: Code Challenge / Algorithm

Method:

• Write a function called repeated word that finds the first word to occur more than once in a string
• Arguments: string
• Return: string

Whiteboard Process

Examples

| Input | Output | |—|—| | “Once upon a time, there was a brave princess who…” | “a” | | “It was the best of times, it was the worst of times, it was the age of wisdom, it was the age of foolishness, it was the epoch of belief, it was the epoch of incredulity, it was the season of Light, it was the season of Darkness, it was the spring of hope, it was the winter of despair, we had everything before us, we had nothing before us, we were all going direct to Heaven, we were all going direct the other way – in short, the period was so far like the present period, that some of its noisiest authorities insisted on its being received, for good or for evil, in the superlative degree of comparison only…” | “it” | | “It was a queer, sultry summer, the summer they electrocuted the Rosenbergs, and I didn’t know what I was doing in New York…” | “summer” |

Unit Tests

• empty string
• no repeats
• one repeat
• multiple repeats
• case specific
• punctuation

Stretch Goal

• Modify your function to return a count of each of the words in the provided string
• Modify your function to return a list of the words most frequently used in the provided string

Approach & Efficiency

I made a copy of the get methof and tweaked it to return the repeated key instead of adding to the bucket.