<commit_before># Calculate the mode Pairing Challenge

# I worked on this challenge [by myself, with: ]

# I spent [] hours on this challenge.

# Complete each step below according to the challenge directions and
# include it in this file. Also make sure everything that isn't code
# is commented.



# 0. Pseudocode
# What is the input?
  # Array of numbers or strings
# What is the output? (i.e. What should the code return?)
  # most frequently occurring values, in form of array
# What are the steps needed to solve the problem?
  # Create container (the hash)
  # Assign elements of the array as keys in the hash
  # Assign values based on frequency
  # Determine largest value(s)
  # Return key(s) correspoding to largest value in form of an array<commit_msg>Edit solution<commit_after># Calculate the mode Pairing Challenge

# I worked on this challenge [with: <NAME>]

# I spent [1] hours on this challenge.

# Complete each step below according to the challenge directions and
# include it in this file. Also make sure everything that isn't code
# is commented.



# 0. Pseudocode
# What is the input?
  # Array of numbers or strings
# What is the output? (i.e. What should the code return?)
  # most frequently occurring values, in form of array
# What are the steps needed to solve the problem?
  # Create container (the hash)
  # Assign elements of the array as keys in the hash
  # Assign values based on frequency
  # Determine largest value(s)
  # Return key(s) correspoding to largest value in form of an array
{'fraction_non_alphanumeric': 0.06094364351245085, 'fraction_numerical': 0.001965923984272608, 'mean_word_length': 3.8322784810126582, 'pattern_counts': {'":': 0, '<': 4, '<?xml version=': 0, '>': 4, 'https://': 0, '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': '4807074', 'n_tokens_mistral': 422, 'n_tokens_neox': 402, 'n_words': 230}