Following several days dedicated to probability distributions, the statistics tutorial then changes tack, and turns to correlation coefficients. A correlation coefficient is a measure of how in accordance two random variables are. The values (sic) of maximum correlation are 1 and -1, meaning that the variables are fully related: when one variable changes in one …
Days 4 and 5 of the Statistics 10-day challenge (HackerRank) were dedicated to specific probability distributions. Day 6 builds on this, particularly on the normal distribution, and is dedicated to the Central Limit Theorem (CLT). This is the main reason why the normal distribution is so widely used. That is because it shows that this …
In my last post about HackerRank, I left you with a cliffhanger: I covered the approach strategy, showing how to apply distribution functions to solve specific questions about the probability of a certain event. The resulting code was very short and high-level, usually with a single line of code to obtain the desired result. That …
HackerRank Days 4 and 5: Probability Distributions Read More »
This post focuses on days 4 and 5 of the “10 Days of Statistics” path in HackerRank, because they are very similar. All tasks can be broken in two parts: Compute the probability function for a certain probability distribution Apply the probability distribution to solve a problem. Personally, I prefer the second type of question, …
On this post, I go on with my trail through the HackerRank series “10 Days of Statistics”. After two days dedicated to Probabilities, Day 4 starts a long subseries dedicated to statistical distributions that lasts until Day 6. And this is a return to Python programming. A Statistical Distribution is a model that tries to …
HackerRank Statistics Day 4: Binomial Distribution Read More »
Day 3 of the Statistics Tutorial in HackerRank was again devoted to Statistics. In general, I felt the exercises on this day were a bit weak, in that they did not require most of the material covered in the tutorials and that they could be solved more easily by other means. The first problem was …
HackerRank Statistics Day 3: Yet More Probabilities Read More »
There is a class of probability problems that I often see students struggling with. I think of them as having a trapdoor that makes them easy, but without finding it, such problems become hard and tedious. These are often associated with questions that involve some inequality. Anyone trying to solve these should be immediately tipped …
In this post I solved three probability questions using the basic principle of discrete probability: find the ratio of favourable to total cases. The first 2 examples were very simple, but the third involved a few different steps. The counting strategy works, and is probably the simplest way to solve that problem. But there are …
Hello all, I’m back after a longer hiatus than I intended. After Easter, some things happened that took a good deal of my time and I was unable to carry on with my posts. But I’m back today to my series on HackerRank’s “10 Days of Statistics”. The first purpose of these posts is to …
In this post, I return to my series explaining solutions to the “10 Days of Statistics” tutorial on Hackerrank. Day 0 was dedicated to basic definitions, and has been covered here and here, and suggested this diversion on functional programming. Day 1 had two sets of problems: the first about quartiles and the second about …
