Cmd

# 1) (claude code) add time, space complexity to java class
claude

/add-time-space BinarySearch
/add-time-space BFS

# ....

Resource

• LC classics problems

  • Blind Curated 75
  • Grind 75
  • Grind 169
  • leetcode wiki repo
  • leetcode wiki
  • LC 官神Github題目分類整理
  • LC top 100 likes
  • neetcode 150 LC list
    • My Brain after 569 Leetcode Problems
  • jiakaobo LC : LC code & video
  • LC pattern @ blind : Curated-List-of-Top-100-LeetCode-Questions-to-Save-Your-Time
  • LC Algorithm Problem Classification
  • cheatsheet-leetcode-a4
  • 14-patterns-to-ace-any-coding-interview-question
  • grokking-the-coding-interview

• LC experiences

  • LC難度表
    • 數字越高, 題目越難, 挑與自己LC排名接近的題庫
    • (e.g. LC rank ~= 1600, pick 1600 problem)
  • 代碼隨想錄
  • Leetcode cookbook

• Resource.md - Resource for coding interview (keep updating)
• Teach yourself CS
• MindMapCodeInterview - Mind map for coding interview
• CodeInterviewCheatsheet - Coding interview cheetsheet
• repl.it - Coding online!

• Visualization
  • Algorithms viz
  • visualgo - DFS / BFS - DFS, BFS visualization
  • visualgo - linkedlist - Linkedlist visualization
  • visualgo - BST - binary search tree visualization
  • toptal-sorting-algorithms- sorting algorithms online

• How to: Work at Google — Example Coding/Engineering Interview
• bit_manipulation.md - Bit Manipulation Cheat Sheet
• Py TimeComplexity - Py basic data structure Time Complexity ref
• Py data model - Python data model doc
• pgexercises - Postgre exercises
• sqlservertutorial
• Books
• freecodecamp - data-structures
• LC interview-experience
• Cheatsheet

• Data structure

  • py core data structure interview

• System design

  • system_design readme
  • sys_design_resource

• Tools

  • https://coderpad.io/
  • https://codeshare.io/
  • http://sqlfiddle.com/

• LC SQL resources

  • LC SQL resource

Algorithms content

• Bit Manipulation
• Array
• String
• Linked List
• Stack
• Queue
• Heap
• Tree
• Hash Table
• Math
• Two Pointers
• Scan Line
• Sort
• Recursion
• Binary Search
• Binary Search Tree
• Breadth-First Search
• Depth-First Search
• Backtracking
• Dynamic Programming
• Greedy
• Graph

Database

• SQL

Shell

• Shell Script

Progress

Data Structure

#	Title	Solution	Use case	Comment	Status
	Linear
	Array	Py			AGAIN*
	Queue	Py, JS			AGAIN*
	Stack	Py, JS (linkedlist), JS (array)			OK
	Hash table	Py, JS	usually for improving time complexity B(O) via extra space complexity (time-space tradeoff)	good basic	AGAIN****
	Linear, Pointer
	LinkedList	Py, JS, Java			OK**
	Doubly LinkedList	Python, JS			AGAIN
	Non Linear, Pointer
	Tree	Py			AGAIN**
	Binary search Tree (BST)

Algorithm

#	Title	Solution	Use case	Comment	Time complexity	Space complexity	Status
	Binary search	Python	complexity ref	Best : O(1), Avg : O(log N), Worst : O(log N)			AGAIN
	Linear search	Python					AGAIN
	Breadth-first search (BFS)	Python	FIND SHORTEST PATH				AGAIN***
	Depth-first search (DFS)	Python	TO CHECK IF SOMETHING EXIST	inorder, postorder, postorder (can recreate a tree)	Adjacency List: O(V+E), Adjacency Matrix: O(V^2)	O(V) (V:Vertices, E:Edges)	AGAIN***
	Bubble sort	Python					OK* (3)
	Insertion sort	Python, InsertionSort.java	stable sort	work very fast for nearly sorted array	Best :O(n), Average : O(n^2), Worst : O(n^2)	Worst : O(1)	AGAIN
	Bucket sort	Python, BucketSort.java					AGAIN