Tag: coding
Concepts
- Amortized Analysis
- Arrays and Two Pointers
- Backtracking Search
- Balanced Search Trees
- Bellman-Ford and Negative Cycles
- Big-O Complexity
- Binary Search Patterns
- Binary Search Trees
- Bit Manipulation Fundamentals
- Bitmask Dynamic Programming
- Deques and Window Extrema
- Dijkstra's Shortest Paths
- Discrete-Event Simulation
- Divide and Conquer and the Master Theorem
- Dynamic Programming Basics
- Edit Distance
- Fenwick Trees and Binary Indexed Trees
- Graph Traversal, BFS and DFS
- Graph Representations
- Greedy Algorithms and Exchange Arguments
- Hash Maps and Sets
- Heaps and Priority Queues
- Interval Scheduling and Merging
- Knapsack Problems
- Linked Lists and Cycle Detection
- Longest Common Subsequence
- Longest Increasing Subsequence
- LRU Cache Design
- Max-Flow Min-Cut
- Median from a Data Stream
- Memoization vs Tabulation
- Merge Sort and Counting Inversions
- Minimum Spanning Trees
- Monotonic Stack
- Monte Carlo Simulation (Coding)
- Order Book Data Structure
- Generating Permutations and Subsets
- Prefix Sums
- Quickselect and Top-K Selection
- Rabin-Karp and Rolling Hashes
- Recursion and the Call Stack
- Segment Trees
- The Sliding Window Technique
- Sorting Algorithms Compared
- Stacks and Queues
- String Matching with KMP
- Topological Sorting
- Tree Traversals
- Tries and Prefix Trees
- Union-Find and Disjoint Sets