{"id":964,"date":"2025-08-21T18:36:21","date_gmt":"2025-08-21T13:06:21","guid":{"rendered":"https:\/\/codeanddebug.in\/blog\/?p=964"},"modified":"2025-08-21T18:36:23","modified_gmt":"2025-08-21T13:06:23","slug":"minimum-platforms","status":"publish","type":"post","link":"https:\/\/codeanddebug.in\/blog\/minimum-platforms\/","title":{"rendered":"Minimum Platforms | Optimal Greedy Solution"},"content":{"rendered":"\n<p>This classic scheduling problem asks you to find the <strong>minimum number of railway platforms<\/strong> required so that <strong>no train has to wait<\/strong>. You are given two arrays: arrival times and departure times of trains at a station. The goal is to compute the smallest number of platforms needed so that every arriving train can be accommodated until it departs.<\/p>\n\n\n\n<p>Here&#8217;s the [<strong><a href=\"https:\/\/www.geeksforgeeks.org\/problems\/minimum-platforms-1587115620\/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<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<h2 class=\"wp-block-heading\">What does the problem say<\/h2>\n\n\n\n<p>Given two arrays:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>arr<\/strong> containing arrival times<\/li>\n\n\n\n<li><strong>dep<\/strong> containing departure times<\/li>\n<\/ul>\n\n\n\n<p>Find the <strong>minimum number of platforms<\/strong> required so that no train waits. A platform occupied by a train from its arrival time until its departure time cannot be used by another train in that interval.<\/p>\n\n\n\n<p><strong>Example 1<\/strong><\/p>\n\n\n\n<div class=\"wp-block-kevinbatdorf-code-block-pro 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(1 * 0.6 * .875rem);line-height:1.5rem;--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=\"arr = [900, 940, 950, 1100, 1500, 1800]\ndep = [910, 1200, 1120, 1130, 1900, 2000]\nOutput: 3\nExplanation:\nAt time around 950 to 1100 multiple trains overlap in the station, so three platforms are needed at peak.\" 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: #9CDCFE\">arr<\/span><span style=\"color: #D4D4D4\"> = [900, 940, 950, 1100, 1500, 1800]<\/span><\/span>\n<span class=\"line\"><span style=\"color: #9CDCFE\">dep<\/span><span style=\"color: #D4D4D4\"> = [910, 1200, 1120, 1130, 1900, 2000]<\/span><\/span>\n<span class=\"line\"><span style=\"color: #DCDCAA\">Output<\/span><span style=\"color: #D4D4D4\">: 3<\/span><\/span>\n<span class=\"line\"><span style=\"color: #DCDCAA\">Explanation<\/span><span style=\"color: #D4D4D4\">:<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">At time around 950 to 1100 multiple trains overlap in the station, so three platforms are needed at peak.<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n<p><strong>Example 2<\/strong><\/p>\n\n\n\n<div class=\"wp-block-kevinbatdorf-code-block-pro 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(1 * 0.6 * .875rem);line-height:1.5rem;--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=\"arr = [100, 200, 300]\ndep = [110, 210, 320]\nOutput: 1\nExplanation:\nNo overlaps beyond one at any time. One platform is sufficient.\" 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: #9CDCFE\">arr<\/span><span style=\"color: #D4D4D4\"> = [100, 200, 300]<\/span><\/span>\n<span class=\"line\"><span style=\"color: #9CDCFE\">dep<\/span><span style=\"color: #D4D4D4\"> = [110, 210, 320]<\/span><\/span>\n<span class=\"line\"><span style=\"color: #DCDCAA\">Output<\/span><span style=\"color: #D4D4D4\">: 1<\/span><\/span>\n<span class=\"line\"><span style=\"color: #DCDCAA\">Explanation<\/span><span style=\"color: #D4D4D4\">:<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">No overlaps beyond one at any time. One platform is sufficient.<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<h2 class=\"wp-block-heading\">Intuition and Approach (Optimal \u2013 Greedy Two-Pointer)<\/h2>\n\n\n\n<p>The peak number of trains present at the station at the same time equals the <strong>minimum platforms<\/strong> needed. To compute this efficiently:<\/p>\n\n\n\n<ol class=\"wp-block-list\">\n<li><strong>Sort<\/strong> both arrival and departure arrays independently in non-decreasing order.<\/li>\n\n\n\n<li>Use <strong>two pointers<\/strong>:\n<ul class=\"wp-block-list\">\n<li><code>i<\/code> points to the next arrival to process.<\/li>\n\n\n\n<li><code>j<\/code> points to the next departure to process.<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li>Maintain a running count of platforms currently needed:\n<ul class=\"wp-block-list\">\n<li>If the next <strong>arrival<\/strong> time is <strong>less than or equal to<\/strong> the next <strong>departure<\/strong> time, a new train arrives before the earliest train departs. Increase the count and advance <code>i<\/code>.<\/li>\n\n\n\n<li>Otherwise, the earliest train departs before the next arrival. Decrease the count and advance <code>j<\/code>.<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li>Track the <strong>maximum<\/strong> value of the count at any step. That maximum is the answer.<\/li>\n<\/ol>\n\n\n\n<p>Why this works:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Sorting allows us to sweep time from earliest events to latest.<\/li>\n\n\n\n<li>Comparing the next arrival against the next departure tells us whether the number of trains on platforms increases or decreases at that moment.<\/li>\n\n\n\n<li>The maximum concurrent trains over the sweep is exactly the minimum platforms required.<\/li>\n<\/ul>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<h2 class=\"wp-block-heading\">Code Implementation<\/h2>\n\n\n\n<p>Your provided optimal solution, with light comments only and no code changes:<\/p>\n\n\n\n<div class=\"wp-block-kevinbatdorf-code-block-pro 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.5rem;--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    def minimumPlatform(self, arr, dep):\n        arr.sort()\n        dep.sort()\n\n        ans = 1\n        count = 1\n        i = 1\n        j = 0\n        while i &lt; len(arr) and j &lt; len(dep):\n            if arr[i] &lt;= dep[j]:  # one more platform needed\n                count += 1\n                i += 1\n            else:  # one platform can be reduced\n                count -= 1\n                j += 1\n            ans = max(ans, count)\n        return ans\" 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: #569CD6\">def<\/span><span style=\"color: #D4D4D4\"> <\/span><span style=\"color: #DCDCAA\">minimumPlatform<\/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\">dep<\/span><span style=\"color: #D4D4D4\">):<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        arr.sort()<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        dep.sort()<\/span><\/span>\n<span class=\"line\"><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        ans = <\/span><span style=\"color: #B5CEA8\">1<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        count = <\/span><span style=\"color: #B5CEA8\">1<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        i = <\/span><span style=\"color: #B5CEA8\">1<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        j = <\/span><span style=\"color: #B5CEA8\">0<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        <\/span><span style=\"color: #C586C0\">while<\/span><span style=\"color: #D4D4D4\"> i &lt; <\/span><span style=\"color: #DCDCAA\">len<\/span><span style=\"color: #D4D4D4\">(arr) <\/span><span style=\"color: #569CD6\">and<\/span><span style=\"color: #D4D4D4\"> j &lt; <\/span><span style=\"color: #DCDCAA\">len<\/span><span style=\"color: #D4D4D4\">(dep):<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">            <\/span><span style=\"color: #C586C0\">if<\/span><span style=\"color: #D4D4D4\"> arr[i] &lt;= dep[j]:  <\/span><span style=\"color: #6A9955\"># one more platform needed<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">                count += <\/span><span style=\"color: #B5CEA8\">1<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">                i += <\/span><span style=\"color: #B5CEA8\">1<\/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\"># one platform can be reduced<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">                count -= <\/span><span style=\"color: #B5CEA8\">1<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">                j += <\/span><span style=\"color: #B5CEA8\">1<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">            ans = <\/span><span style=\"color: #DCDCAA\">max<\/span><span style=\"color: #D4D4D4\">(ans, count)<\/span><\/span>\n<span class=\"line\"><span style=\"color: #D4D4D4\">        <\/span><span style=\"color: #C586C0\">return<\/span><span style=\"color: #D4D4D4\"> ans<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<h2 class=\"wp-block-heading\">Code explanation<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li>After sorting arrivals and departures, we start with the first train occupying one platform.<\/li>\n\n\n\n<li>Pointer <code>i<\/code> scans upcoming arrivals, pointer <code>j<\/code> scans upcoming departures.<\/li>\n\n\n\n<li>If the next arrival occurs <strong>before or exactly when<\/strong> the earliest pending departure happens, a new platform is needed because a new train has arrived while others are still present.<\/li>\n\n\n\n<li>If the next departure occurs <strong>before<\/strong> the next arrival, a train leaves and frees a platform, so we decrease the current count.<\/li>\n\n\n\n<li>At each step, update <code>ans<\/code> with the maximum <code>count<\/code> observed. This maximum concurrent occupancy equals the required number of platforms.<\/li>\n<\/ul>\n\n\n\n<p>Note on equality case <code>arr[i] &lt;= dep[j]<\/code>:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>If a train arrives at the same time another departs, the safe interpretation in this implementation is to <strong>require an extra platform<\/strong> momentarily. This matches the conventional problem setting on GFG for counting minimum platforms when an arrival at time <code>t<\/code> and a departure at time <code>t<\/code> are treated as overlapping for platform allocation.<\/li>\n<\/ul>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<h2 class=\"wp-block-heading\">Time and Space Complexity<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Precise<\/strong>\n<ul class=\"wp-block-list\">\n<li>Sorting arrivals: <strong>O(n log n)<\/strong><\/li>\n\n\n\n<li>Sorting departures: <strong>O(n log n)<\/strong><\/li>\n\n\n\n<li>Single linear sweep with two pointers: <strong>O(n + n)<\/strong><\/li>\n\n\n\n<li>Total time: <strong>O(n log n + n + n)<\/strong> which simplifies to <strong>O(n log n)<\/strong><\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Simplified<\/strong>\n<ul class=\"wp-block-list\">\n<li><strong>O(n log n)<\/strong> time<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Space Complexity<\/strong>\n<ul class=\"wp-block-list\">\n<li>Sorting in place plus a few counters and pointers<\/li>\n\n\n\n<li><strong>O(1)<\/strong> extra space<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<h2 class=\"wp-block-heading\">Conclusion<\/h2>\n\n\n\n<p>The two-pointer greedy sweep after sorting arrivals and departures efficiently finds the <strong>peak overlap<\/strong> of trains, which is the <strong>minimum number of platforms<\/strong> required. This solution runs in <strong>O(n log n)<\/strong> time with <strong>O(1)<\/strong> extra space and is optimal for large inputs.<\/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>This classic scheduling problem asks you to find the minimum number of railway platforms required so that no train has to wait. You are given two arrays: arrival times and departure times of trains at a station. The goal is to compute the smallest number of platforms needed so that every arriving train can be<\/p>\n","protected":false},"author":1,"featured_media":965,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3,6],"tags":[41,19],"class_list":{"0":"post-964","1":"post","2":"type-post","3":"status-publish","4":"format-standard","5":"has-post-thumbnail","7":"category-data-structures-and-algorithm","8":"category-intermediate","9":"tag-greedy-algorithm","10":"tag-medium"},"featured_image_src":"https:\/\/codeanddebug.in\/blog\/wp-content\/uploads\/2025\/08\/minimum-platforms-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\/964","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=964"}],"version-history":[{"count":1,"href":"https:\/\/codeanddebug.in\/blog\/wp-json\/wp\/v2\/posts\/964\/revisions"}],"predecessor-version":[{"id":966,"href":"https:\/\/codeanddebug.in\/blog\/wp-json\/wp\/v2\/posts\/964\/revisions\/966"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/codeanddebug.in\/blog\/wp-json\/wp\/v2\/media\/965"}],"wp:attachment":[{"href":"https:\/\/codeanddebug.in\/blog\/wp-json\/wp\/v2\/media?parent=964"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/codeanddebug.in\/blog\/wp-json\/wp\/v2\/categories?post=964"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/codeanddebug.in\/blog\/wp-json\/wp\/v2\/tags?post=964"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}