I started my web development journey my sophomore year in high school back in 2008 by taking a web development course. I graduated highschool in 2010 and then shortly there after went on a service mission. When I got back I got my first job in web dev in 2012 (I have been in the industry since then) then started college at USU in spring 2013. I graduated college in spring 2018 with my Bachelor's of Science degree. I took an extra year since I switched majors from Information Systems to Computer Science (cause I really enjoyed programming and the theory behind it and thought Computer Science would be more enjoyable.) Over the course of my Computer Science studies I learned to love Math and algorithms. I absolutely loved getting my degree and soaking up all I could. It was especially helpful to me that I already had programming practice from my job, so that I could focus on theory at school.

• Node.js
• Docker
• React & React Native
• GraphQL
  • TypeGraphQL (backend)
  • React Relay (frontend)

• Discrete Math (at USU in Fall 2016)
  • This was a fun course that taught me how to write mathematical proofs that covered everything from Number Theory, Combinatorics, Graph Theory, Geometric Algorithms, and Generating Functions to Predicate Logic. It's a similar course to MIT's well known Mathematics for Computer Science course in fact I started reading the book from that MIT class to prep for this one before the semester started, because I heard from classmates the course was very tough (this was before we had LLMs). It taught me to use critical thinking skills. During the course I was told by one of the TAs if I only relied on the course notes and not the internet to get answers then I would get a lot more out of the course. I took that to heart, and also ended the course with over 100% due to getting extra credit 💯.
• Computational Geometry (Masters level class I took as an undergrad at USU in Spring 2018)
  • This was a fun and very theory heavy class on algorithm design as it relates to 2D points and lines. We did not write any code but pseudo-code. We learned about efficient algorithms for: Convex Hulls, 2D points (e.g. finding the closest pair of points problem for all given points, and other similar but different problems). We also learned some data structures as well such as k-d trees.
• CS 1, 2, & 3 (at USU)
• Competitive Programming
• Philosophy
• Christianity
• Math