Welcome to Coding Paradise

Contact Me

Name: Suhan (Elaine)

Email: sliu73_at_ucsc_dot_edu

Office: BE 354

Site Map

System.out.println(“Debug is a lifetime challenge!”);

LeetCode OJ

Thoughts and Summaries

Shortest & Smallest: BFS
Connectivity: static -> DFS,BFS,dynamic -> Union Find
Dependency: topological sort
DAG: dfs+memo
Matrix & Array: DP
Quantity: DP
Can or Cannot: DP
Traversal: backtracking
Sorting is always there
Search: specific -> HashMap, range -> BST/TreeSet
Find Kth Smallest: PriorityQueue