Calculate all combinations of K items selected from a set of size N
Calculate all combinations of k items taken from a set of n elements is not difficult with the proposed recursive and iterative methods.
Book Scanning: Google Hash Code Problem description
This article contains a short description of the problem proposed for the Google Hash Code Online Qualification process on Feb 20th, 2020
“More pizza” problem algorithm description
The description of the algorithm used to get maximum score. Above all, this is the algorithm I suggest to use for the Google Hash Code Qualification Round.
“More Pizza” practice problem: solved with maximum score
This year, the Google Hash Code team has proposed a different version of the Pizza practice problem, entitled “More Pizza”. The challenge description – as usual – is available for all users registered to the Google Hash Code judge system. Please, let me briefly describe the proposed problem.
Pizza problem – Solved Google Hashcode practice test
Solved the pizza practice problem to get ready for the Google Hashcode qualification process.