{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":747359915,"defaultBranch":"master","name":"daily-coding-problem-2024","ownerLogin":"SidneyBuckner","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2024-01-23T19:19:06.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/22137352?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1712247684.0","currentOid":""},"activityList":{"items":[{"before":"3f0d204aa854ce3fcc7ff5814016b836d5816c47","after":"fba2e49b955a5f2caca4c9cdbf5986612ed34009","ref":"refs/heads/master","pushedAt":"2024-08-19T12:47:59.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Problem 4 Day 1 - Setup","shortMessageHtmlLink":"Problem 4 Day 1 - Setup"}},{"before":"75824427056a5a5b5a9d1c3c935e03650242463d","after":"3f0d204aa854ce3fcc7ff5814016b836d5816c47","ref":"refs/heads/master","pushedAt":"2024-08-15T16:15:24.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"refining README.md","shortMessageHtmlLink":"refining README.md"}},{"before":"3df0569b29b4767af63faa1e92a87a69368b6190","after":"75824427056a5a5b5a9d1c3c935e03650242463d","ref":"refs/heads/master","pushedAt":"2024-08-15T16:12:52.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Refining Daily Coding Problem Schedule","shortMessageHtmlLink":"Refining Daily Coding Problem Schedule"}},{"before":"10449e0a4f891ba8ee280b70a21b84065978b3a8","after":"3df0569b29b4767af63faa1e92a87a69368b6190","ref":"refs/heads/master","pushedAt":"2024-08-07T23:13:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Lots of updates and changes. Were starting over again from Day one and changing the strategy. One Coding Problem a day. Solve the problem in 30 minutes or draw it out. Do this until you hit 3 days. After three days, look at a solution. At the end of the week, keep track of the ones you missed and review those over again at the end of the week and move on to next problem.","shortMessageHtmlLink":"Lots of updates and changes. Were starting over again from Day one an…"}},{"before":"293a480e9c68fcc4e76b793bfa4d57a3678f8ca5","after":"10449e0a4f891ba8ee280b70a21b84065978b3a8","ref":"refs/heads/master","pushedAt":"2024-08-06T14:28:32.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Greatest Index Value in Array Attempt 1 - NOT SOLVED, Time attempted 12mins","shortMessageHtmlLink":"Greatest Index Value in Array Attempt 1 - NOT SOLVED, Time attempted …"}},{"before":"397e8a963a881441db07dc2959f91cd2eda5600c","after":"293a480e9c68fcc4e76b793bfa4d57a3678f8ca5","ref":"refs/heads/master","pushedAt":"2024-08-06T14:12:41.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Product of all array values - SOLVED (9minutes). Second solution NOT SOLVED, took 20 minutes to problem solve though.","shortMessageHtmlLink":"Product of all array values - SOLVED (9minutes). Second solution NOT …"}},{"before":"869f6120fa036398248787b441e0e34cf07fc8c0","after":"397e8a963a881441db07dc2959f91cd2eda5600c","ref":"refs/heads/master","pushedAt":"2024-08-05T20:36:37.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Attempting only one problem today and feeling crappy about it","shortMessageHtmlLink":"Attempting only one problem today and feeling crappy about it"}},{"before":"26d3a04c6020f81b807c463c5ecc89436b744737","after":"869f6120fa036398248787b441e0e34cf07fc8c0","ref":"refs/heads/master","pushedAt":"2024-08-04T16:44:59.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Greatest Index in array Attempt 1 - NOT SOLVED. Adding Attempt 2 folder to keep going.","shortMessageHtmlLink":"Greatest Index in array Attempt 1 - NOT SOLVED. Adding Attempt 2 fold…"}},{"before":"9f5bcc5a08af32642cd503e7e5a5d06a7e80e625","after":"26d3a04c6020f81b807c463c5ecc89436b744737","ref":"refs/heads/master","pushedAt":"2024-08-04T15:26:52.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Netflix Prep - Adding in Changes to Daily Coding Problem sets from Arrays to Linked Lists. Additional Exercises to speedrun in the coming days.","shortMessageHtmlLink":"Netflix Prep - Adding in Changes to Daily Coding Problem sets from Ar…"}},{"before":"5efcf91c262e11c83b38d50f766b6df04d8ba5db","after":"9f5bcc5a08af32642cd503e7e5a5d06a7e80e625","ref":"refs/heads/master","pushedAt":"2024-06-03T15:57:07.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Observations written out about BTS coding problem, and screenshots to help solve the problem. NOT SOLVED TODAY. Will get more feedback and circle around to it later in the day.","shortMessageHtmlLink":"Observations written out about BTS coding problem, and screenshots to…"}},{"before":"18a798b210290ee950fb5e3578b04f19a1733203","after":"5efcf91c262e11c83b38d50f766b6df04d8ba5db","ref":"refs/heads/master","pushedAt":"2024-05-31T16:45:31.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Setting Up Problem 5 - Day 1 Binary Search tree. Research needs to be done for this problem to go forward before solving it. Reference Big Green for more help.","shortMessageHtmlLink":"Setting Up Problem 5 - Day 1 Binary Search tree. Research needs to be…"}},{"before":"ade69094715d497bb769ff6c559002aa92bfc649","after":"18a798b210290ee950fb5e3578b04f19a1733203","ref":"refs/heads/master","pushedAt":"2024-05-31T16:30:58.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Strings: Problem 1 day 1 and 2. Definitely did not solve in the allotted times. Next I will jump to trees next since Im expecting recursive problems for my next interview.","shortMessageHtmlLink":"Strings: Problem 1 day 1 and 2. Definitely did not solve in the allot…"}},{"before":"4e1ec159774b6643cd3ef02a190433562d642406","after":"ade69094715d497bb769ff6c559002aa92bfc649","ref":"refs/heads/master","pushedAt":"2024-05-20T14:54:03.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Recording my findings for Day 8 of the smallest window bounds. Ready now for Problem 3 Day 1.","shortMessageHtmlLink":"Recording my findings for Day 8 of the smallest window bounds. Ready …"}},{"before":"6176956b0305fe71a380493bb161ae261b3d3e31","after":"4e1ec159774b6643cd3ef02a190433562d642406","ref":"refs/heads/master","pushedAt":"2024-05-14T18:07:58.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Problem 2 Day 8 Set up","shortMessageHtmlLink":"Problem 2 Day 8 Set up"}},{"before":"e15cccc7dd3a5b3a8018bc4b182f5edde1d95776","after":"6176956b0305fe71a380493bb161ae261b3d3e31","ref":"refs/heads/master","pushedAt":"2024-05-14T15:45:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Problem 2 Day 7: Solved in 60mins but need to test another attempt again to completely solidify my knowledge of this before I go onto the next problem. We'll use Day 8 as that exercises and begin again with the next problem. Adding Jest to my Node packages so that I may test like Im using CodeSandbox","shortMessageHtmlLink":"Problem 2 Day 7: Solved in 60mins but need to test another attempt ag…"}},{"before":"a435f8d40213b2bb70d0edec4fd8772a6cc19add","after":"e15cccc7dd3a5b3a8018bc4b182f5edde1d95776","ref":"refs/heads/master","pushedAt":"2024-05-09T15:30:40.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Attempted different solutions with multiple for loops for Day 4 and Day 5. Neither worked in the way that makes sense for the more challenging array sets of numbers where the entire array of integers would need to be sorted. Back to the drawing board (figma) to work out a solution and prep for Day 6 to try again.","shortMessageHtmlLink":"Attempted different solutions with multiple for loops for Day 4 and D…"}},{"before":"a3a7a2c26d6a72191627f53b8318d00d4b5e75b7","after":"a435f8d40213b2bb70d0edec4fd8772a6cc19add","ref":"refs/heads/master","pushedAt":"2024-04-22T17:42:27.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Setting up Problem 2 Day 5.","shortMessageHtmlLink":"Setting up Problem 2 Day 5."}},{"before":"8ef98d3aa6d1bbe64f7276600a8fbc71f6a790d7","after":"a3a7a2c26d6a72191627f53b8318d00d4b5e75b7","ref":"refs/heads/master","pushedAt":"2024-04-22T17:41:01.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Problem 2  Day 4: NOT SOLVED - after 2 hours I sought a solution through ChatGPT and realized that I would need two separate loops to find the bounds in which the array values needed to be sorted.\n\nFor my first few attempts at a solution I think I was on the right track to getting the start bounds index where I track if the previous index is greater or smaller than the current index Im checking against. but whats had me tripped up is determining then what the conditions are for the end bounds. Specifically, finding the end bounds within one for loop. One thing ill also need to determine going forward is asking myself if any solutions or attempt at executing code will need more than one loop if the conditional statements don't support the range in which Im doing calculations.","shortMessageHtmlLink":"Problem 2 Day 4: NOT SOLVED - after 2 hours I sought a solution throu…"}},{"before":"32261482919628c1c1fc414fa8c8562fbf5d51c1","after":"8ef98d3aa6d1bbe64f7276600a8fbc71f6a790d7","ref":"refs/heads/master","pushedAt":"2024-04-10T17:43:04.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Problem2 - Day 1: Adding notes and screenshots since I forgot to commit yesterday. / Problem 2 - Day 2: Screenshots of mindmapping and results from today are also logged in commit.","shortMessageHtmlLink":"Problem2 - Day 1: Adding notes and screenshots since I forgot to comm…"}},{"before":"02fdb21816f2f3f4c82bbcef2b8424c09720a811","after":"32261482919628c1c1fc414fa8c8562fbf5d51c1","ref":"refs/heads/master","pushedAt":"2024-04-08T15:12:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Problem 2 - Day 1: NOT SOLVED!\n\nMost of today's work was primarily in Figma as I was trying to understand why i might be stuck with making the comparisons between indices to then add to the start bound and end bound variables.\n\nWhat I came up with is using a results array for the correct indices. I also saved a space in memory for the variables representing the start bound and for the end bound.\n\nAt the first instance of the loop I needed to start the process of finding the starting bound place to sort. I made a comparison to the index 0 to the index before it. If 'array[i-1]' didn't exist, then I pushed the index of that value to the start bound. If the previous index of the array DID exist, then I made a comparison to the current index and the next index after: if 'array[i] > array[i+1]' then made the end bound the next index at 'array[i+1]'. So I think Im close when it comes to this solution but I think im going to work more in figma with this tomorrow. Because what Im still struggling with is what I need to make proper comparisons to in terms of the values in the loop and what happens when the next value is smaller that the current value Im currently iterating through in the loop.\n\nI also made the mistake of putting the actual value of the array into the startBound and endBound variables which was not what I wanted, the indices need to be there. So after I changed the values to the correct state, my initial attempt at the problem resulted in my answer being the indices 0 and 2 being the answer. When in reality I wanted thm I think pushed over by one index. Im on the right path but I think theres something still missing with how Im executing the comparisons and Im not sure what it is yet, like I've said previously. Also prepping myself for tomorrow's attempt.","shortMessageHtmlLink":"Problem 2 - Day 1: NOT SOLVED!"}},{"before":"15e8783f75bf6ee870553ad7c3fc8f284cb83140","after":"02fdb21816f2f3f4c82bbcef2b8424c09720a811","ref":"refs/heads/master","pushedAt":"2024-04-06T16:23:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Setting up Problem#2","shortMessageHtmlLink":"Setting up Problem#2"}},{"before":"f501fa2e1edf8a3e021bd41d869a7433ecf9d685","after":"15e8783f75bf6ee870553ad7c3fc8f284cb83140","ref":"refs/heads/master","pushedAt":"2024-04-06T16:12:05.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Problem 1 - Day 3: Solved with alternate solution without division in 29 minutes!!!","shortMessageHtmlLink":"Problem 1 - Day 3: Solved with alternate solution without division in…"}},{"before":"dc9baf957cb60e9c294b08d60f40176daae6cd55","after":"f501fa2e1edf8a3e021bd41d869a7433ecf9d685","ref":"refs/heads/master","pushedAt":"2024-04-05T14:20:46.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Adding note that problem was solved today in HTML","shortMessageHtmlLink":"Adding note that problem was solved today in HTML"}},{"before":"cc8311a56ecb39b68492935e474d985c1bdb0735","after":"dc9baf957cb60e9c294b08d60f40176daae6cd55","ref":"refs/heads/master","pushedAt":"2024-04-05T14:16:49.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Problem 1 - Day 2: SOLVED in 50mins NO SOLUTION!","shortMessageHtmlLink":"Problem 1 - Day 2: SOLVED in 50mins NO SOLUTION!"}},{"before":"cb01f937308cc04d0b01d26d3d8337d37822dd3a","after":"cc8311a56ecb39b68492935e474d985c1bdb0735","ref":"refs/heads/master","pushedAt":"2024-04-05T13:20:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"I know that initally since this is an array I need to traverse through it to do SOMETHING.\nNow that I have My values up to the total product that they multiply up to. I need to find a way to push these values into the new array.\n\nWhat Im thinking I can do first is that when I get the new product in the first loop and can push the results into the new array. But that wont work since The total product jumps from 3 to 6 and stays at 6. And The output of my Original test case involves an array with a value of 2 in it.\n\nThis is where I can divide!","shortMessageHtmlLink":"I know that initally since this is an array I need to traverse throug…"}},{"before":"b2850df65ca37e4ea7ee9882703de795509e0124","after":"cb01f937308cc04d0b01d26d3d8337d37822dd3a","ref":"refs/heads/master","pushedAt":"2024-04-05T13:04:06.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"First Commit for Day 2 attempt of Problem 1.","shortMessageHtmlLink":"First Commit for Day 2 attempt of Problem 1."}},{"before":"2f0dde73ef0bbee64fe5a6e5482f21ce4a90a667","after":null,"ref":"refs/heads/problem1-day1","pushedAt":"2024-04-04T16:21:24.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"}},{"before":"f6fa305c78ee8b85a577f5775c461b42f0f6920a","after":"b2850df65ca37e4ea7ee9882703de795509e0124","ref":"refs/heads/master","pushedAt":"2024-04-04T16:21:18.000Z","pushType":"pr_merge","commitsCount":4,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Merge pull request #1 from SidneyBuckner/problem1-day1\n\nProblem1 day1","shortMessageHtmlLink":"Merge pull request <a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"2225976600\" data-permission-text=\"Title is private\" data-url=\"https://github.com/SidneyBuckner/daily-coding-problem-2024/issues/1\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/SidneyBuckner/daily-coding-problem-2024/pull/1/hovercard\" href=\"https://github.com/SidneyBuckner/daily-coding-problem-2024/pull/1\">#1</a> from SidneyBuckner/problem1-day1"}},{"before":"7a6e5fa1f0571bba132da3e1cb9ffbcd6b5c6cfe","after":"2f0dde73ef0bbee64fe5a6e5482f21ce4a90a667","ref":"refs/heads/problem1-day1","pushedAt":"2024-04-04T15:59:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Rearranging Daily Coding problem list to match with bbok so that I dont feel stuck as much. I have a space to look at solutions if needed but the goal is to not for 1 week.","shortMessageHtmlLink":"Rearranging Daily Coding problem list to match with bbok so that I do…"}},{"before":"5e2602adef96f9917498489d0c9810f517886b7e","after":"7a6e5fa1f0571bba132da3e1cb9ffbcd6b5c6cfe","ref":"refs/heads/problem1-day1","pushedAt":"2024-04-01T14:02:30.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"SidneyBuckner","name":"Sidney Buckner","path":"/SidneyBuckner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/22137352?s=80&v=4"},"commit":{"message":"Setting up dev env for day1 problem 1. Set 30mins on clock to solve problem and check answer when finished later today.","shortMessageHtmlLink":"Setting up dev env for day1 problem 1. Set 30mins on clock to solve p…"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"Y3Vyc29yOnYyOpK7MjAyNC0wOC0xOVQxMjo0Nzo1OS4wMDAwMDBazwAAAASeBNj6","startCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wOC0xOVQxMjo0Nzo1OS4wMDAwMDBazwAAAASeBNj6","endCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wNC0wMVQxNDowMjozMC4wMDAwMDBazwAAAAQkiCLr"}},"title":"Activity · SidneyBuckner/daily-coding-problem-2024"}