{"id":20505104,"url":"https://github.com/dhrupad17/leetcode_binarysearchstudyplanii","last_synced_at":"2026-03-19T16:09:15.671Z","repository":{"id":38277680,"uuid":"503599345","full_name":"dhrupad17/LeetCode_BinarySearchStudyPlanII","owner":"dhrupad17","description":"In computer science, binary search, also known as half-interval search or logarithmic search, is a search algorithm that is commonly used to find the position of a target value within a sorted array. However, the binary search algorithm is not limited to arrays. In any scenario where one can determine if the target value is higher or lower than a given value, binary search can be used to repeatedly halve the search space for a target value.","archived":false,"fork":false,"pushed_at":"2022-06-28T05:23:40.000Z","size":69,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-07-18T06:24:16.798Z","etag":null,"topics":["array","binary-search","greedy","hashtable","leetcode","leetcode-solutions","math","sorting","string","tree","two-pointers"],"latest_commit_sha":null,"homepage":"https://leetcode.com/study-plan/binary-search/?progress=k8xhj25","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/dhrupad17.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2022-06-15T03:19:47.000Z","updated_at":"2022-06-22T04:16:15.000Z","dependencies_parsed_at":"2022-08-26T08:31:56.914Z","dependency_job_id":null,"html_url":"https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/dhrupad17/LeetCode_BinarySearchStudyPlanII","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dhrupad17%2FLeetCode_BinarySearchStudyPlanII","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dhrupad17%2FLeetCode_BinarySearchStudyPlanII/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dhrupad17%2FLeetCode_BinarySearchStudyPlanII/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dhrupad17%2FLeetCode_BinarySearchStudyPlanII/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dhrupad17","download_url":"https://codeload.github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dhrupad17%2FLeetCode_BinarySearchStudyPlanII/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29114956,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-05T05:31:32.482Z","status":"ssl_error","status_checked_at":"2026-02-05T05:31:29.075Z","response_time":65,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["array","binary-search","greedy","hashtable","leetcode","leetcode-solutions","math","sorting","string","tree","two-pointers"],"created_at":"2024-11-15T19:43:46.618Z","updated_at":"2026-02-05T07:01:40.445Z","avatar_url":"https://github.com/dhrupad17.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# [LEETCODE BINARY SEARCH STUDY PLAN II](https://leetcode.com/study-plan/binary-search/?progress=k8xhj25)\n\u003cp float=\"left\"\u003e\n  \u003cimg src=\"https://assets.leetcode.com/study_plan/binary-search/cover.png\" width=\"150\" /\u003e\n  \u003cimg src=\"https://upload.wikimedia.org/wikipedia/commons/0/0a/LeetCode_Logo_black_with_text.svg\" width=\"600\" /\u003e \n\u003c/p\u003e\n\n![-----------------------------------------------------](https://raw.githubusercontent.com/andreasbm/readme/master/assets/lines/rainbow.png)\n\n\n## Questions\n\n| DAYS  | LEETCODE PROBLEM NO |  NAME                         |  DIFFICULTY  |   SOLUTIONS                                                    |\n| :-----| :------------------ | :---------------------------- | :----------- |  :------------------------------------------------------------ |\n| DAY1  | 209                 | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY1P1.md) |\n|     | 611 | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY1P2.md) |\n| DAY2 | 658 | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY2P1.md) |\n|    | 1894 | [Find the Student that Will Replace the Chalk](https://leetcode.com/problems/find-the-student-that-will-replace-the-chalk/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY2P2.md) |\n| DAY3 | 300 | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY3P1.md) |\n|  | 1760 | [Minimum Limit of Balls in a Bag](https://leetcode.com/problems/minimum-limit-of-balls-in-a-bag/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY3P2.md) |\n| DAY4 | 875 | [Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY4P1.md) |\n|  | 1552 | [Magnetic Force Between Two Balls](https://leetcode.com/problems/magnetic-force-between-two-balls/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY4P2.md) |\n| DAY5 | 287 | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY5P1.md) |\n|  | 1283 | [Find the Smallest Divisor Given a Threshold](https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY5P2.md) |\n| DAY6 | 1898 | [Maximum Number of Removable Characters](https://leetcode.com/problems/maximum-number-of-removable-characters/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY6P1.md) |\n|  | 1870 | [Minimum Speed to Arrive on Time](https://leetcode.com/problems/minimum-speed-to-arrive-on-time/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY6P2.md) |\n| DAY7 | 1482 | [Minimum Number of Days to Make m Bouquets](https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY7P1.md) |\n|  | 1818 | [Minimum Absolute Sum Difference](https://leetcode.com/problems/minimum-absolute-sum-difference/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY7P2.md) |\n| DAY8 | 240 | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY8P1.md) |\n|  | 275 | [H-Index II](https://leetcode.com/problems/h-index-ii/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY8P2.md) |\n| DAY9 | 1838 | [Frequency of the Most Frequent Element](https://leetcode.com/problems/frequency-of-the-most-frequent-element/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY9P1.md) |\n|  | 540 | [Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY9P2.md) |\n| DAY10 | 222 | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY10P1.md) |\n|  | 1712 | [Ways to Split Array Into Three Subarrays](https://leetcode.com/problems/ways-to-split-array-into-three-subarrays/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY10P2.md) |\n| DAY11 | 826 | [Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY11P1.md) |\n|  | 436 | [Find Right Interval](https://leetcode.com/problems/find-right-interval/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY11P2.md) |\n| DAY12 | 81 | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY12P1.md) |\n|  | 162 | [Find Peak Element](https://leetcode.com/problems/find-peak-element/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY12P2.md) |\n| DAY13 | 154 | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/) | `Hard` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY13P1.md) |\n|  | 528 | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY13P2.md) |\n| DAY14 | 1508 | [Range Sum of Sorted Subarray Sums](https://leetcode.com/problems/range-sum-of-sorted-subarray-sums/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY14P1.md) |\n|  | 1574 | [Shortest Subarray to be Removed to Make Array Sorted](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY14P2.md) |\n| DAY15 | 1292 | [Maximum Side Length of a Square with Sum Less than or Equal to Threshold](https://leetcode.com/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY15P1.md) |\n|  | 1498 | [Number of Subsequences That Satisfy the Given Sum Condition](https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY15P2.md) |\n| DAY16 | 981 | [Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY16P1.md) |\n|  | 1300 | [Sum of Mutated Array Closest to Target](https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY16P2.md) |\n| DAY17 | 1802 | [Maximum Value at a Given Index in a Bounded Array](https://leetcode.com/problems/maximum-value-at-a-given-index-in-a-bounded-array/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY17P1.md) |\n|  | 1901 | [Find a Peak Element II](https://leetcode.com/problems/find-a-peak-element-ii/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY17P2.md) |\n| DAY18 | 1146 | [Snapshot Array](https://leetcode.com/problems/snapshot-array/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY18P1.md) |\n|  | 1488 | [Avoid Flood in The City](https://leetcode.com/problems/avoid-flood-in-the-city/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY18P2.md) |\n| DAY19 | 1562 | [Find Latest Group of Size M](https://leetcode.com/problems/find-latest-group-of-size-m/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY19P1.md) |\n|  | 1648 | [Sell Diminishing-Valued Colored Balls](https://leetcode.com/problems/sell-diminishing-valued-colored-balls/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY19P2.md) |\n| DAY20 | 1201 | [Ugly Number III](https://leetcode.com/problems/ugly-number-iii/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY20P1.md) |\n|  | 911 | [Online Election](https://leetcode.com/problems/online-election/) | `Medium` | 👉[Click Here](https://github.com/dhrupad17/LeetCode_BinarySearchStudyPlanII/blob/main/DAY20P2.md) |\n## 🛠 Skills\n`Binary Search`, `Arrays`, `Data Structures`, `java`\n\n## 🎖️ Badges\n![LeetCode](https://img.shields.io/badge/LeetCode-000000?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=#d16c06)\n![Java](https://img.shields.io/badge/Java-ED8B00?style=for-the-badge\u0026logo=java\u0026logoColor=white)\n![GitHub](https://img.shields.io/badge/github-%23121011.svg?style=for-the-badge\u0026logo=github\u0026logoColor=white)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdhrupad17%2Fleetcode_binarysearchstudyplanii","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdhrupad17%2Fleetcode_binarysearchstudyplanii","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdhrupad17%2Fleetcode_binarysearchstudyplanii/lists"}