Solve problems with JavaScript
Practicing is boring, but will come the feelingLatest posts with tag "leetcode"
One-line KO
Straight forward: min, max then gcd
Should draw for better imagination of how it works
Naming variables is also important
Example of using dummy head technique
(IMO) Not easy as categorized
2 pointers running simultaneously
Keep next next
Update head each iteration
Same as LC 141, but different in return
Understand why returns "low/left"
Implement some linked list methods
Popular tags
leetcode
array
string
recursion
hash table
math
dynamic programming
codility
hackerrank
greedy
tree
css
cssbattle
linked list
adventofcode
dfs
sorting
two pointers
codewars
stack
matrix
binary search
binary tree
bfs
bit manipulation
backtracking
graph
sliding window
neetcode
heap
prefix sum
projecteuler
queue
binary search tree
career
cli
dev env
hash map
hashmap
interview
interviewbit
topological sort
trie
union find
yarn