Divide and Conquer

Engineering Articles & Deep Dives

Divide and Conquer Pattern and most asked problems like Merge Sort, Quick Sort, Maximum Subarray, and Count Inversions.

All Array / String Array + HashMap Sliding Window Two Pointer Linked List Binary Search Stack Matrix Trees DFS/BFS + BST Backtracking Heap and Priority Queue Graph + Topological Sort Dynamic Programming Prefix Sum Greedy Interval Divide and Conquer Union-Find (Disjoint Set Union) Trie Bit Manipulation Math / Number Theory
Divide and Conquer
Merge Sort [Medium]
02 Sep 2026 3 min read
Read Article →