An anecdotal story of how to deal with rejection as a Software Engineer

Dealing with Failure

TLDR

This is anecdotal advice on how I deal with failure.

  1. Remember that we all fail. As I mentioned earlier, reaching out to talk to people about it helped me get past it.

The E-mail

Yesterday, I got the e-mail. Ya know, the type of e-mail you’ve been waiting a week for. However, the contents were not what I wanted to hear.


No break in ForEach()

I recently had a coding interview that involved evaluating one schema against another. The details of it aren’t that important, but one thing that came out of it (in the middle of the interview) was that you can’t break out of a forEach() loop. I had forgotten that little tidbit and it probably screwed up my chances of getting hired. After you read this, hopefully, you won't make the same mistake I did! Don't be like me.


Project Euler Solved with JavaScript: Sum Square Difference
Project Euler Solved with JavaScript: Sum Square Difference

Sum square difference

This problem is fairly simple, however, it will allow us to explore our good friend recursion. We will use a combination of that and functional programming to solve this fella with relative ease…hopefully. Alright, enough yammering, let’s get to it!

Discussion

The sum of the squares of the first ten natural numbers is:

1² + 2² + … + 10² = 385

The square of the sum of the first ten natural numbers is:

(1 + 2 + … + 10)² = 55² = 3025

Hence the difference between the sum of the squares of the first ten natural numbers and…


Problem 5: Smallest multiple

I am more excited to talk about this problem than any of the other problems so far. I am really happy with how it turned out and I think you will be too. Enough said, let’s solve this thing!

Video Version

If you like to watch rather than read, check out the video that accompanies this article. If not, keep reading!

Problem Discussion

2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.

Statement

What is the smallest positive number that is evenly divisible by all of the numbers from 1 to n?

Pattern Recognition


Intro

Welcome to ByteSize JavaScript where we chew on manageable chunks of code. Today we’re going to be talking about recursion.

Recursion is one of those things that you see a lot when you’re learning about JS. The question is, do you understand what it is? If you don’t, I’m going to give two examples that will hopefully clear it up. If you do, check out my examples anyways! I’m sure you have some further insight you can share.

Video Version

If you learn well by watching, check out the video version of this article!

What is Recursion

Recursion is simply:

A function calling itself…


Largest Palindrome Product

Welcome to another edition of Jared rediscovers grade school math! Today we are tackling problem four of Project Euler. We are going to talk about Palindromes and for loops. Let’s get into it!

Problem Discussion

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.

Video Version

If you like to watch rather than read, check out the video that accompanies this article. If not, keep reading!

Statement

Find the largest palindrome made from the product of two 3-digit numbers.

Palindrome

A word that reads the same forwards as backwards…


Project Euler via Javascript

Largest Prime Factor

Today we’re going to tackle Project Euler problem number 3! We are going to learn all about primes and factors. This problem is fairly straight-forward, so we shouldn’t have to dig too deep into Wikipedia.

Checkout solution 2 here:

Problem Discussion

The prime factors of 13195 are 5, 7, 13 and 29.

What is the largest prime factor of the given number?

Video Version

If you like to watch rather than read, check out the video that accompanies this article. If not, keep reading!

Prime Number

First, let’s figure out what a prime number is, in case you forgot…which I did.

A whole number greater…


Getting all the even Fibonacci numbers

Welcome to Round Two of Project Euler! This time we’re heading into the land of state management and that guy you’ve probably heard about: Fibonacci! I’m excited, are you excited?

Check out the solution for Problem 1 here:

Video Version

If you like to watch rather than read, check out the video that accompanies this article. If not, keep reading!

Problem 2: Even Fibonacci Numbers

Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:

1, 2, 3, 5, 8, 13, 21, 34…


Multiples of 3 and 5

Solving Project Euler’s Multiples of 3 and 5

Front Matter

Here we are, attempting the Dark Souls of coding challenges. We’ll start today with a fairly simple one: getting multiples of 3 and 5.

Problem 1: Multiples of 3 and 5

If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.

Find the sum of all the multiples of 3 or 5 below the provided parameter value number.

Video Version

If you like to watch rather than read, check out the video that accompanies this article. If not, keep reading!

Solution

At first glance…


Front Matter

Recently, I got a job that required me to debug a Squarespace site to see why it was loading so slow. I figured I’d share what I did to increase the load speed.

Tools

I used Google’s built-in tool “Lighthouse”. If you don’t know where that is, you can find it in the Dev Tools under “Audit”.

Jared Nutt

Freelance web developer living in Los Angeles. I write articles I wish I had when I was learning — mostly about Javascript and web development.

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