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.
Full Stack ยท Python ยท Aws ยท Vue.js
Full-Stack Developer | Backend Engineer | Platform Engineer
With years of experience in full-stack and backend development, I have a genuine passion for building things and staying close to emerging technology.

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.
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.
Terraform manages AWS + GCP together. CI/CD decoupled for Keyless Auth. Workload Identity Federation solves cross-cloud image pulls from ECR to GKE.
Merge two sorted linked lists into one sorted list โ an iterative dummy-head approach and a clean recursive solution.
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.
Search a rotated sorted array for a target in O(log N) โ identifying the sorted half at each step, or finding the pivot first and running a clean binary search.
Design a key-value store that supports timestamped writes and floor-timestamp reads โ storing sorted timestamp lists per key and binary searching for the closest past entry.
Cloud and Infrastructure
CI/CD and Automation
Backend and Frameworks
Databases and Storage
AI and Frontend
Mobile Development