menu
indigoshock
Try 1 DSA question Star this Commitment
Week 5 of 52

indigoshock commits to:
Attempt at least 1 DSA question

Goal Description:
Either with another person or through Algoexpert
4
0
Details
Last reported: Success
Next report due:
April 19
7:00 AM GMT
My Commitment Journal
indigoshock
indigoshock
April 7, 2021, 5:05 PM
Comments are different than reports, lol.
indigoshock
indigoshock
April 5, 2021, 5:32 PM
Question:
// Given an integer n, return the difference between the product of its digits and the sum of its digits.
// Example
// Input: n = 234
// Output: 15
// Explanation:
// Product of digits = 2 * 3 * 4 = 24
// Sum of digits = 2 + 3 + 4 = 9
// Result = 24 - 9 = 15

I had idea on how to solve but C# syntax was all incorrect. Same with casting. Had about 15 to 20 minutes to solve so overall, I felt better answering this than the other weeks.
indigoshock
indigoshock
March 30, 2021, 12:52 AM
Josh gave me the question, Determine if there is a circular reference in a linkedlist. I got the most optimal idea but I did not finish coding in time because I didn't remember the optimal solution until about halfway through the interview. Overall, I attempted but did not complete. I'm still happy I was able to think of the optimal solution. It's a start.
indigoshock
indigoshock
March 19, 2021, 6:18 AM
Good. First question on Tuesday with Josh Beasley. It was on ZigZag Traversal. Ouch. Very rough for both of us.
    This Commitment has no photos.
Displaying 1-4 of 4 results.
April 5 to April 12
Successful
Success
March 29 to April 5
Successful
Success
March 22 to March 29
Successful
Success
March 15 to March 22
Successful
Success
Recipient of Stakes
Anti-charity (Political: America First Action (Trump Super PAC))
To change the Recipient of Stakes for your Try 1 DSA question Commitment, enter their email address or stickK username below.
Total at stake: $520.00
Stakes per period: $10.00
Remaining Stakes: $480.00
Total Money Lost: $0.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