-
Climbing Stairs
Climbing Stairs is probably the first problem that forces you to actually think about optimization. For many people, it’s also their first real introduction to Dynamic Programming (DP). At its core, DP is just the idea of remembering work you’ve…
4 min read
-
How to Merge Two Sorted Lists in Java
Merging two sorted lists is both a programming technique and a LeetCode problem! It’s a part of the blind 75 and is a foundational problem to understand since it sets us up for understanding important algorithms like merge-sort down the…
4 min read
-
How to Solve Valid Parentheses in Java
In the ever present LeetCode grind that our industry puts us through I decided to solve the “Valid Parentheses” problem in LeetCode today. For a LeetCode problem it’s surprisingly practical and provides insight into how our IDEs know when we…
4 min read
-
How to Solve Two Sum in Java
Today we’ll be tackling the quintessential problem everyone starts with on LeetCode: Two Sum. It’s approachable but teaches a genuinely useful lesson: how to pick the right data structure for a problem. The Problem The problem from LeetCode looks like…
4 min read
