Skip to content

techinterview

Merge adjacent runs [mp]

techinterview

Home
Vocabulary
Terminology
Terminology
Micro Pattern
Micro Pattern
Python Ref
Python Ref
DSA
DSA
LeetCode Top Easy
LeetCode Top Easy
- Array
  Array
- Strings
  Strings
- Linked list
  Linked list
- Trees
  Trees
- Sorting and Searching
  Sorting and Searching
  - 88. Merge Sorted Array
  - 278. First Bad Version
- Dynamic Programming
  Dynamic Programming
- Design
  Design
  - 384. Shuffle an Array
  - 155. Min Stack
- Math
  Math
- Others
  Others
Leetcode Google Interview
Leetcode Google Interview
- LeetCode Problems
  LeetCode Problems
LeetCode Top Medium
LeetCode Top Medium
- Array and Strings
  Array and Strings
- Linked List
  Linked List
- Trees and Graphs
  Trees and Graphs
- Backtracking
  Backtracking
- Sorting and Searching
  Sorting and Searching
- Dynamic Programming
  Dynamic Programming
- Design
  Design
  - 295. Serialize and Deserialize Binary Tree
  - 380. Insert Delete GetRandom O(1)
- Math
  Math
- Others
  Others
LeetCode Top Hard
LeetCode Top Hard
- Array and Strings
  Array and Strings
- Linked List
  Linked List
- Trees and Graphs
  Trees and Graphs
- Backtracking
  Backtracking
- Sorting and Searching
  Sorting and Searching
- Dynamic Programming
  Dynamic Programming
- Design
  Design
- Math
  Math
  - 179. Largest Number
  - 149. Max Points on a Line
- Others
  Others
LeetCode Graph Theory
LeetCode Graph Theory
- Standard Traversal
  Standard Traversal
- BFS
  BFS
- Matrix Graphs
  Matrix Graphs
- Graph Theory
  Graph Theory
- Union Find / DSU
  Union Find / DSU
- Topological Sort
LeetCode Dynamic Programming
LeetCode Dynamic Programming
- Fibonacci style
  Fibonacci style
- Matrix
  Matrix
- On Strings
  On Strings
- Longest Increasing Subsequence
  Longest Increasing Subsequence
- Longest Common Subsequence
  Longest Common Subsequence
- Best Time to Buy & Sell Stock / State Machine
- On Trees
  On Trees
- Knapsack
  Knapsack
- General 1D
  General 1D
LeetCode Design
LeetCode Design
- Simple state and simulation
  Simple state and simulation
- Hash maps and indexed state
  Hash maps and indexed state
- Randomized arrays
  Randomized arrays
  - 381. Insert Delete GetRandom O(1) - Duplicates allowed
- Stacks, queues, and linked structures
  Stacks, queues, and linked structures
- Iterators and lazy traversal
  Iterators and lazy traversal
- Streaming counters and sliding windows
  Streaming counters and sliding windows
- Range queries and updates
- Time-indexed and versioned state
- Heaps, rankings, and order statistics
- Tries and prefix search
- Encoding and serialization
- Trees and hierarchical structures
- Intervals and reservations
- Ordered buckets and eviction caches
- Graph-backed services
- Composite event and marketplace systems
LeetCode SQL 50
LeetCode SQL 50
- SQL & Pandas Reference
  SQL & Pandas Reference
- Select
  Select
- Basic Joins
  Basic Joins
- Basic Aggregate Functions
  Basic Aggregate Functions
- Sorting and Grouping
  Sorting and Grouping
- Advanced Select and Joins
- Advanced String Functions / Regex / Clause
  Advanced String Functions / Regex / Clause
  - 1667. Fix Names in a Table
- Subqueries
  Subqueries

On this page

Micro pattern
Description
Problems

Home
Micro Pattern

Merge adjacent runs [mp]

Micro pattern¶

Description¶

Merge neighboring sorted runs and double their width after each pass.

Problems¶

Bottom-up merge sort (DSA)
Bottom-up merge sort linked list (DSA)
148. Sort List (Top Hard)

Memoized suffix decomposition [mp]

Minimal state [mp]

Copyright © 2026 Tony Aldon

Made with Zensical