Topic: Divide and Conquer

alleasymediumhard

alltodoattemptedfailedsolved

42 problems

#	Title	Status	Difficulty	Topics	Accept
4	Median of Two Sorted Arrays	—	Hard	ArrayBinary SearchDivide and Conquer	44%
23	Merge k Sorted Lists	—	Hard	Linked ListDivide and ConquerHeap (Priority Queue)	56%
53	Maximum Subarray	—	Medium	ArrayDivide and ConquerDynamic Programming	52%
105	Construct Binary Tree from Preorder and Inorder Traversal	—	Medium	ArrayHash TableDivide and Conquer	67%
106	Construct Binary Tree from Inorder and Postorder Traversal	—	Medium	ArrayHash TableDivide and Conquer	66%
108	Convert Sorted Array to Binary Search Tree	—	Easy	ArrayDivide and ConquerTree	74%
109	Convert Sorted List to Binary Search Tree	—	Medium	Linked ListDivide and ConquerTree	64%
148	Sort List	—	Medium	Linked ListTwo PointersDivide and Conquer	61%
169	Majority Element	—	Easy	ArrayHash TableDivide and Conquer	66%
190	Reverse Bits	—	Easy	Divide and ConquerBit Manipulation	63%
191	Number of 1 Bits	—	Easy	Divide and ConquerBit Manipulation	74%
215	Kth Largest Element in an Array	—	Medium	ArrayDivide and ConquerSorting	68%
218	The Skyline Problemread	—	Hard	ArrayDivide and ConquerBinary Indexed Tree	44%
240	Search a 2D Matrix II	—	Medium	ArrayBinary SearchDivide and Conquer	55%
315	Count of Smaller Numbers After Self	—	Hard	ArrayBinary SearchDivide and Conquer	43%
324	Wiggle Sort IIread	—	Medium	ArrayDivide and ConquerGreedy	36%
327	Count of Range Sum	—	Hard	ArrayBinary SearchDivide and Conquer	37%
347	Top K Frequent Elementsread	—	Medium	ArrayHash TableDivide and Conquer	64%
372	Super Pow	—	Medium	MathDivide and Conquer	35%
395	Longest Substring with At Least K Repeating Charactersread	—	Medium	Hash TableStringDivide and Conquer	45%
427	Construct Quad Tree	—	Medium	ArrayDivide and ConquerTree	77%
493	Reverse Pairs	—	Hard	ArrayBinary SearchDivide and Conquer	32%
558	Logical OR of Two Binary Grids Represented as Quad-Treesread	—	Medium	Divide and ConquerTree	50%
654	Maximum Binary Tree	—	Medium	ArrayDivide and ConquerStack	86%
889	Construct Binary Tree from Preorder and Postorder Traversal	—	Medium	ArrayHash TableDivide and Conquer	78%
912	Sort an Array	—	Medium	ArrayDivide and ConquerSorting	57%
918	Maximum Sum Circular Subarray	—	Medium	ArrayDivide and ConquerDynamic Programming	47%
932	Beautiful Array	—	Medium	ArrayMathDivide and Conquer	67%
973	K Closest Points to Origin	—	Medium	ArrayMathDivide and Conquer	68%
1382	Balance a Binary Search Treeread	—	Medium	Divide and ConquerGreedyTree	85%
1569	Number of Ways to Reorder Array to Get Same BSTread	—	Hard	ArrayMathDivide and Conquer	54%
1649	Create Sorted Array through Instructionsread	—	Hard	ArrayBinary SearchDivide and Conquer	40%
1738	Find Kth Largest XOR Coordinate Valueread	—	Medium	ArrayDivide and ConquerBit Manipulation	63%
1763	Longest Nice Substringread	—	Easy	Hash TableStringDivide and Conquer	62%
1982	Find Array Given Subset Sumsread	—	Hard	ArrayDivide and Conquer	49%
1985	Find the Kth Largest Integer in the Arrayread	—	Medium	ArrayStringDivide and Conquer	47%
2179	Count Good Triplets in an Array	—	Hard	ArrayBinary SearchDivide and Conquer	66%
2343	Query Kth Smallest Trimmed Numberread	—	Medium	ArrayStringDivide and Conquer	45%
2407	Longest Increasing Subsequence IIread	—	Hard	ArrayDivide and ConquerDynamic Programming	25%
2426	Number of Pairs Satisfying Inequalityread	—	Hard	ArrayBinary SearchDivide and Conquer	45%
3165	Maximum Sum of Subsequence With Non-adjacent Elementsread	—	Hard	ArrayDivide and ConquerDynamic Programming	16%
3537	Fill a Special Gridread	—	Medium	ArrayDivide and ConquerMatrix	68%