About Me
Computer vision & AI for healthcare.
Publications
Common LeetCode Algorithms Part III: BFS & Topological Sorting
BFS is one of the most commonly used algorithms in tech interviews, yet perhaps the most straightforward one.
Common LeetCode Algorithms Part II: Binary Tree & Divide and Conquer
Divide and Conquer can solve most tree problems using DFS to process return values of children for each root node.
Common LeetCode Algorithms Part I: Binary Search
Binary Search is an efficient algorithm aiming to find and item in ordered or partially-ordered array within logarithmic time.
Grind 75 Questions Part I - Array
Grind 75 "Array" part questions covering topics like Double Pointer, Hashmap, DFS, etc.
Spring Basics Part II: Adding Beans to Spring Context
Adding Beans to the Spring context is the fundenmental and first step of learning Spring.
Spring Basics Part I: Spring Ecosystem
Basic introduction to Spring and Spring ecosystem, the most widely used Java framework today.
LeetCode SQL50 Part II - Basic Joins
The analysis and answers to LeetCode SQL50 "Basic Joins" part questions. Both SQL and Pandas methods are used.
Common Pandas Series Operators and Functions
