<commit_before># Yantra-Tantra(ಯಂತ್ರ-ತಂತ್ರ )
An attempt to learn, explore and experiment with Machine Learning Algorithms. 
<commit_msg>updating readme with problem statement<commit_after># Yantra-Tantra(ಯಂತ್ರ-ತಂತ್ರ )
An attempt to learn, explore and experiment with Machine Learning Algorithms. 

###Problem 1: Warmup Stats
Given an array of N integers separated by spaces, all in one line.

Display the following:

Mean (m): The average of all the integers.

Median of this array: In case, the number of integers is odd, the middle element; else, the average of the middle two elements.

Mode: The element(s) which occurs most frequently. If multiple elements satisfy this criteria, display the numerically smallest one.

Standard Deviation (SD).

SD = (((x1-m)2+(x2-m)2+(x3-m)2+(x4-m)2+...(xN-m)2))/N)0.5

where xi is the ith element of the array

Lower and Upper Boundary of the 95% Confidence Interval for the mean, separated by a space.
{'fraction_non_alphanumeric': 0.09235668789808917, 'fraction_numerical': 0.014861995753715499, 'mean_word_length': 4.680722891566265, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, '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': '5463054', 'n_tokens_mistral': 305, 'n_tokens_neox': 311, 'n_words': 129}