Posts2 Cool tech talks/videos Date Watched: 10 Feb 2022 Title: Jake Archibald: In The Loop - JSConf.Asia Note: Watch the whole thing, it gets really interesting from 7 minutes onwards Things I remember: - Three queue: JS queue, Microtask queue, Animation queue - Microtasks (callbacks to promises) can only run when JS stack is empty, and will run until the stack is empty If microtasks continue being added, then those will be .. 2022. 2. 10. Algorithm cheatsheet Binary Tree General steps for DFS: 1. skip condition (start/leaf node) 2. visit current node (add current node to path, add sum etc) 3. DFS left and right 4. clean up (rollback whatever is shared across calls) Find # of paths from root that sum to target Precondition: Binary tree with integer nodes. Given root of the tree, find # of paths from root that sum to target. Algorithm: Parameters: n = .. 2021. 10. 24. 이전 1 다음
