June 11

Reporting period

Successful

Period status:

Success

User report:

Success

Referee User report:

Reports for this period:

Eagle2020

13 Jun 2021 03:57 am - Referee approval report

Good

jzhang45

13 Jun 2021 03:55 am - Committed user success report

June 10

Reporting period

Successful

Period status:

Success

User report:

Success

Referee User report:

Reports for this period:

Eagle2020

12 Jun 2021 03:57 am - Referee approval report

Good

jzhang45

12 Jun 2021 03:54 am - Committed user success report

Algoexpert

June 9

Reporting period

Successful

Period status:

Success

User report:

Success

Referee User report:

Reports for this period:

Eagle2020

11 Jun 2021 02:17 am - Referee approval report

Nice job!

jzhang45

11 Jun 2021 01:16 am - Committed user success report

June 8

Reporting period

Successful

Period status:

Success

User report:

Success

Referee User report:

Reports for this period:

Eagle2020

10 Jun 2021 01:40 am - Referee approval report

Good work!

jzhang45

9 Jun 2021 02:04 pm - Committed user success report

Learned something very interesting today. If you are given an array of positive integers and want to figure out the smallest number that they cannot sum to using each number at most once ([1,2,5] cannot sum to 4, [5,7,1,1,2,3,22] cannot sum to 20), you simply sort the array and find the total sum for each element in the array (incremental subset), then if that total subset sum + 1 < the next number, then the total sum + 1 is not a possible sum. Problem is here https://www.algoexpert.io/questions/Non-Constructible%20Change