menu
jzhang45
Coding Interview Prep Star this Commitment
Day 48 of 84

jzhang45 commits to:
Doing 105 minutes or more of coding interview preperation a day
45
1
Details
Report Now
A user report is currently expected for this period.
My Commitment Journal
jzhang45
jzhang45
June 12, 2021, 3:54 AM
Algoexpert
jzhang45
jzhang45
June 11, 2021, 1:17 AM
Did Algoexpert
jzhang45
jzhang45
June 9, 2021, 2:05 PM
jzhang45
jzhang45
June 9, 2021, 2:03 PM
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
  • Jun 9, 2021
Displaying 1-4 of 46 results.
July 23
Successful (pending referee feedback)
Success
Pending
July 22
Successful
Success
Success

Eagle2020
Eagle2020
- Referee approval report
Nice
jzhang45
jzhang45
- Committed user success report
July 21
Successful (referee feedback expired)
Success
No report submitted
July 20
Successful
Success
Success

Eagle2020
Eagle2020
- Referee approval report
Good
jzhang45
jzhang45
- Committed user success report
Recipient of Stakes
Charity
To change the Recipient of Stakes for your Coding Interview Prep Commitment, enter their email address or stickK username below.
Total at stake: $420.00
Stakes per period: $5.00
Remaining Stakes: $190.00
Total Money Lost: $5.00
Referee
Supporters
.
Your feedback has been sent. Thank you!
This website uses cookies to ensure you get the best experience on our website. Read our Privacy Policy