divide and conquer Problems

Algorithms

9 problems

#	Title	Acceptance	Difficulty
1	Reverse every K-element Sub-list (medium) linked list array recursion +1 more	53.1%	Med.
2	Maximum Width of Binary Tree (medium) binary tree breadth-first search tree depth first search +3 more	32.1%	Med.
3	Problem Challenge 2 (medium) graph breadth-first search depth-first search +4 more	62.6%	Med.
4	Problem Challenge 1: Evaluate Expression (hard) recursion divide and conquer dynamic programming	67.2%	hard
5	Problem Challenge 1: Search Bitonic Array (medium) binary search array recursion +1 more	31.2%	Med.
6	Problem Challenge 3: Rotation Count (medium) binary search array recursion +1 more	24.3%	Med.
7	Equal Subset Sum Partition (medium) dynamic programming recursion greedy algorithm +2 more	42.7%	Med.
8	Factor Combinations (medium) recursion backtracking divide and conquer +1 more	36.3%	Med.
9	Find Minimum in Rotated Sorted Array (medium) binary search array sorting +2 more	26.0%	Med.