Divide and Conquer in Python with Tests

Divide and Conquer holds 33 problems (4 Easy, 21 Medium, 8 Hard). Generate any of them into the current directory with lcpy gen -n <number>.

#	Problem	Difficulty	Solution
4	Median of Two Sorted Arrays	Hard	solution.py
23	Merge k Sorted Lists	Hard	solution.py
53	Maximum Subarray	Medium	solution.py
105	Construct Binary Tree from Preorder and Inorder Traversal	Medium	solution.py
106	Construct Binary Tree from Inorder and Postorder Traversal	Medium	solution.py
108	Convert Sorted Array to Binary Search Tree	Easy	solution.py
109	Convert Sorted List to Binary Search Tree	Medium	solution.py
148	Sort List	Medium	solution.py
169	Majority Element	Easy	solution.py
190	Reverse Bits	Easy	solution.py
191	Number of 1 Bits	Easy	solution.py
215	Kth Largest Element in an Array	Medium	solution.py
218	The Skyline Problem	Hard	solution.py
240	Search a 2D Matrix II	Medium	solution.py
307	Range Sum Query - Mutable	Medium	solution.py
315	Count of Smaller Numbers After Self	Hard	solution.py
324	Wiggle Sort II	Medium	solution.py
327	Count of Range Sum	Hard	solution.py
347	Top K Frequent Elements	Medium	solution.py
372	Super Pow	Medium	solution.py
395	Longest Substring with At Least K Repeating Characters	Medium	solution.py
427	Construct Quad Tree	Medium	solution.py
493	Reverse Pairs	Hard	solution.py
558	Logical OR of Two Binary Grids Represented as Quad-Trees	Medium	solution.py
654	Maximum Binary Tree	Medium	solution.py
761	Special Binary String	Hard	solution.py
889	Construct Binary Tree from Preorder and Postorder Traversal	Medium	solution.py
912	Sort an Array	Medium	solution.py
918	Maximum Sum Circular Subarray	Medium	solution.py
932	Beautiful Array	Medium	solution.py
973	K Closest Points to Origin	Medium	solution.py
1274	Number of Ships in a Rectangle	Hard	solution.py
1985	Find the Kth Largest Integer in the Array	Medium	solution.py

Welcome

Getting Started

Practice

CLI

Catalog

Contributing

Troubleshooting

Divide and Conquer in Python with Tests