# HackerRank – Shashank and List

Problem Shashank and List is a math problem that asks for computing the sum $P = \sum_{i=1}^{2^N-1} 2^{S_i}$, where $S_i$ is the sum of all the elements of the $i^{th}$ non-empty sublist of a list A of $N$ elements. Since this value can be huge, we need to report $P \% (10^9+7)$ instead.

# HackerRank Week of Code 19 (Part II)

Problem Scalar Products from HackerRank’s Week of Code 19 was quite an interesting one to solve. Despite being labelled “Difficult”, there were more accepted answers than in the previous problem Two Robots, which was supposedly easier to solve.