README.md

Code Challenges

A new collection of my personal solutions to various code challenges.

Setup

This repo implements solutions in Python 3.10+. It's recommended to run and install dependencies from a virtual environment.

After cloning this repo, to install dev dependencies:

make dev

Testing

Tests are setup to run with Pythons builtin unittest library.

make test

Linting

If all is configured correctly linting should happen automatically in the dev container. Future work will include a make recipe.

• Autoformating is handled with black
• Linting by pylint
• Import arrangment by isort

Challenges

Code Wars

• • Challenge: Stargate SG-1: Cute and Fuzzy
  • Location: ./src/code_wars/sg1.py
  • Strategy: Create a graph and use a breadth first search to find a possible route.
  • Resources:
  • • Breadth-first_search
    • Dijkstra's_algorithm
• • Challenge: Next bigger number with the same digits
  • Location: ./src/code_wars/next_bigger_number.py
  • Strategy:
    1. Moving from right to left find first number with a larger number to the right.
    2. Next find the smallest number to the right of this number that is also large than this number.
    3. Then switch these two numbers.
    4. Sort all the numbers to the right of the left number.
• • Challenge: Switch the Bulb--Play game Series #10
  • Location: ./src/code_wars/switch_the_bulbs.py
  • Strategy: Create a graph and use a depth first search to find a possible route.
  • Resources:
  • • Depth-first_search
    • Dijkstra's_algorithm
    • Travelling_salesman_problem
• • Challenge: Range Extraction
  • Location: ./src/code_wars/range_extraction.py

Codecademy

• • Challenge: The Knapsack Problem
  • Location: ./src/codecademy/the_knapsack_problem.py
  • Resources:
  • • Wikipedia - Dynamic Programming
    • Wikipedia - Knapsack Problem
    • Geeks for Geeks - Dynamic Programming
    • Grokking Algorithms: An Illustrated Guide for Programmers and Other Curious People, Chapter 9

LeetCode

• • Challenge: zigzag-conversion
  • Location: [./src/code_wars/zigzag_conversion.py](./src/leet code/zigzag_conversion.py)
• • Challenge: Min Window Substring
  • Location: ./src/leet_code/min_window_substring.py

edabit

• • Challenge: Minesweeper I — Grid
  • Location: ./src/edabit/minesweeper_i_grid.py
• • Challenge: Longest Alternating Substring
  • Location: ./src/edabit/longest_alternating_substring.py

Notes

• The union | operator to merge dictionaries returning a new was introduced in Python 3.10
• The walrus := operator was introduced in Python 3.8.

Resources

• PEP 8 – Style Guide for Python Code