Leetcode 44 Sharing
Problem Please refer to to LeetCode Problem 44. Wildcard Matching. Solution 1: Double DP def isMatch(self, s: str, p: str) -> bool: m, n = len(s), ...
Welcome to my professional portfolio! I am currently a Full Stack Software Engineer (Frontend focused) at WeRide. My current project involves building multi-agent applications powered by Large Language Models (LLMs) to help identify and diagnose algorithmic problems across different modules.
I hold a Master of Science degree in Computer Science from the University of California, San Diego and a Bachelor of Science degree in Computer Science and Data Science from the Hong Kong University of Science and Technology. Previously, I completed two internships focused on frontend development at SmartTwigs and Inspur Group.
For my Final Year Project at HKUST, under the guidance of Professor Zhou Xiaofang, I explored the realm of Graph Databases and Software Development. The project focused on developing a visual query interface for Neo4j, enabling non-technical users to graphically construct queries and visualize the results. Our work was also published as a demo paper at the VLDB 2023 conference, a top-tier event in the field. You can access our published work [here].
This webpage is last updated on Sep. 9, 2025.
Though not currently pursuing a PhD, I am interested in the research of database systems and machine learning.
1. University of California, San Diego (UCSD), Sep. 2023 - Mar. 2025
2. Hong Kong University of Science and Technology (HKUST), Sep. 2019 – Jun. 2023
1. Graduate Record Examinations (GRE) (Sept. 03, 2022)
2. Test of English as a Foreign Language (TOEFL) (Sept. 21, 2022)
Problem Please refer to to LeetCode Problem 44. Wildcard Matching. Solution 1: Double DP def isMatch(self, s: str, p: str) -> bool: m, n = len(s), ...
Problem Please refer to to LeetCode Problem 1851. Minimum Interval to Include Each Query. Solution 1: Naive Method (OT) def minInterval(self, intervals: L...