hackerrank

KO | EN

gitlite — search

#ai #typescript #llm #golang #android #linux #docker #nodejs #windows #awesome #cli #security #openai #open-source

(★ 228)

Efficient HackerRank solutions in JavaScript (⬡.js)

File Explorer

Download Latest Version (.zip)

- s10-basic-statistics.js
- s10-binomial-distribution-1.js
- s10-binomial-distribution-2.js
- s10-geometric-distribution-1.js
- s10-geometric-distribution-2.js
- s10-interquartile-range.js
- s10-least-square-regression-line.js
- s10-mcq-1.js
- s10-mcq-2.js
- s10-mcq-3.js
- s10-multiple-linear-regression.js
- s10-normal-distribution-1.js
- s10-normal-distribution-2.js
- s10-pearson-correlation-coefficient.js
- s10-poisson-distribution-1.js
- s10-poisson-distribution-2.js
- s10-quartiles.js
- s10-spearman-rank-correlation-coefficient.js
- s10-standard-deviation.js
- s10-the-central-limit-theorem-1.js
- s10-the-central-limit-theorem-2.js
- s10-the-central-limit-theorem-3.js
- s10-weighted-mean.js
- - new-year-chaos.js
- - arrays-ds.js
  - crush.js
  - dynamic-array.js
  - sparse-arrays.js
- - 3d-surface-area.js
  - absolute-permutation.js
  - acm-icpc-team.js
  - angry-professor.js
  - append-and-delete.js
  - apple-and-orange.js
  - beautiful-days-at-the-movies.js
  - beautiful-triplets.js
  - between-two-sets.js
  - bigger-is-greater.js
  - bon-appetit.js
  - breaking-best-and-worst-records.js
  - cats-and-a-mouse.js
  - chocolate-feast.js
  - circular-array-rotation.js
  - climbing-the-leaderboard.js
  - counting-valleys.js
  - cut-the-sticks.js
  - day-of-the-programmer.js
  - designer-pdf-viewer.js
  - divisible-sum-pairs.js
  - drawing-book.js
  - electronics-shop.js
  - equality-in-a-array.js
  - extra-long-factorials.js
  - fair-rations.js
  - find-digits.js
  - flatland-space-stations.js
  - grading.js
  - halloween-sale.js
  - jumping-on-the-clouds-revisited.js
  - jumping-on-the-clouds.js
  - kangaroo.js
  - kaprekar-numbers.js
  - library-fine.js
  - lisa-workbook.js
  - magic-square-forming.js
  - matrix-rotation-algo.js
  - migratory-birds.js
  - minimum-distances.js
  - non-divisible-subset.js
  - organizing-containers-of-balls.js
  - permutation-equation.js
  - picking-numbers.js
  - queens-attack-2.js
  - repeated-string.js
  - save-the-prisoner.js
  - service-lane.js
  - sherlock-and-squares.js
  - sock-merchant.js
  - strange-advertising.js
  - the-birthday-bar.js
  - the-grid-search.js
  - the-hurdle-race.js
  - the-time-in-words.js
  - utopian-tree.js
- - insertionsort2.js
- - a-very-big-sum.js
  - birthday-cake-candles.js
  - compare-the-triplets.js
  - diagonal-difference.js
  - mini-max-sum.js
  - plus-minus.js
  - staircase.js
  - time-conversion.js
- 2d-array.js
- ctci-array-left-rotation.js
- minimum-swaps-2.js
- sherlock-and-anagrams.js
- two-strings.js
- find-point.js
- game-with-cells.js
- handshake.js
- lowest-triangle.js
- maximum-draws.js
.gitignore
hacker-rank-logo.png
README.md

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

<a href="https://www.hackerrank.com/gabrielgiordano">
 <img alt="HackerRank" src="https://raw.githubusercontent.com/gabrielgiordan/HackerRank/master/hacker-rank-logo.png">
 </a>


 <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">


 Efficient HackerRank solutions in JavaScript programmed by <a alt="HackerRank Profile" href="https://www.hackerrank.com/gabrielgiordano" >Gabriel Giordano</a>

# 10 Days of Statistics
|   | Day | Problem         | Solution | Difficulty | Points | Note |
|-- |:---:|:---------------:|:--------:|:----------:|:------:|:----:|
| ⭐ | 9 |[Multiple Linear Regression (Last day)](https://www.hackerrank.com/challenges/s10-multiple-linear-regression/problem)| [JavaScript](10-days-of-statistics/s10-multiple-linear-regression.js) | 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](https://www.hackerrank.com/challenges/s10-least-square-regression-line/problem)| [JavaScript](10-days-of-statistics/s10-least-square-regression-line.js) | Easy | 30 | |
| | 7 |[Spearman's Rank Correlation Coefficient](https://www.hackerrank.com/challenges/s10-spearman-rank-correlation-coefficient/problem)| [JavaScript](10-days-of-statistics/s10-spearman-rank-correlation-coefficient.js) | Easy | 30 | |
| | 7 |[Pearson Correlation Coefficient I](https://www.hackerrank.com/challenges/s10-pearson-correlation-coefficient/problem)| [JavaScript](10-days-of-statistics/s10-pearson-correlation-coefficient.js) | Easy | 30 | |
| | 6 |[The Central Limit Theorem III](https://www.hackerrank.com/challenges/s10-the-central-limit-theorem-3/problem)| [JavaScript](10-days-of-statistics/s10-the-central-limit-theorem-3.js) | Easy | 30 | |
| | 6 |[The Central Limit Theorem II](https://www.hackerrank.com/challenges/s10-the-central-limit-theorem-2/problem)| [JavaScript](10-days-of-statistics/s10-the-central-limit-theorem-2.js) | Easy | 30 | |
| | 6 |[The Central Limit Theorem I](https://www.hackerrank.com/challenges/s10-the-central-limit-theorem-1/problem)| [JavaScript](10-days-of-statistics/s10-the-central-limit-theorem-1.js) | Easy | 30 | |
| | 5 |[Normal Distribution II](https://www.hackerrank.com/challenges/s10-normal-distribution-2/problem)| [JavaScript](10-days-of-statistics/s10-normal-distribution-2.js) | Easy | 30 | |
| | 5 |[Normal Distribution I](https://www.hackerrank.com/challenges/s10-normal-distribution-1/problem)| [JavaScript](10-days-of-statistics/s10-normal-distribution-1.js) | Easy | 30 | |
| | 5 |[Poison Distribution II](https://www.hackerrank.com/challenges/s10-poisson-distribution-2/problem)| [JavaScript](10-days-of-statistics/s10-poisson-distribution-2.js) | Easy | 30 | |
| | 5 |[Poison Distribution I](https://www.hackerrank.com/challenges/s10-poisson-distribution-1/problem)| [JavaScript](10-days-of-statistics/s10-poisson-distribution-1.js) | Easy | 30 | |
| | 4 |[Geometric Distribution II](https://www.hackerrank.com/challenges/s10-geometric-distribution-2/problem)| [JavaScript](10-days-of-statistics/s10-geometric-distribution-2.js) | Easy | 30 | |
| | 4 |[Geometric Distribution I](https://www.hackerrank.com/challenges/s10-geometric-distribution-1/problem)| [JavaScript](10-days-of-statistics/s10-geometric-distribution-1.js) | Easy | 30 | |
| | 4 |[Binomial Distribution II](https://www.hackerrank.com/challenges/s10-binomial-distribution-2/problem)| [JavaScript](10-days-of-statistics/s10-binomial-distribution-2.js) | Easy | 30 | |
| | 4 |[Binomial Distribution I](https://www.hackerrank.com/challenges/s10-binomial-distribution-1/problem)| [JavaScript](10-days-of-statistics/s10-binomial-distribution-1.js) | Easy | 30 | |
| | 2 |[Compound Event Probability](https://www.hackerrank.com/challenges/s10-mcq-3/problem)| [JavaScript](10-days-of-statistics/s10-mcq-3.js) | | | |
| | 2 |[More Dice](https://www.hackerrank.com/challenges/s10-mcq-2/problem)| [JavaScript](10-days-of-statistics/s10-mcq-2.js) | | | |
| | 2 |[Basic Probability](https://www.hackerrank.com/challenges/s10-mcq-1/problem)| [JavaScript](10-days-of-statistics/s10-mcq-1.js) |  | | |
| | 1 |[Standard Deviation](https://www.hackerrank.com/challenges/s10-standard-deviation/problem)| [JavaScript](10-days-of-statistics/s10-standard-deviation.js) | Easy | 30 | |
| | 1 |[Interquartile Range](https://www.hackerrank.com/challenges/s10-interquartile-range/problem)| [JavaScript](10-days-of-statistics/s10-interquartile-range.js) | Easy | 30 | |
| | 1 |[Quartiles](https://www.hackerrank.com/challenges/s10-quartiles.js/problem)| [JavaScript](10-days-of-statistics/s10-quartiles.js) | Easy | 30 | |
| | 0 |[Weighted Mean](https://www.hackerrank.com/challenges/s10-weighted-mean/problem)| [JavaScript](10-days-of-statistics/s10-weighted-mean.js) | Easy | 30 | |
| | 0 |[ Mean, Median, and Mode](https://www.hackerrank.com/challenges/s10-basic-statistics/problem)| [JavaScript](10-days-of-statistics/s10-basic-statistics.js) | Easy | 30 | |

---

# Algorithms

## Implementation
|   | Problem         | Solution | Difficulty | Points | Note |
|-- |:---------------:|:--------:|:----------:|:------:|:----:|
| ⭐ |[Matrix Layer Rotation](https://www.hackerrank.com/challenges/matrix-rotation-algo/problem)| [JavaScript](algorithms/implementation/matrix-rotation-algo.js) | 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](https://www.hackerrank.com/challenges/acm-icpc-team/problem)| [JavaScript](algorithms/implementation/acm-icpc-team.js) | 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](https://www.hackerrank.com/challenges/queens-attack-2/problem)| [JavaScript](algorithms/implementation/queens-attack-2.js) | Medium | 30 | Math solution to the problem, _O(k)_, where _k_ is the number of obstacles |
| ⭐ |[Modified Kaprekar Numbers](https://www.hackerrank.com/challenges/kaprekar-numbers/problem)| [JavaScript](algorithms/implementation/kaprekar-numbers.js) | Easy | 30 | Math and very performatic solution, without using Strings nor brute force, _O(n)_, where n = q - p |
| |[Equalize the Array](https://www.hackerrank.com/challenges/equality-in-a-array/problem)| [JavaScript](algorithms/implementation/equality-in-a-array.js) | Easy | 20 | _O(n)_ |
| ⭐ |[Jumping on the Clouds](https://www.hackerrank.com/challenges/jumping-on-the-clouds/problem)| [JavaScript](algorithms/implementation/jumping-on-the-clouds.js) | Easy | 20 | _O(log n)_ |
| ⭐ |[Repeated String](https://www.hackerrank.com/challenges/repeated-string/problem)| [JavaScript](algorithms/implementation/repeated-string.js) | 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](https://www.hackerrank.com/challenges/lisa-workbook/problem)| [JavaScript](algorithms/implementation/lisa-workbook.js) | Easy | 25 |  |
|  |[Bigger is Greater](https://www.hackerrank.com/challenges/bigger-is-greater/problem)| [JavaScript](algorithms/implementation/bigger-is-greater.js) | Medium | 35 |  |
|  |[Organizing Containers of Balls](https://www.hackerrank.com/challenges/organizing-containers-of-balls/problem)| [JavaScript](algorithms/implementation/organizing-containers-of-balls.js) | Medium | 30 |  |
|  |[The Time in Words](https://www.hackerrank.com/challenges/the-time-in-words/problem)| [JavaScript](algorithms/implementation/the-time-in-words.js) | Medium | 25 | _O(1)_ |
|  |[Beautiful Triplets](https://www.hackerrank.com/challenges/beautiful-triplets/problem)| [JavaScript](algorithms/implementation/beautiful-triplets.js) | Easy | 20 | _O(n)_ |
|  |[Minimum Distances](https://www.hackerrank.com/challenges/minimum-distances/problem)| [JavaScript](algorithms/implementation/minimum-distances.js) | Easy | 20 | _O(n)_ |
|  |[Halloween Sale](https://www.hackerrank.com/challenges/halloween-sale/problem)| [JavaScript](algorithms/implementation/halloween-sale.js) | Easy | 20 | _O(1)_ |
|  |[Non-Divisible Subset](https://www.hackerrank.com/challenges/non-divisible-subset/problem)| [JavaScript](algorithms/implementation/non-divisible-subset.js) | Medium | 20 |  |
|  |[Cut the Sticks](https://www.hackerrank.com/challenges/cut-the-sticks/problem)| [JavaScript](algorithms/implementation/cut-the-sticks.js) | Easy | 25 |  |
| |[Library Fine](https://www.hackerrank.com/challenges/library-fine/problem)| [JavaScript](algorithms/implementation/library-fine.js) | Easy | 15 | _O(1)_ |
| |[Sherlock and Squares](https://www.hackerrank.com/challenges/sherlock-and-squares/problem)| [JavaScript](algorithms/implementation/sherlock-and-squares.js) | Easy | 20 | _O(1)_ |
| |[Append and Delete](https://www.hackerrank.com/challenges/append-and-delete/problem)| [JavaScript](algorithms/implementation/append-and-delete.js) | Easy | 20 | _O(min(s, t))_ |
| |[Extra Long Factorials](https://www.hackerrank.com/challenges/extra-long-factorials/problem)| [JavaScript](algorithms/implementation/extra-long-factorials.js) | Medium | 20 |  |
| |[Service Lane](https://www.hackerrank.com/challenges/service-lane/problem)| [JavaScript](algorithms/implementation/service-lane.js) | Easy | 20 |  |
| |[Chocolate Feast](https://www.hackerrank.com/challenges/chocolate-feast/problem)| [JavaScript](algorithms/implementation/chocolate-feast.js) | Easy | 25 | _O(1)_ |
| |[Find Digits](https://www.hackerrank.com/challenges/find-digits/problem)| [JavaScript](algorithms/implementation/find-digits.js) | Easy | 25 | _O(n)_ |
| |[Jumping on the Clouds: Revisited](https://www.hackerrank.com/challenges/jumping-on-the-clouds-revisited/problem)| [JavaScript](algorithms/implementation/jumping-on-the-clouds-revisited.js) | Easy | 15 | _O(n / k)_ where _k_ is the number of jumps |
| |[Sequence Equation](https://www.hackerrank.com/challenges/jumping-on-the-clouds-revisited/problem)| [JavaScript](algorithms/implementation/permutation-equation.js) | Easy | 20 | |
| |[Circular Array Rotation](https://www.hackerrank.com/challenges/circular-array-rotation/problem)| [JavaScript](algorithms/implementation/circular-array-rotation.js) | Easy | 20 | |
| |[Save the Prisoner!](https://www.hackerrank.com/challenges/save-the-prisoner/problem)| [JavaScript](algorithms/implementation/save-the-prisoner.js) | Easy | 15 | _O(1)_ |
| ⭐ |[Viral Advertising](https://www.hackerrank.com/challenges/strange-advertising/problem)| [JavaScript](algorithms/implementation/strange-advertising.js) | Easy | 15 | Alternative way to solve it using this integer sequence formula: https://oeis.org/A061418 |
| |[Beautiful Days at the Movies](https://www.hackerrank.com/challenges/beautiful-days-at-the-movies/problem)| [JavaScript](algorithms/implementation/beautiful-days-at-the-movies.js) | Easy | 15 | _O(n)_ |
| |[Angry Professor](https://www.hackerrank.com/challenges/angry-professor/problem)| [JavaScript](algorithms/implementation/angry-professor.js) | Easy | 20 | _O(n)_ |
| |[Utopian Tree](https://www.hackerrank.com/challenges/utopian-tree/problem)| [JavaScript](algorithms/implementation/utopian-tree.js) | Easy | 20 | _O(1)_ |
| |[Designer PDF Viewer](https://www.hackerrank.com/challenges/designer-pdf-viewer/problem)| [JavaScript](algorithms/implementation/designer-pdf-viewer.js) | Easy | 20 | |
| |[The Hurdle Race](https://www.hackerrank.com/challenges/the-hurdle-race/problem)| [JavaScript](algorithms/implementation/the-hurdle-race.js) | Easy | 15 | _O(1)_ |
| |[Climbing the Leaderboard](https://www.hackerrank.com/challenges/climbing-the-leaderboard/problem)| [JavaScript](algorithms/implementation/climbing-the-leaderboard.js) | Medium | 20 | _O(n + log(m))_ |
| |[Picking Numbers](https://www.hackerrank.com/challenges/picking-numbers/problem)| [JavaScript](algorithms/implementation/picking-numbers.js) | Easy | 20 | _O(1)_ |
| ⭐ |[Forming a Magic Square](https://www.hackerrank.com/challenges/magic-square-forming/problem)| [JavaScript](algorithms/implementation/magic-square-forming.js) | Medium | 20 | Using Édouard Lucas general formula to generate all possible magic squares of order 3 |
| |[Cats and a Mouse](https://www.hackerrank.com/challenges/cats-and-a-mouse/problem)| [JavaScript](algorithms/implementation/cats-and-a-mouse.js) | Easy | 15 | _O(1)_ |
| |[Eletronics Shop](https://www.hackerrank.com/challenges/electronics-shop/problem)| [JavaScript](algorithms/implementation/electronics-shop.js) | Easy | 15 | |
| |[Counting Valleys](https://www.hackerrank.com/challenges/counting-valleys/problem)| [JavaScript](algorithms/implementation/counting-valleys.js) | Easy | 15 | _O(n)_ |
| |[Drawing Book](https://www.hackerrank.com/challenges/drawing-book/problem)| [JavaScript](algorithms/implementation/drawing-book.js) | Easy | 10 | _O(1)_ |
| |[Sock Merchant](https://www.hackerrank.com/challenges/sock-merchant/problem)| [JavaScript](algorithms/implementation/sock-merchant.js) | Easy | 10 | _O(1)_ |
| |[Bon Appétit](https://www.hackerrank.com/challenges/bon-appetit/problem)| [JavaScript](algorithms/implementation/bon-appetit.js) | Easy | 10 | _O(n)_ |
| |[Day of the Programmer](https://www.hackerrank.com/challenges/day-of-the-programmer/problem)| [JavaScript](algorithms/implementation/day-of-the-programmer.js) | Easy | 10 | _O(1)_ |
| |[Migratory Birds](https://www.hackerrank.com/challenges/migratory-birds/problem)| [JavaScript](algorithms/implementation/migratory-birds.js) | Easy | 10 | |
| |[Divisible Sum Pairs](https://www.hackerrank.com/challenges/divisible-sum-pairs/problem)| [JavaScript](algorithms/implementation/divisible-sum-pairs.js) | Easy | 10 | |
| |[Birthday Chocolate](https://www.hackerrank.com/challenges/the-birthday-bar/problem)| [JavaScript](algorithms/implementation/the-birthday-bar.js) | Easy | 10 | ||
| |[Breaking the Records](https://www.hackerrank.com/challenges/breaking-best-and-worst-records/problem)| [JavaScript](algorithms/implementation/breaking-best-and-worst-records.js) | Easy | 10 | _O(n)_ |
| |[Between Two Sets](https://www.hackerrank.com/challenges/between-two-sets/problem)| [JavaScript](algorithms/implementation/between-two-sets.js) | Easy | 10 | Using Euclid's division algorithm for greatest common divisor |
| |[Kangaroo](https://www.hackerrank.com/challenges/kangaroo/problem)| [JavaScript](algorithms/implementation/kangaroo.js) | Easy | 10 |  |
| |[Apple and Orange](https://www.hackerrank.com/challenges/apple-and-orange/problem)| [JavaScript](algorithms/implementation/apple-and-orange.js) | Easy | 10 | |
| |[Grading Students](https://www.hackerrank.com/challenges/grading/problem)| [JavaScript](algorithms/implementation/grading.js) | Easy | 10 |  |

## Constructive Algorithms
|   | Problem         | Solution | Difficulty | Points | Note |
|-- |:---------------:|:--------:|:----------:|:------:|:----:|
|  |[New Year Chaos](https://www.hackerrank.com/challenges/new-year-chaos/problem)| [JavaScript](algorithms/constructive-algorithms/new-year-chaos.js) | Medium | 40 | |

---

# Mathematics

---

# Interview Preparation Kit

hackerrank

File Explorer

Today's picks

Was this content helpful?

Recent Feedback

hackerrank

File Explorer

Today's picks

Was this content helpful?

Recent Feedback

Download README