Takeaways:

  • when designing algorithms, demand the weakest iterators (e.g., bidirectional vs. random access)
  • when designing containers, provide the strongest iterators (e.g., random access vs. bidirectional)
  • build adapters on top of containers and iterators
  • do not use new and delete; use allocators

Week of 11/14

What did you do this past week?

This past week, my partner and I have been working on the implementation of the Darwin project for OOP. I have also started working out again and am mostly caught up on most of my schoolwork which is good.

What’s…

Week of 10/24

What did you do this past week?

This past week, I was able to catch up with most of my schoolwork and lectures and get (mostly) back on track. However, I am still behind on the project, so I’ll need to make sure I get on that.

Week of 9/26

What did you do this past week?

This past week, I was mostly preparing for interviews and trying to catch up on schoolwork and lectures for my classes. I unfortunately got very behind due to a hackathon I had the past weekend, but I was able to…

Week of 9/19

What did you do this past week?

This past week I was able to finish up the project and submit it. I also had the career fair and some interviews this week, so recruiting is going full-swing.

What’s in your way?

Right now, time management has been…

Shikhar Gupta

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store