Huachen Wang

Menu

Huachen Wang

Archives

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 Study Note #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 Study Note #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 Study Note # 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 Study Note #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 Study Note #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,
LeetCode Study Note | Problem 198: House Robber

2025-05-18

LeetCode Study Note #Dynamic Programming#Array
🏠 Problem Overview You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, but adjacen
LeetCode Study Note | Problem 207: Course Schedule

2025-05-17

LeetCode Study Note #Graph#Breadth-First Search# Depth-First Search# Topological Sort
Problem Summary You are given numCourses courses labeled from 0 to numCourses - 1, and a list of prerequisites where each element is a pair [a, b] mea
LeetCode Study Note | Problem 994: Rotting Oranges

2025-05-17

LeetCode Study Note #Array#Breadth-First Search#Matrix
🔍 Problem Overview You’re given an m x n grid, where: 0 represents an empty cell 1 represents a fresh orange 2 represents a rotten orange Each minute
Previous 1 / 3 Next