Yosgi Siqi Liu

A developer who likes to tinker.

Nice Resume
A convenient and quick resume builder tool
Our Little Shire
A small 3D village to explore, with stories, animals, and little discoveries
Evo! Partner Expedition
A roguelike creature adventure about building a team, evolving partners, and battling together
Werewolf AI
A Werewolf social-deduction game played with AI players, built on discussion, voting, and hidden roles

3d ai ai agents ai engineering ai systems algorithms algorithms array binary search tree binary tree claude codex css design pattern digital twin digital twins engineering engineering management frontend game development investing investing javascript javascript leetcode life linked list mcp mongodb network node.js performance optimization product engineering projects queue react sorting stack string three.js vue web development web performance

347-first-K-high-frequency elements
Finding the top K most frequent elements by counting occurrences, then selecting with a min-heap.
Algorithms Created Thu, 08 Apr 2021 00:00:00 +1200
Interview Question-17-14-Minimum Number of K
Finding the smallest K numbers in an array with a heap.
Algorithms Created Thu, 08 Apr 2021 00:00:00 +1200
295-Median of data streams
Maintaining the running median of a data stream with a max-heap and a min-heap.
Algorithms Created Wed, 24 Mar 2021 00:00:00 +1300
1738-Find the K-th largest XOR coordinate value
Finding the k-th largest XOR-coordinate value with a 2D prefix-XOR DP, then selecting the k-th largest.
Algorithms Created Mon, 22 Mar 2021 00:00:00 +1300
1046-The Weight of the Last Stone
Simulating the last stone weight by repeatedly smashing the two heaviest stones with a max-heap.
Algorithms Created Sun, 21 Mar 2021 00:00:00 +1300
865 - Minimum subtree with all deepest nodes
Finding the smallest subtree containing all deepest nodes with a single bottom-up recursion that returns each subtree's depth.
Algorithms Created Sun, 21 Mar 2021 00:00:00 +1300
783-Binary Search Tree Node Minimum Distance
Finding the minimum distance between BST nodes using the ordered property of in-order traversal.
Algorithms Created Thu, 18 Mar 2021 00:00:00 +1300
1022 - the sum of the binary numbers from root to leaf
Summing root-to-leaf binary numbers with top-down pre-order traversal.
Algorithms Created Wed, 17 Mar 2021 00:00:00 +1300
1325-Delete the leaf node of the given value
Post-order traversal approach to delete target-valued leaf nodes using a dummy root.
Algorithms Created Wed, 17 Mar 2021 00:00:00 +1300
1448-Count the number of good nodes in a binary tree
Notes on counting good nodes in a binary tree using DFS with a running max.
Algorithms Created Wed, 17 Mar 2021 00:00:00 +1300

Previous Next