LeetCode 141 - Linked List Cycle
Detect a cycle in a linked list — from a hash set that tracks visited nodes to Floyd's two-pointer tortoise-and-hare algorithm in O(1) space.
Skip to content
Full Stack · Python · Aws · Vue.js
MurphyLin
Full-Stack Developer | Backend Engineer | Platform Engineer
Mandarin NativeEnglish ProficientVietnamese IntermediateJapanese Intermediate
With years of experience in full-stack and backend development, I have a genuine passion for building things and staying close to emerging technology.
Featured Work
All projects →End-to-End Cloud-Native Full-Stack Platform
Led the build of a cloud-native system ingesting high-frequency data from iOS, Android, and Edge Devices. Pure Serverless for scale, full CI/CD for delivery.
AI Training Data Pipeline & Automated Scraping
Compliant data collection, BeautifulSoup + RegEx parsing, and deploying a PyTorch Lite model on iOS via Objective-C — full pipeline from raw data to on-device inference.
Multi-Cloud Microservices & DevOps Automation
Terraform manages AWS + GCP together. CI/CD decoupled for Keyless Auth. Workload Identity Federation solves cross-cloud image pulls from ECR to GKE.
All Posts
View all posts →LeetCode 143 - Reorder List
Reorder a linked list into the pattern L0→Ln→L1→Ln-1→… — from an O(N) space array approach to an in-place O(1) space solution using find-midpoint, reverse, and merge.
LeetCode 021 - Merge Two Sorted Lists
Merge two sorted linked lists into one sorted list — an iterative dummy-head approach and a clean recursive solution.
LeetCode 206 - Reverse Linked List
Reverse a singly linked list — an iterative three-pointer approach in O(1) space, and a recursive solution that unwinds the chain from the tail.
Tech Stack
Cloud and Infrastructure
CI/CD and Automation
Backend and Frameworks
Databases and Storage
AI and Frontend
Mobile Development