<p align="center"> <a href="https://www.hackerrank.com/gabrielgiordano"> <img alt="HackerRank" src="https://raw.githubusercontent.com/gabrielgiordan/HackerRank/master/hacker-rank-logo.png"> </a> </p> <p align="center"> <img alt="Solutions" src="https://img.shields.io/badge/Solutions-95-brightgreen.svg?longCache=true&style=for-the-badge"> <img alt="Languages" src="https://img.shields.io/badge/Languages-JavaScript-brightgreen.svg?longCache=true&style=for-the-badge"> <img alt="NodeJS Version" src="https://img.shields.io/node/v/carbon.svg?style=for-the-badge"> </p> <p align="center"> Efficient HackerRank solutions in JavaScript programmed by <a alt="HackerRank Profile" href="https://www.hackerrank.com/gabrielgiordano" >Gabriel Giordano</a> </p>

10 Days of Statistics

| | Day | Problem | Solution | Difficulty | Points | Note | |-- |:---:|:---------------:|:--------:|:----------:|:------:|:----:| | ⭐ | 9 |Multiple Linear Regression (Last day)| JavaScript | Medium | 30 | Implementation of a research from Ahmad Farooq and Khan Hamid, from C to JavaScript with some custom modifications | | | 8 |Least Square Regression Line| JavaScript | Easy | 30 | | | | 7 |Spearman's Rank Correlation Coefficient| JavaScript | Easy | 30 | | | | 7 |Pearson Correlation Coefficient I| JavaScript | Easy | 30 | | | | 6 |The Central Limit Theorem III| JavaScript | Easy | 30 | | | | 6 |The Central Limit Theorem II| JavaScript | Easy | 30 | | | | 6 |The Central Limit Theorem I| JavaScript | Easy | 30 | | | | 5 |Normal Distribution II| JavaScript | Easy | 30 | | | | 5 |Normal Distribution I| JavaScript | Easy | 30 | | | | 5 |Poison Distribution II| JavaScript | Easy | 30 | | | | 5 |Poison Distribution I| JavaScript | Easy | 30 | | | | 4 |Geometric Distribution II| JavaScript | Easy | 30 | | | | 4 |Geometric Distribution I| JavaScript | Easy | 30 | | | | 4 |Binomial Distribution II| JavaScript | Easy | 30 | | | | 4 |Binomial Distribution I| JavaScript | Easy | 30 | | | | 2 |Compound Event Probability| JavaScript | | | | | | 2 |More Dice| JavaScript | | | | | | 2 |Basic Probability| JavaScript | | | | | | 1 |Standard Deviation| JavaScript | Easy | 30 | | | | 1 |Interquartile Range| JavaScript | Easy | 30 | | | | 1 |Quartiles| JavaScript | Easy | 30 | | | | 0 |Weighted Mean| JavaScript | Easy | 30 | | | | 0 | Mean, Median, and Mode| JavaScript | Easy | 30 | |

---

Algorithms

Implementation

| | Problem | Solution | Difficulty | Points | Note | |-- |:---------------:|:--------:|:----------:|:------:|:----:| | ⭐ |Matrix Layer Rotation| JavaScript | Hard | 80 | Math solution to the problem, O(1) if the loop to print the result isn't considered, otherwise O(m*n) | | ⭐ |ACM ICPC Team| JavaScript | Easy | 25 | Using bitwise operations, and a custom Hamming Weight implementation to count ones, because the HackerRank's v8 version hasn't yet a BigInt implementation. Best case O(n^2) where n is the topics length | | ⭐ |Queen's Attack II| JavaScript | Medium | 30 | Math solution to the problem, O(k), where k is the number of obstacles | | ⭐ |Modified Kaprekar Numbers| JavaScript | Easy | 30 | Math and very performatic solution, without using Strings nor brute force, O(n), where n = q - p | | |Equalize the Array| JavaScript | Easy | 20 | O(n) | | ⭐ |Jumping on the Clouds| JavaScript | Easy | 20 | O(log n) | | ⭐ |Repeated String| JavaScript | Easy | 20 | The algorithm doesn't count the string a second time, both best and worst case is O(n) where n is the length of the string | | |Lisa's Workbook| JavaScript | Easy | 25 | | | |Bigger is Greater| JavaScript | Medium | 35 | | | |Organizing Containers of Balls| JavaScript | Medium | 30 | | | |The Time in Words| JavaScript | Medium | 25 | O(1) | | |Beautiful Triplets| JavaScript | Easy | 20 | O(n) | | |Minimum Distances| JavaScript | Easy | 20 | O(n) | | |Halloween Sale| JavaScript | Easy | 20 | O(1) | | |Non-Divisible Subset| JavaScript | Medium | 20 | | | |Cut the Sticks| JavaScript | Easy | 25 | | | |Library Fine| JavaScript | Easy | 15 | O(1) | | |Sherlock and Squares| JavaScript | Easy | 20 | O(1) | | |Append and Delete| JavaScript | Easy | 20 | O(min(s, t)) | | |Extra Long Factorials| JavaScript | Medium | 20 | | | |Service Lane| JavaScript | Easy | 20 | | | |Chocolate Feast| JavaScript | Easy | 25 | O(1) | | |Find Digits| [JavaScr