unknown

One-line launch anything from Mac OS

Blocking/non-blocking in Python with async/await

Docker compose tutorial

Python environment management

Node.js - how to use pnpm globally

More >>

Leetcode

TODO

2285. Maximum Total Importance of Roads

2341. Maximum Number of Pairs in Array

445. Add Two Numbers II

Google questions

More >>

Design

Java Design Pattern

Maven tutorial

MySql (1) - Indexing, Locking and Transaction

MySql (2) - Master/slave

MySql (3) - Sharding

More >>

LLM

Explain LLM in Simple Terms

Java Basic

Java一些基础语法：Comparator, MapEntry, Iterator

Questions

Hackerrank - DigitalWallet

Question

[Question] Number Of Bus Stations (meeting rooms)

[Question] Count Arithmetic Slices

[Question] Shuffle and Get Max Difference

[Amazon] Infix to Postfix conversion

[Question] Get Max Number Game (minmax + dp)

More >>

Fundamental

[Fundamental] Java Bit Operation

[Fundamental] Recap on Java HashMap

[Fundamental] Heap (data structure)

[Fundamental] Quickselect

[Fundamental] A-Star Search

More >>

Testing

[Testing] Software Testing

[Testing] Test Number Divisibility

[Testing] Random error debugging 1

[Testing] Test Command Line Copy

[Testing] Test hashCode() function

NineChap

[NineChap 2.1] Binary Search

[NineChap 2.2] Sorted Array

[NineChap 3.3] Binary Search Tree

[NineChap 3.2] Binary Tree BFS

[NineChap 3.1] Binary Tree DFS and Divide Conquer

More >>

Lintcode

[LintCode] Recover Rotated Sorted Array

leetcode_plus

[LeetCode Plus] Lowest Common Ancestor of BST

[LeetCode Plus] Lowest Common Ancestor of Binary Tree (II)

[LeetCode Plus] Lowest Common Ancestor of Binary Tree (I)

[LeetCode Plus] Searching a 2D Sorted Matrix

[LeetCode Plus] Binary Tree Serialize and Deserialize

More >>

Java OOP

[Java OOP] Java modifier and Access Level

[Java OOP] Java Global Variable

[Java OOP] OOP - 4 major principles

[Java OOP] Octal and Hexadecimal Numbers in Java

[Java OOP] Upcasting, Downcasting and Object Slicing

More >>

LintCode

[LintCode] Longest Common Subsequence

[LintCode] Longest Increasing Subsequence

[LintCode] Previous Permutation

[LintCode] Majority Number II

[LintCode] Majority Number III

More >>

experience

[Octopress] Clone Octopress Blog From A Different Computer

[Ruby] RubyGems, gem, Gemfile and Bundler

[Ruby] Endless error with gem dependencies

[Octopress] Add Google AdSense to Octopress

[Octopress] Add Aside Content to Octopress

q-google

[Google] Print string comparison order

[Google] Special increasing adjacent sequence

[Google] Design Solar System (`)

[Google] Three Keys Data Structure

[Google] Find Nearest Point in a 2D Space

More >>

CC150v4

[CC150v4] 17.1 Type a URL in Browser and Hit Enter

[CC150v4] 9.4 Sort Large Files

[CC150v4] 9.7 Circus Tower Routine

[CC150v4] 10.7 Ugly Numbers (Hamming numbers)

[CC150v4] 4.7 Check Subtree

More >>

CC150v5

[CC150v5] 8.1 Design a Generic Deck of Cards

[CC150v5] 8.7 Design Online Chat Server (1)

[CC150v5] 8.7 Design Online Chat Server (2)

[CC150v5] 8.8 Design Othello Game

[CC150v5] 8.10 Implement a Hashmap

More >>