dsa2 min read
Median of Two Sorted Arrays — Binary Search on Partition
Find the median of two sorted arrays in O(log(min(m,n))) by binary searching for the correct partition point.
Read →
Partition
4 articles
dsa1 min read
Kth Element of Two Sorted Arrays — Binary Search Elimination
Find the kth smallest element from two sorted arrays in O(log(m+n)) using binary elimination of k/2 elements per step.
Read →
dsa2 min read
Partition Problems: Equal Subset Sum and K Equal Parts
Solve partition backtracking problems: equal sum subset (NP-hard, backtrack with pruning) and k equal sum subsets.
Read →
dsa2 min read
Restore IP Addresses and Word Break II: Partition Backtracking
Generate valid IP addresses from digit strings and all sentence segmentations with word break backtracking.
Read →