Jonathan Chao – Medium

5 days ago

The Blind 75 Leetcode Series: Minimum Window Substring

Today, we are working on 76. Minimum Window Substring Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty…

Leetcode

5 min read

Jun 27

The Blind 75 Leetcode Series: Set Matrix Zeroes

Today, we are working on 73. Set Matrix Zeroes Given an m x n integer matrix matrix, if an element is 0, set its entire row and column to 0's. You must do it in place.

Leetcode

5 min read

Jun 24

The Blind 75 Leetcode Series: Climbing Stairs

Today, we will be working on 70. Climbing Stairs You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Leetcode

4 min read

Jun 21

The Blind 75 Leetcode Series: Unique Paths

Today, we will be working on 62. Unique Paths There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner (i.e., grid[m - 1][n - 1]). The robot can only move…

Leetcode

5 min read

Jun 19

The Blind 75 Leetcode Series: Insert Interval

Today, we are working on 57. Insert Interval You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and intervals is sorted in ascending order by starti. …

Leetcode

4 min read

Jun 13

The Blind 75 Leetcode Series: Merge Intervals

Today, we are working on 56. Merge Intervals Before we start, I would like to add that I’ve seen this problem or something similar to this multiple times throughout my career when I’m interviewing. This is a fun question that really tests your ability to come up with an algorithm…

Leetcode

4 min read

Jun 8

The Blind 75 Leetcode Series: Jump Game

Today, we are working on 55. Jump Game You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position. Return true if you can reach the last index, or false otherwise.

Leetcode

4 min read

Jun 6

The Blind 75 Leetcode Series: Spiral Matrix

Today, we will be working on 54. Spiral Matrix. Given an m x n matrix, return all elements of the matrix in spiral order.

Leetcode

5 min read

May 28

7 Things I Regret Not Doing Back in College

Background I went through college in 4 years being a full student in a public school as a resident. I borrowed money from parents interest-free so I didn’t have to worry about paying for student loan. I also lived in a really frugal life style (buying cheap, bad quality food and…

College

5 min read

May 25

The Blind 75 Leetcode Series: Maximum Subarray

Today, we will be working on 53. Maximum Subarray. Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. A subarray is a contiguous part of an array.

Leetcode

7 min read