{"id":510,"date":"2025-07-03T12:13:30","date_gmt":"2025-07-03T06:43:30","guid":{"rendered":"https:\/\/codeanddebug.in\/blog\/?p=510"},"modified":"2025-07-03T12:14:07","modified_gmt":"2025-07-03T06:44:07","slug":"count-occurrences-of-a-number-in-a-sorted-array-with-duplicates","status":"publish","type":"post","link":"https:\/\/codeanddebug.in\/blog\/count-occurrences-of-a-number-in-a-sorted-array-with-duplicates\/","title":{"rendered":"Count occurrences of a number in a sorted array with duplicates | Optimal Binary Search"},"content":{"rendered":"\n<p>Given a&nbsp;<strong>sorted&nbsp;<\/strong>array,&nbsp;<strong>arr[]&nbsp;<\/strong>and a number&nbsp;<strong>target<\/strong>, you need to find the number of occurrences of<strong>&nbsp;target<\/strong>&nbsp;in&nbsp;<strong>arr[]<\/strong>.&nbsp;<\/p>\n\n\n\n<p>Here&#8217;s the [<strong><a href=\"https:\/\/www.geeksforgeeks.org\/problems\/number-of-occurrence2259\/1\" target=\"_blank\" rel=\"noreferrer noopener\"><mark style=\"background-color:rgba(0, 0, 0, 0)\" class=\"has-inline-color has-vivid-purple-color\"><span style=\"text-decoration: underline;\">Problem Link<\/span><\/mark><\/a><\/strong>] to begin with.<\/p>\n\n\n\n<p><strong>Examples :<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-preformatted\"><strong>Input: <\/strong>arr[] = [1, 1, 2, 2, 2, 2, 3], target = 2\n<strong>Output:<\/strong> 4\n<strong>Explanation:<\/strong> target = 2 occurs 4 times in the given array so the output is 4.<\/pre>\n\n\n\n<pre class=\"wp-block-preformatted\"><strong>Input:<\/strong> arr[] = [1, 1, 2, 2, 2, 2, 3], target = 4\n<strong>Output:<\/strong> 0\n<strong>Explanation:<\/strong> target = 4 is not present in the given array so the output is 0.<\/pre>\n\n\n\n<pre class=\"wp-block-preformatted\"><strong>Input:<\/strong> arr[] = [8, 9, 10, 12, 12, 12], target = 12\n<strong>Output:<\/strong> 3\n<strong>Explanation:<\/strong> target = 12 occurs 3 times in the given array so the output is 3.<\/pre>\n\n\n\n<p><strong>Constraints:<\/strong><br>1 \u2264 arr.size() \u2264 10<sup>6<\/sup><br>1 \u2264 arr[i] \u2264 10<sup>6<\/sup><br>1 \u2264 target \u2264 10<sup>6<\/sup><\/p>\n\n\n<div style=\"max-width: -moz-fit-content; \" class=\"wp-block-ub-table-of-contents-block ub_table-of-contents ub_table-of-contents-collapsed\" id=\"ub_table-of-contents-18da5bd5-09a9-494e-ba1d-66cbc8185e13\" data-linktodivider=\"false\" data-showtext=\"show\" data-hidetext=\"hide\" data-scrolltype=\"auto\" data-enablesmoothscroll=\"true\" data-initiallyhideonmobile=\"false\" data-initiallyshow=\"false\"><div class=\"ub_table-of-contents-header-container\" style=\"\">\n\t\t\t<div class=\"ub_table-of-contents-header\" style=\"text-align: left; \">\n\t\t\t\t<div class=\"ub_table-of-contents-title\">Contents:<\/div>\n\t\t\t\t<div class=\"ub_table-of-contents-header-toggle\">\n\t\t\t<div class=\"ub_table-of-contents-toggle\" style=\"\">\n\t\t\t\u00a0[<a class=\"ub_table-of-contents-toggle-link\" href=\"#\" style=\"\">show<\/a>]\n\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t<\/div>\n\t\t<\/div><div class=\"ub_table-of-contents-extra-container\" style=\"\">\n\t\t\t<div class=\"ub_table-of-contents-container ub_table-of-contents-1-column ub-hide\">\n\t\t\t\t<ul style=\"\"><li style=\"\"><a href=\"https:\/\/codeanddebug.in\/blog\/count-occurrences-of-a-number-in-a-sorted-array-with-duplicates\/#0-optimal-solution-binary-search-bounds\" style=\"\">Optimal Solution (Binary-Search Bounds)<\/a><ul><li style=\"\"><a href=\"https:\/\/codeanddebug.in\/blog\/count-occurrences-of-a-number-in-a-sorted-array-with-duplicates\/#1-intuition-amp-approach\" style=\"\">Intuition &amp; Approach<\/a><\/li><li style=\"\"><a href=\"https:\/\/codeanddebug.in\/blog\/count-occurrences-of-a-number-in-a-sorted-array-with-duplicates\/#2-code-implementation\" style=\"\">Code Implementation<\/a><\/li><li style=\"\"><a href=\"https:\/\/codeanddebug.in\/blog\/count-occurrences-of-a-number-in-a-sorted-array-with-duplicates\/#3-code-explanation\" style=\"\">Code Explanation<\/a><\/li><li style=\"\"><a href=\"https:\/\/codeanddebug.in\/blog\/count-occurrences-of-a-number-in-a-sorted-array-with-duplicates\/#4-dry-run-arr-1-2-2-2-3-target-2-\" style=\"\">Dry Run (arr = [1, 2, 2, 2, 3], target = 2)<\/a><\/li><li style=\"\"><a href=\"https:\/\/codeanddebug.in\/blog\/count-occurrences-of-a-number-in-a-sorted-array-with-duplicates\/#5-time-amp-space-complexity\" style=\"\">Time &amp; Space Complexity<\/a><\/li><li style=\"\"><a href=\"https:\/\/codeanddebug.in\/blog\/count-occurrences-of-a-number-in-a-sorted-array-with-duplicates\/#6-conclusion\" style=\"\">Conclusion<\/a><\/li><\/ul><\/li><\/ul>\n\t\t\t<\/div>\n\t\t<\/div><\/div>\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"0-optimal-solution-binary-search-bounds\">Optimal Solution (Binary-Search Bounds)<\/h2>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"1-intuition-amp-approach\">Intuition &amp; Approach<\/h3>\n\n\n\n<ol class=\"wp-block-list\">\n<li><strong>Lower Bound (<code>lb<\/code>)<\/strong> \u2013 index of the <strong>first<\/strong> element <code>\u2265 target<\/code>.<\/li>\n\n\n\n<li><strong>Upper Bound (<code>ub<\/code>)<\/strong> \u2013 index of the <strong>first<\/strong> element <code>> target<\/code>.<\/li>\n\n\n\n<li>The <strong>number of occurrences<\/strong> is simply <code>ub \u2013 lb<\/code> (length of the closed range holding <code>target<\/code>).<\/li>\n\n\n\n<li>If the lower-bound element isn\u2019t actually <code>target<\/code>, then <code>target<\/code> never appears \u2192 count = 0.<\/li>\n<\/ol>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"2-code-implementation\">Code Implementation<\/h3>\n\n\n\n<div class=\"wp-block-kevinbatdorf-code-block-pro padding-bottom-disabled cbp-has-line-numbers\" data-code-block-pro-font-family=\"Code-Pro-JetBrains-Mono\" style=\"font-size:.875rem;font-family:Code-Pro-JetBrains-Mono,ui-monospace,SFMono-Regular,Menlo,Monaco,Consolas,monospace;--cbp-line-number-color:#D4D4D4;--cbp-line-number-width:calc(2 * 0.6 * .875rem);line-height:1.25rem;--cbp-tab-width:2;tab-size:var(--cbp-tab-width, 2)\"><span style=\"display:block;padding:16px 0 0 16px;margin-bottom:-1px;width:100%;text-align:left;background-color:#1E1E1E\"><svg xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"54\" height=\"14\" viewBox=\"0 0 54 14\"><g fill=\"none\" fill-rule=\"evenodd\" transform=\"translate(1 1)\"><circle cx=\"6\" cy=\"6\" r=\"6\" fill=\"#FF5F56\" stroke=\"#E0443E\" stroke-width=\".5\"><\/circle><circle cx=\"26\" cy=\"6\" r=\"6\" fill=\"#FFBD2E\" stroke=\"#DEA123\" stroke-width=\".5\"><\/circle><circle cx=\"46\" cy=\"6\" r=\"6\" fill=\"#27C93F\" stroke=\"#1AAB29\" stroke-width=\".5\"><\/circle><\/g><\/svg><\/span><span role=\"button\" tabindex=\"0\" data-code=\"class Solution:\n    # ---------- helper: first index with value &gt;= target ----------\n    def lower_bound(self, nums, target):\n        n = len(nums)\n        lb  = -1              # default when target isn't found\n        low, high = 0, n - 1\n\n        while low &lt;= high:\n            mid = (low + high) \/\/ 2\n            if nums[mid] &gt;= target:\n                lb  = mid          # potential first position\n                high = mid - 1     # keep searching left half\n            else:                  # nums[mid] &lt; target\n                low = mid + 1\n        return lb\n\n    # ---------- helper: first index with value &gt; target ----------\n    def upper_bound(self, nums, target):\n        n = len(nums)\n        ub  = n               # default when all elements &lt;= target\n        low, high = 0, n - 1\n\n        while low &lt;= high:\n            mid = (low + high) \/\/ 2\n            if nums[mid] &gt; target:\n                ub  = mid          # potential upper bound\n                high = mid - 1     # look further left\n            else:                  # nums[mid] &lt;= target\n                low = mid + 1\n        return ub\n\n    # ---------- driver: count occurrences of target ----------\n    def countFreq(self, arr, target):\n        lb = self.lower_bound(arr, target)\n        # if target never appears, quick exit\n        if lb == -1 or arr[lb] != target:\n            return 0\n\n        ub = self.upper_bound(arr, target)\n        return ub - lb            # total number of occurrences\" style=\"color:#D4D4D4;display:none\" aria-label=\"Copy\" class=\"code-block-pro-copy-button\"><svg xmlns=\"http:\/\/www.w3.org\/2000\/svg\" style=\"width:24px;height:24px\" fill=\"none\" viewBox=\"0 0 24 24\" stroke=\"currentColor\" stroke-width=\"2\"><path class=\"with-check\" stroke-linecap=\"round\" stroke-linejoin=\"round\" d=\"M9 5H7a2 2 0 00-2 2v12a2 2 0 002 2h10a2 2 0 002-2V7a2 2 0 00-2-2h-2M9 5a2 2 0 002 2h2a2 2 0 002-2M9 5a2 2 0 012-2h2a2 2 0 012 2m-6 9l2 2 4-4\"><\/path><path class=\"without-check\" stroke-linecap=\"round\" stroke-linejoin=\"round\" d=\"M9 5H7a2 2 0 00-2 2v12a2 2 0 002 2h10a2 2 0 002-2V7a2 2 0 00-2-2h-2M9 5a2 2 0 002 2h2a2 2 0 002-2M9 5a2 2 0 012-2h2a2 2 0 012 2\"><\/path><\/svg><\/span><pre class=\"shiki dark-plus\" style=\"background-color: #1E1E1E\" tabindex=\"0\"><code><span class=\"line\"><span style=\"color: #569CD6\">class<\/span><span style=\"color: #D4D4D4\"> <\/span><span style=\"color: #4EC9B0\">Solution<\/span><span style=\"color: #D4D4D4\">:<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">    <\/span><span style=\"color: #6A9955\"># ---------- helper: first index with value &gt;= target ----------<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">    <\/span><span style=\"color: #569CD6\">def<\/span><span style=\"color: #D4D4D4\"> <\/span><span style=\"color: #DCDCAA\">lower_bound<\/span><span style=\"color: #D4D4D4\">(<\/span><span style=\"color: #9CDCFE\">self<\/span><span style=\"color: #D4D4D4\">, <\/span><span style=\"color: #9CDCFE\">nums<\/span><span style=\"color: #D4D4D4\">, <\/span><span style=\"color: #9CDCFE\">target<\/span><span style=\"color: #D4D4D4\">):<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        n = <\/span><span style=\"color: #DCDCAA\">len<\/span><span style=\"color: #D4D4D4\">(nums)<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        lb  = -<\/span><span style=\"color: #B5CEA8\">1<\/span><span style=\"color: #D4D4D4\">              <\/span><span style=\"color: #6A9955\"># default when target isn&#39;t found<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        low, high = <\/span><span style=\"color: #B5CEA8\">0<\/span><span style=\"color: #D4D4D4\">, n - <\/span><span style=\"color: #B5CEA8\">1<\/span><\/span>\n<span class=\"line\"><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        <\/span><span style=\"color: #C586C0\">while<\/span><span style=\"color: #D4D4D4\"> low &lt;= high:<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">            mid = (low + high) \/\/ <\/span><span style=\"color: #B5CEA8\">2<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">            <\/span><span style=\"color: #C586C0\">if<\/span><span style=\"color: #D4D4D4\"> nums[mid] &gt;= target:<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">                lb  = mid          <\/span><span style=\"color: #6A9955\"># potential first position<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">                high = mid - <\/span><span style=\"color: #B5CEA8\">1<\/span><span style=\"color: #D4D4D4\">     <\/span><span style=\"color: #6A9955\"># keep searching left half<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">            <\/span><span style=\"color: #C586C0\">else<\/span><span style=\"color: #D4D4D4\">:                  <\/span><span style=\"color: #6A9955\"># nums[mid] &lt; target<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">                low = mid + <\/span><span style=\"color: #B5CEA8\">1<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        <\/span><span style=\"color: #C586C0\">return<\/span><span style=\"color: #D4D4D4\"> lb<\/span><\/span>\n<span class=\"line\"><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">    <\/span><span style=\"color: #6A9955\"># ---------- helper: first index with value &gt; target ----------<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">    <\/span><span style=\"color: #569CD6\">def<\/span><span style=\"color: #D4D4D4\"> <\/span><span style=\"color: #DCDCAA\">upper_bound<\/span><span style=\"color: #D4D4D4\">(<\/span><span style=\"color: #9CDCFE\">self<\/span><span style=\"color: #D4D4D4\">, <\/span><span style=\"color: #9CDCFE\">nums<\/span><span style=\"color: #D4D4D4\">, <\/span><span style=\"color: #9CDCFE\">target<\/span><span style=\"color: #D4D4D4\">):<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        n = <\/span><span style=\"color: #DCDCAA\">len<\/span><span style=\"color: #D4D4D4\">(nums)<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        ub  = n               <\/span><span style=\"color: #6A9955\"># default when all elements &lt;= target<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        low, high = <\/span><span style=\"color: #B5CEA8\">0<\/span><span style=\"color: #D4D4D4\">, n - <\/span><span style=\"color: #B5CEA8\">1<\/span><\/span>\n<span class=\"line\"><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        <\/span><span style=\"color: #C586C0\">while<\/span><span style=\"color: #D4D4D4\"> low &lt;= high:<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">            mid = (low + high) \/\/ <\/span><span style=\"color: #B5CEA8\">2<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">            <\/span><span style=\"color: #C586C0\">if<\/span><span style=\"color: #D4D4D4\"> nums[mid] &gt; target:<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">                ub  = mid          <\/span><span style=\"color: #6A9955\"># potential upper bound<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">                high = mid - <\/span><span style=\"color: #B5CEA8\">1<\/span><span style=\"color: #D4D4D4\">     <\/span><span style=\"color: #6A9955\"># look further left<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">            <\/span><span style=\"color: #C586C0\">else<\/span><span style=\"color: #D4D4D4\">:                  <\/span><span style=\"color: #6A9955\"># nums[mid] &lt;= target<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">                low = mid + <\/span><span style=\"color: #B5CEA8\">1<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        <\/span><span style=\"color: #C586C0\">return<\/span><span style=\"color: #D4D4D4\"> ub<\/span><\/span>\n<span class=\"line\"><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">    <\/span><span style=\"color: #6A9955\"># ---------- driver: count occurrences of target ----------<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">    <\/span><span style=\"color: #569CD6\">def<\/span><span style=\"color: #D4D4D4\"> <\/span><span style=\"color: #DCDCAA\">countFreq<\/span><span style=\"color: #D4D4D4\">(<\/span><span style=\"color: #9CDCFE\">self<\/span><span style=\"color: #D4D4D4\">, <\/span><span style=\"color: #9CDCFE\">arr<\/span><span style=\"color: #D4D4D4\">, <\/span><span style=\"color: #9CDCFE\">target<\/span><span style=\"color: #D4D4D4\">):<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        lb = <\/span><span style=\"color: #569CD6\">self<\/span><span style=\"color: #D4D4D4\">.lower_bound(arr, target)<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        <\/span><span style=\"color: #6A9955\"># if target never appears, quick exit<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        <\/span><span style=\"color: #C586C0\">if<\/span><span style=\"color: #D4D4D4\"> lb == -<\/span><span style=\"color: #B5CEA8\">1<\/span><span style=\"color: #D4D4D4\"> <\/span><span style=\"color: #569CD6\">or<\/span><span style=\"color: #D4D4D4\"> arr[lb] != target:<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">            <\/span><span style=\"color: #C586C0\">return<\/span><span style=\"color: #D4D4D4\"> <\/span><span style=\"color: #B5CEA8\">0<\/span><\/span>\n<span class=\"line\"><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        ub = <\/span><span style=\"color: #569CD6\">self<\/span><span style=\"color: #D4D4D4\">.upper_bound(arr, target)<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        <\/span><span style=\"color: #C586C0\">return<\/span><span style=\"color: #D4D4D4\"> ub - lb            <\/span><span style=\"color: #6A9955\"># total number of occurrences<\/span><\/span><\/code><\/pre><span style=\"display:flex;align-items:flex-end;padding:10px;width:100%;justify-content:flex-end;background-color:#1E1E1E;color:#c7c7c7;font-size:12px;line-height:1;position:relative\">Python<\/span><\/div>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"3-code-explanation\">Code Explanation<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong><code>lower_bound<\/code><\/strong> narrows leftward whenever it meets a value <code>\u2265 target<\/code>, ensuring the final <code>lb<\/code> is the first such index\u2014or <code>-1<\/code> if no element is big enough.<\/li>\n\n\n\n<li><strong><code>upper_bound<\/code><\/strong> is identical except it searches for the first value <strong>strictly greater<\/strong> than <code>target<\/code>, returning <code>n<\/code> when everything is <code>\u2264 target<\/code>.<\/li>\n\n\n\n<li><strong>Count logic:<\/strong>\n<ul class=\"wp-block-list\">\n<li>If <code>arr[lb]<\/code> isn\u2019t exactly <code>target<\/code>, the value doesn\u2019t exist, so return <code>0<\/code>.<\/li>\n\n\n\n<li>Otherwise, every index from <code>lb<\/code> up to <code>ub \u2013 1<\/code> equals <code>target<\/code>, so the count is <code>ub \u2013 lb<\/code>.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"4-dry-run-arr-1-2-2-2-3-target-2-\">Dry Run (arr = <code>[1, 2, 2, 2, 3]<\/code>, target = <code>2<\/code>)<\/h3>\n\n\n\n<ol class=\"wp-block-list\">\n<li><strong>Lower bound<\/strong>\n<ul class=\"wp-block-list\">\n<li>Finds index <code>1<\/code> (first <code>2<\/code>).<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Upper bound<\/strong>\n<ul class=\"wp-block-list\">\n<li>Finds index <code>4<\/code> (first <code>> 2<\/code>, which is <code>3<\/code>).<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li>Count = <code>4 \u2013 1 = 3<\/code>.<\/li>\n<\/ol>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"5-time-amp-space-complexity\">Time &amp; Space Complexity<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Time:<\/strong> <code>O(log n)<\/code> \u2013 each bound is a binary search.<\/li>\n\n\n\n<li><strong>Space:<\/strong> <code>O(1)<\/code> \u2013 only a few integer variables.<\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"6-conclusion\">Conclusion<\/h3>\n\n\n\n<p>By combining two small tweaks of binary search, you can count a value\u2019s occurrences in a sorted array in logarithmic time, far faster than a linear scan, especially when the array is large. This pattern is a staple for frequency, range, and boundary problems on ordered data.<\/p>\n\n\n\n<div class=\"wp-block-buttons is-content-justification-center is-layout-flex wp-container-core-buttons-is-layout-16018d1d wp-block-buttons-is-layout-flex\">\n<div class=\"wp-block-button\"><a class=\"wp-block-button__link wp-element-button\" href=\"https:\/\/codeanddebug.in\/course\/zero-to-hero-python-dsa\" target=\"_blank\" rel=\"noreferrer noopener\">Join our Advance DSA COURSE<\/a><\/div>\n<\/div>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<p><em>For any changes to the article, kindly email at <a href=\"mailto:code@codeanddebug.in\" target=\"_blank\" rel=\"noreferrer noopener\">code@codeanddebug.in<\/a> or contact us at <a href=\"tel:+91-9712928220\" target=\"_blank\" rel=\"noreferrer noopener\">+91-9712928220<\/a>.<\/em><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Given a&nbsp;sorted&nbsp;array,&nbsp;arr[]&nbsp;and a number&nbsp;target, you need to find the number of occurrences of&nbsp;target&nbsp;in&nbsp;arr[].&nbsp; Here&#8217;s the [Problem Link] to begin with. Examples : Input: arr[] = [1, 1, 2, 2, 2, 2, 3], target = 2 Output: 4 Explanation: target = 2 occurs 4 times in the given array so the output is 4. Input: arr[]<\/p>\n","protected":false},"author":1,"featured_media":512,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3,4],"tags":[7,27],"class_list":{"0":"post-510","1":"post","2":"type-post","3":"status-publish","4":"format-standard","5":"has-post-thumbnail","7":"category-data-structures-and-algorithm","8":"category-beginner","9":"tag-array","10":"tag-binary-search"},"featured_image_src":"https:\/\/codeanddebug.in\/blog\/wp-content\/uploads\/2025\/07\/count-occurrences-of-a-number-in-a-sorted-array-with-duplicatesfind-first-and-last-position-of-element-in-sorted-array-featured-image.png","author_info":{"display_name":"codeanddebug","author_link":"https:\/\/codeanddebug.in\/blog\/author\/codeanddebug\/"},"_links":{"self":[{"href":"https:\/\/codeanddebug.in\/blog\/wp-json\/wp\/v2\/posts\/510","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/codeanddebug.in\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/codeanddebug.in\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/codeanddebug.in\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/codeanddebug.in\/blog\/wp-json\/wp\/v2\/comments?post=510"}],"version-history":[{"count":1,"href":"https:\/\/codeanddebug.in\/blog\/wp-json\/wp\/v2\/posts\/510\/revisions"}],"predecessor-version":[{"id":513,"href":"https:\/\/codeanddebug.in\/blog\/wp-json\/wp\/v2\/posts\/510\/revisions\/513"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/codeanddebug.in\/blog\/wp-json\/wp\/v2\/media\/512"}],"wp:attachment":[{"href":"https:\/\/codeanddebug.in\/blog\/wp-json\/wp\/v2\/media?parent=510"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/codeanddebug.in\/blog\/wp-json\/wp\/v2\/categories?post=510"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/codeanddebug.in\/blog\/wp-json\/wp\/v2\/tags?post=510"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}