Code Callenges

Code Wars

Most Digits (7th kyu)

• Module: most_digits.py
• Tests: test_most_digits.py
• URL: challenge url

Complementary DNA (7 kyu)

• Module: complementary_dna.py
• Tests: test_complementary_dna.py
• URL: challenge url

Counting Duplicates (6 kyu)

• Module: counting_duplicates.py
• Tests: test_counting_duplicates.py
• URL: challenge url

First non-repeating letter (5 kyu)

• Module: first_non_repeating_letter.py
• Tests: test_first_non_repeating_letter.py
• URL: challenge url

Count the smiley faces! (6 kyu)

• Module: count_the_smiley_faces.py
• Tests: test_count_the_smiley_faces.py
• URL: challenge url

Split Strings (6 kyu)

• Module: split_strings.py
• Tests: test_split_strings.py
• URL: challenge url

Sort deck of cards (7 kyu)

• Module: sort_cards.py
• Tests: test_sort_cards.py
• URL: challenge url

String Pyramid (6 kyu)

• Module: string_pyramid.py
• Tests: test_string_pyramid.py
• URL: challenge url

Pyramid Slide Down (4 kyu)

• Module: pyramid_slide_down.py
• Tests: test_pyramid_slide_down.py
• URL: challenge url

Snail (4 kyu)

• Module: snail.py
• Tests: test_snail.py
• URL: challenge url

On Codewars

URL W-Ely's Complete Solutions

Leetcode

1. Two Sum

• Module: two_sum.py
• Tests: test_two_sum.py
• URL: challenge url

3. Longest Substring Without Repeating Characters

• Module: longest_substring.py
• Tests: test_longest_substring.py
• URL: challenge url

42. Trapping Rain Water

• Module: rain_water.py
• Tests: test_rain_water.py
• URL: challenge url

126. Word Ladder II

Works, but not optimized enough to pass their tests.

• Module: word_ladder.py
• Tests: test_word_ladder.py
• URL: challenge url
• Creative solution shenjie1993

Other Challenges

Properm Parentetics

• Module: parentetics.py
• Tests: test_parentetics.py
• URL: https://codefellows.github.io

The Forbes Top 40

• Module: forbes.py
• Tests: test_forbes.py
• URL: https://codefellows.github.io

Autocomplete

• Modules: autocomplete.py, trie.py

• Tests: test_autocomplete.py, test_trie.py

• URL: https://codefellows.github.io

• The class should be based in some way on a trie tree. The class should take a list of words to be a vocabulary as an argument on initialization. It should also accept a max_completions argument, which controls the maximum number of suggested completions for a given string. The max_completions argument should default to 5.

• The input to the call method for the class will be the string the user has typed. When called, this class should return a list of at most max_completions suggested words. If there are more available completions than allowed, it decides which to return. If there are no completions available, it should return an empty list. The class should handle inappropriate inputs correctly.