<commit_before><commit_msg>Create Solution.md<commit_after># StudentSolution
- What did you learn?
    -  I leared to more carefully review my variabl iniitalizations. I accidentally set my middle to (left-right + 1) instead of (right - left +1).  Index out of bounds exeptions for hours befor i finally found it.  This one was tough.  I dig my solution though, my final code is much tighter and more readable than any examples I found online.
- Where did you look?
    - We refined our solution using this resource:https://gist.github.com/pmgeorg/9122984
- Did you write anything down, bookmark anything that looked useful?
    - We drew out arrays and stepped through them step by step to hammer down the basic logic of recursively dividing the array into its smallest possible components.  This one was really hard to visualize due to its complex call stack, but I began to understand it more and more as we stepped through the algorithm.
- What did you use as a guideline or direction during the challenge?
    - My experience with the data structure, my classmates, and the above link.  The code from our external source is commented clearly in my solution.
{'fraction_non_alphanumeric': 0.043029259896729774, 'fraction_numerical': 0.00774526678141136, 'mean_word_length': 3.948936170212766, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 1, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '879841', 'n_tokens_mistral': 288, 'n_tokens_neox': 273, 'n_words': 177}