Learning to Code: Week 16 – Linked Lists


August 25, 2016 Part 2

August 26, 2016

  • Installed a Pomodoro app on my phone and Macbook Pro for more focused blocks and being able to keep better track of how much I’ve worked. Every 25 minute block will be marked with a 🍅 under the date.
  • I should start a blog like this one.


Probably the same for any college degree. It was for my Marketing one.

Continue reading →

Learning to Code: Week 15 – Data Structures

August 19, 2016

August 20, 2016

  • Nothing done today. ☹️

August 21, 2016

  • Worked briefly on trying to get a simple checklist to follow when working on a new coding problem.

August 22, 2016

  • Shawn shared this awesome website: http://www.geeksforgeeks.org/
    • How many times were you frustrated while looking out for a good collection of programming/algorithm/interview questions?
    • What did you expect and what did you get?
    • This portal has been created to provide well written, well thought and well explained solutions for selected questions.
  • http://www.alphr.com/business/1004174/cs50-inside-the-worlds-most-elite-computing-course
  • Getting two new books on OOP!
    • OOP DeMystified
    • Head First Object-Oriented Analysis and Design
  • CS50 Videos
    • Rewatched Tries – 16m
    • Data Structures Summary – 9m
    • Hash Tables (short) – 8m
    • Queues (short) – 6m
    • Trees (short) – 5m
    • Tries (short) – 9m


August 23, 2016

August 24, 2016

August 25, 2016 Part 1

Learning to Code: Week 14 – Stacks & Queues

August 11, 2016

  • Euler #4
    • Gave up looking for a more complex solution and just brute forced it assuming the runtime would still be sufficiently small.
    • Hand-written notes and logic. Needed a function just to reverse the integer and test if the same.
    • Store largest value in a variable.
    • Once done just print whatever value was found to be the largest.
    • My code here: https://gist.github.com/CraigRodrigues/2f5dee93078abf2ed5c456e200957048

Continue reading →

Learning to Code: Week 13 – Specialize

August 4, 2016 (Continued)

  • I met with David Felfoldi yesterday.
  • http://stackoverflow.com/questions/6083045/scanf-n-skips-the-2nd-input-but-n-does-not-why
  • Finally watched some of the postmortem videos for the CS50 challenge.
  • Punctuation
    • He used a while loop and a counter.
    • Looked for NULL terminator instead of using strlen
    • Then if it was a . or , he just made the next character an uppercase one. Of course if the next one wasn’t a letter then nothing would happen still.
    • He put single like IF statements all on one line. Never seen that before.
  • Money Money Money
    • He used the pow() function.
    • He didn’t use rounding, just printing to 2 decimal places which also acts as a round.
  • One Day More
    • He did all the boolean expressions in one line, which makes sense. I didn’t think about the logic hard enough.
  • Airport Arbitrage
    • This was way over my head in figuring out how to code it up. I am familiar with the algorithm and logic though thanks to reading Grokking Algorithms.
    • At least it’s cool to know I should be able to solve the problem after I finish CS50.
    • This required a graph to determine the exchange rate consistency.
    • Depth First Search


Continue reading →