xevion/contest
1
0
Fork 0
mirror of https://github.com/Xevion/contest.git synced 2025-12-06 03:14:40 -06:00
Code Issues Packages Projects Releases Wiki Activity

test 01 question 37 HashSet.add boolean return value and modulus

Browse Source
This commit is contained in:
Xevion
2019-10-31 03:57:25 -05:00
parent 4a12a148b4
commit bcc6b23173
1 changed files with 4 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
uil/uil-practice-armstrong/test-1/EXPLANATIOn.md
View File

@@ -573,6 +573,10 @@ With this, one can easily build the list from the inside out with each method ca
## Question 37
This question requires one to remember that `HashSet.add(E e)` returns a `boolean`, `true` when the element was inserted into the HashSet, and `false` when the element was already in it.
The for-loop will run 34 times (`[1, 35)`), and thus, with the modulus, it will return true 7 times (important to note, the for-loop's range is very important, but here, it's simple). So, given 34 total iterations, and 7 successful insertions, there will be 27 failed insertions (`34 - 7 = 27`).
## Question 38
## Question 39