A collection of LeetCode problems solved using Binary Search pattern techniques, explanations, and complexity analysis.
| # | Problem | Language | Time | Space | Explanation |
|---|---|---|---|---|---|
| 35 | Search Insert Position | Python | O(log n) | O(1) | Explanation |
| 104 | Maximum Depth of Binary Tree | PHP | O(n) | O(1) | Explanation |
| 108 | Convert Sorted Array to Binary Search Tree | PHP | O(n) | O(1) | Explanation |
| 110 | Balanced Binary Tree | PHP | O(n) | O(1) | Explanation |
| 111 | Minimum Depth of Binary Tree | PHP | O(n) | O(1) | Explanation |
| 226 | Invert Binary Tree | PHP | O(n) | O(1) | Explanation |
| 257 | Binary Tree Paths | PHP | O(n) | O(1) | Explanation |
| 338 | Counting Bits | C++ | O(n) | O(1) | Explanation |
| 501 | Find Mode in Binary Search Tree | Python | O(n) | O(1) | Explanation |
| 530 | Minimum Absolute Difference in BST | Python | O(n) | O(1) | Explanation |
| 543 | Diameter of Binary Tree | Python | O(n) | O(1) | Explanation |
| 563 | Binary Tree Tilt | Python | O(n) | O(1) | Explanation |
| 628 | Maximum Product of Three Numbers | Elixir | O(n) | O(1) | Explanation |
| 637 | Average of Levels in Binary Tree | Python | O(n) | O(1) | Explanation |
| 700 | Search in a Binary Search Tree | Python | O(n) | O(1) | Explanation |
| 704 | Binary Search | Python | O(log n) | O(1) | Explanation |
| 783 | Minimum Distance Between BST Nodes | Python | O(n) | O(1) | Explanation |
| 897 | Increasing Order Search Tree | Python | O(n) | O(1) | Explanation |
| 938 | Range Sum of BST | Python | O(n) | O(1) | Explanation |
| 965 | Univalued Binary Tree | Python | O(n) | O(1) | Explanation |
| 993 | Cousins in Binary Tree | Python | O(n) | O(1) | Explanation |
| 1290 | Convert Binary Number in a Linked List to Integer | Python | O(n) | O(1) | Explanation |
| 1331 | Rank Transform of an Array | Kotlin | O(n) | O(1) | Explanation |
| 1379 | Find a Corresponding Node of a Binary Tree in a Clone of That Tree | Python | O(n) | O(1) | Explanation |
| 1464 | Maximum Product of Two Elements in an Array | Scala | O(n) | O(1) | Explanation |
| 1752 | Check if Array Is Sorted and Rotated | C++ | O(n) | O(1) | Explanation |
| 3875 | Construct Uniform Parity Array I | C++ | O(n) | O(1) | Explanation |
| # | Problem | Language | Time | Space | Explanation |
|---|---|---|---|---|---|
| 15 | 3Sum | JavaScript | O(log n) | O(1) | Explanation |
| 16 | 3Sum Closest | JavaScript | O(log n) | O(1) | Explanation |
| 18 | 4Sum | C++ | O(log n) | O(1) | Explanation |
| 33 | Search in Rotated Sorted Array | C++ | O(log n) | O(1) | Explanation |
| 34 | Find First and Last Position of Element in Sorted Array | Python | O(log n) | O(1) | Explanation |
| 81 | Search in Rotated Sorted Array II | PHP | O(n) | O(1) | Explanation |
| 153 | Find Minimum in Rotated Sorted Array | C++ | O(log n) | O(1) | Explanation |
| 653 | Two Sum Iv Input Is A Bst | Python | O(n) | O(1) | Explanation |
| 788 | Rotated Digits | C++ | O(n) | O(1) | Explanation |
| 1288 | Remove Covered Intervals | Java | O(log n) | O(1) | Explanation |
| 1833 | Maximum Ice Cream Bars | Java | O(n) | O(1) | Explanation |
| 1846 | Maximum Element After Decreasing and Rearranging | Java | O(log n) | O(1) | Explanation |
| 2196 | Create Binary Tree From Descriptions | Java | O(n) | O(1) | Explanation |
| 3524 | Find X Value of Array I | JavaScript | O(n) | O(1) | Explanation |
| 3689 | Maximum Total Subarray Value I | Java | O(n) | O(1) | Explanation |
| # | Problem | Language | Time | Space | Explanation |
|---|---|---|---|---|---|
| 4 | Median of Two Sorted Arrays | Python | O(n) | O(1) | Explanation |
| 154 | Find Minimum in Rotated Sorted Array II | C++ | O(n) | O(1) | Explanation |
| 1665 | Minimum Initial Energy to Finish Tasks | C++ | O(log n) | O(1) | Explanation |
| 2213 | Longest Substring of One Repeating Character | Java | O(n) | O(1) | Explanation |
| 3525 | Find X Value of Array II | JavaScript | O(n) | O(1) | Explanation |