Matt Wang
Home
About Me
Login
Menu
Home
About Me
Matt Wang
Archives
2026 / 02
DevOps Practice Note | Full Production Migration: EC2 → ECS + ALB
2026-02-14
DevOps
#DevOps
0. Migration Overview This migration was not a simple frontend switch. It was a full production architecture upgrade, including: Data Layer EC2 local
2026 / 01
DevOps Study Note|Understanding ECS Fargate, Auto Scaling, and Load Balancing in Practice
2026-01-19
DevOps
#DevOps
1. Background In this study note, I documented a complete hands-on learning journey of Amazon ECS with Fargate, focusing on: How ECS actually runs wor
DevOps Study Note | Jenkins: A Practical Approach to CI in Real-World Systems
2026-01-12
DevOps
#DevOps
As I gradually moved from “following deployment steps” to actually understanding why modern delivery pipelines are designed the way they are, CI/CD st
2025 / 10
Wisdom Chatroom
2025-10-29
NLP
#NLP
#System Design
#LLM
Over the past ten days, I’ve been building something that started as a small experiment but ended up becoming one of my favorite side projects: Wisdom
2025 / 07
Architecture and Design of a Banking AI Assistant
2025-07-13
System Design
#NLP
#System Design
This note summarizes the system design and technical insights from building a banking customer service assistant powered by retrieval-augmented genera
2025 / 05
Designing a Proximity Service (Yelp, Google Places)
2025-05-31
System Design
#System Design
📌 1️⃣ Introduction Proximity Service is a key component in many modern applications: Yelp: Find nearby restaurants and shops Google Places: Return ne
LeetCode Study Note | Problem 743: Network Delay Time
2025-05-20
LeetCode
# Depth-First Search
#Breadth-First Search
#Graph
#Shortest Path
#Priority Queue
📘 Problem Overview You are given a directed, weighted graph with n nodes (1-indexed), and a list of travel times times, where each element is [u, v,
LeetCode Study Note | Problem 45: Jump Game II
2025-05-19
LeetCode
#Greedy
#Array
#Dynamic Programming
🧩 Problem Summary You are given an integer array nums where each element represents your maximum jump length at that position. Your goal is to return
LeetCode Study Note | Problem 55: Jump Game
2025-05-19
LeetCode
#Array
#Dynamic Programming
#Greedy
🧠 Problem Overview You’re given an integer array nums, where each element represents the maximum jump length from that position. Starting at index 0,
Previous
1 / 3
Next