☰
⚡ AlgoZen
_
//
ALGORITHM_COMPARE
?
// ALGO_COMPARE
⚔ Algorithm Battle
Pick two algorithms and race them side-by-side.
// QUICK_PRESETS
Merge vs Quick Sort
BFS vs DFS
Bubble vs Merge Sort
Binary vs Two Pointers
BFS Tree vs DFS Tree
Stack vs Queue
// LEFT_ALGO
Binary Search
Two Sum
Sliding Window Maximum
Bubble Sort
Merge Sort
Quick Sort
Insertion Sort
Selection Sort
Heap Sort
Counting Sort
Two Pointers
3Sum
Sliding Window (Max Sum)
Stack (LIFO)
Queue (FIFO)
Linked List Traversal
Reverse Linked List
Binary Search Tree
BFS (Level Order)
DFS (Inorder)
Breadth-First Search
Depth-First Search
Dijkstra's Algorithm
Fibonacci (Dynamic Programming)
0/1 Knapsack
Kadane's Algorithm
Coin Change
Longest Increasing Subsequence
Longest Common Subsequence
Bloom Filter
Consistent Hashing
Intermediate
·
O(n log n)
·
O(n)
// RIGHT_ALGO
Binary Search
Two Sum
Sliding Window Maximum
Bubble Sort
Merge Sort
Quick Sort
Insertion Sort
Selection Sort
Heap Sort
Counting Sort
Two Pointers
3Sum
Sliding Window (Max Sum)
Stack (LIFO)
Queue (FIFO)
Linked List Traversal
Reverse Linked List
Binary Search Tree
BFS (Level Order)
DFS (Inorder)
Breadth-First Search
Depth-First Search
Dijkstra's Algorithm
Fibonacci (Dynamic Programming)
0/1 Knapsack
Kadane's Algorithm
Coin Change
Longest Increasing Subsequence
Longest Common Subsequence
Bloom Filter
Consistent Hashing
Intermediate
·
O(n log n) avg
·
O(log n)
⚔ INIT_RACE.exe