{"id":16913,"date":"2023-02-14T11:06:20","date_gmt":"2023-02-14T05:36:20","guid":{"rendered":"https:\/\/www.guvi.in\/blog\/?p=16913"},"modified":"2026-07-10T15:10:43","modified_gmt":"2026-07-10T09:40:43","slug":"dsa-roadmap-beginners-should-know","status":"publish","type":"post","link":"https:\/\/www.guvi.in\/blog\/dsa-roadmap-beginners-should-know\/","title":{"rendered":"DSA Roadmap 2026: Step-by-Step Guide from Zero to Placement Ready"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\"><strong>TL;DR Summary<\/strong><\/h2>\n\n\n\n<ul>\n<li>Start your DSA roadmap with one programming language (Python, Java, or C++) before touching any DSA topic<\/li>\n\n\n\n<li>Learn basic data structures first: arrays, strings, linked lists, stacks, and queues<\/li>\n\n\n\n<li>Move to sorting and searching algorithms, then to advanced structures like trees, heaps, hash tables, and graphs<\/li>\n\n\n\n<li>Learn core algorithm techniques: recursion, backtracking, greedy algorithms, and dynamic programming<\/li>\n\n\n\n<li>Practice on LeetCode or HackerRank daily, starting with easy problems and building up<\/li>\n\n\n\n<li>Always analyze time and space complexity, not just whether your code runs<\/li>\n\n\n\n<li>With 1 to 2 focused hours a day, you can be interview-ready in 3 to 6 months<\/li>\n<\/ul>\n\n\n\n<p>Have You Ever Stared at a Coding Problem and Had No Clue Where to Start? Most beginners feel that way, and it is not because DSA is impossible. It is because no one handed them a clear path how to learn DSA effectively.<\/p>\n\n\n\n<p><a href=\"https:\/\/www.guvi.in\/blog\/what-are-data-structures-and-algorithms\/\" target=\"_blank\" rel=\"noreferrer noopener\">Data Structures and Algorithms (DSA)<\/a> is the foundation of how efficient software is built. It is the skill that separates developers who write working code from those who write code that actually scales. In 2026, with product-based companies running DSA-heavy interview rounds across the board, following a structured DSA roadmap is one investment that pays back throughout your career.\u00a0<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>What are Data Structures and Algorithms?<\/strong><\/h2>\n\n\n\n<figure class=\"wp-block-image size-full\"><img decoding=\"async\" width=\"1200\" height=\"628\" src=\"https:\/\/www.guvi.in\/blog\/wp-content\/uploads\/2026\/06\/1-45.png\" alt=\"What are Data Structures and Algorithms?\" class=\"wp-image-116488\" srcset=\"https:\/\/www.guvi.in\/blog\/wp-content\/uploads\/2026\/06\/1-45.png 1200w, https:\/\/www.guvi.in\/blog\/wp-content\/uploads\/2026\/06\/1-45-300x157.png 300w, https:\/\/www.guvi.in\/blog\/wp-content\/uploads\/2026\/06\/1-45-768x402.png 768w, https:\/\/www.guvi.in\/blog\/wp-content\/uploads\/2026\/06\/1-45-150x79.png 150w\" sizes=\"(max-width: 1200px) 100vw, 1200px\" title=\"\"><\/figure>\n\n\n\n<p>A data structure is a way of organizing and storing data so it can be used efficiently. Think of it like different storage systems, each designed for a specific purpose.<\/p>\n\n\n\n<p>An array stores items in a sequence. A stack works on a last-in, first-out basis. A graph models connections between entities. Each structure has strengths and trade-offs.<\/p>\n\n\n\n<p>An <a href=\"https:\/\/www.guvi.in\/blog\/what-is-an-algorithm\/\" target=\"_blank\" rel=\"noreferrer noopener\">algorithm<\/a> is a set of step-by-step instructions to solve a specific problem. Sorting a list, finding the shortest path, searching for a value, each of these has an algorithm optimized to handle it. Together, they determine how fast your program runs and how well it scales.<\/p>\n\n\n\n<div style=\"background-color: #099f4e; border: 3px solid #110053; border-radius: 12px; padding: 18px 22px; color: #FFFFFF; font-size: 18px; font-family: Montserrat, Helvetica, sans-serif; line-height: 1.6; box-shadow: 0 4px 12px rgba(0, 0, 0, 0.15); max-width: 750px; margin: 30px auto;\">\n  <strong style=\"font-size: 22px; color: #FFFFFF;\">\ud83d\udca1 Did You Know?<\/strong>\n  <br \/><br \/>\n Google Search, Uber&#8217;s routing engine, and your social media feed all rely on advanced data structures and algorithms running in milliseconds. When you learn DSA, you are learning the invisible machinery behind software you use every day.\n<\/div>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>Why Should You Learn DSA?<\/strong><\/h2>\n\n\n\n<p>For interviews, almost every product-based company, Google, Amazon, Microsoft, Flipkart, uses DSA problems to evaluate candidates. They are not just testing coding ability; they are testing logical thinking under pressure.<\/p>\n\n\n\n<p>For better code, a developer who understands hash tables will never accidentally write an O(n\u00b2) solution when O(1) is available. That difference barely shows with 10 records and is catastrophic with 10 million.<\/p>\n\n\n\n<p>For career growth, backend developers, data engineers, and <a href=\"https:\/\/www.guvi.in\/blog\/who-is-a-full-stack-developer\/\" target=\"_blank\" rel=\"noreferrer noopener\">full-stack developers<\/a> all rely on DSA-informed thinking daily. It is the skill that keeps paying dividends.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>What Do You Need Before Starting DSA?<\/strong><\/h2>\n\n\n\n<p>You do not need a computer science degree. But you do need a few basics in place.<\/p>\n\n\n\n<p>You should be comfortable with one programming language: <a href=\"https:\/\/www.guvi.in\/hub\/python\/\" target=\"_blank\" rel=\"noreferrer noopener\">Python<\/a>, Java, or C++. Python is beginner-friendly and great for most learners. <a href=\"https:\/\/guvi.in\/hub\/cpp\" target=\"_blank\" rel=\"noreferrer noopener\">C++<\/a> is preferred for competitive programming due to its speed and rich Standard Template Library.<\/p>\n\n\n\n<p>You should also be comfortable with variables, loops, conditionals, and functions. If you can write a loop that prints numbers 1 to 100, you are ready. Basic math concepts like logarithms and simple logical reasoning are enough to start. You do not need advanced math.<\/p>\n\n\n\n<p>If you are not there yet, spend 2 to 4 weeks on <a href=\"https:\/\/www.guvi.in\/courses\/programming\/programming-fundamentals\/?utm_source=blog&amp;utm_medium=hyperlink&amp;utm_campaign=dsa-roadmap-beginners-should-know\" target=\"_blank\" rel=\"noreferrer noopener\">programming fundamentals <\/a>first. It makes every step after this significantly faster.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>Step-by-Step DSA Roadmap for Beginners<\/strong><\/h2>\n\n\n\n<figure class=\"wp-block-image size-full\"><img decoding=\"async\" width=\"1200\" height=\"628\" src=\"https:\/\/www.guvi.in\/blog\/wp-content\/uploads\/2026\/06\/2-42.png\" alt=\"Step-by-Step DSA Roadmap for Beginners\" class=\"wp-image-116490\" srcset=\"https:\/\/www.guvi.in\/blog\/wp-content\/uploads\/2026\/06\/2-42.png 1200w, https:\/\/www.guvi.in\/blog\/wp-content\/uploads\/2026\/06\/2-42-300x157.png 300w, https:\/\/www.guvi.in\/blog\/wp-content\/uploads\/2026\/06\/2-42-768x402.png 768w, https:\/\/www.guvi.in\/blog\/wp-content\/uploads\/2026\/06\/2-42-150x79.png 150w\" sizes=\"(max-width: 1200px) 100vw, 1200px\" title=\"\"><\/figure>\n\n\n\n<p>This is the core of what you came here for. Follow these steps in order. Skipping ahead is the most common reason beginners plateau.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\"><strong>Step 1: Lock in Your Programming Fundamentals<\/strong><\/h3>\n\n\n\n<p>Before touching any DSA topic, get solid with your language. Write clean functions, understand how memory works at a basic level, and get comfortable debugging.<\/p>\n\n\n\n<p>Build small projects like a calculator, a number guessing game, or a grade tracker. This stage feels slow but makes every step after it faster.<\/p>\n\n\n\n<p><strong>Time to spend:<\/strong> 2 to 4 weeks<\/p>\n\n\n\n<h3 class=\"wp-block-heading\"><strong>Step 2: Master Basic Data Structures<\/strong><\/h3>\n\n\n\n<p>This is where your DSA journey truly begins. Work through these in order and do not rush past them.<\/p>\n\n\n\n<p>Arrays are the most fundamental structure. Learn indexing, traversal, insertion, and deletion. Strings cover manipulation, reversal, and basic pattern matching. Linked lists, both singly and doubly linked, teach you how pointers and node connections work.<\/p>\n\n\n\n<p>Stacks teach the <a href=\"https:\/\/www.investopedia.com\/terms\/l\/lifo.asp\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">LIFO (last-in, first-out) principle <\/a>and are used in real-world cases like undo operations. Queues teach <a href=\"https:\/\/www.agrinventory.com\/blog\/fifo-meaning-first-in-first-out\/\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">FIFO (first-in, first-out)<\/a> and are foundational for breadth-first traversal later on.<\/p>\n\n\n\n<p>Shaky basics in these structures will slow you down significantly when things get harder.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\"><strong>Step 3: Learn Searching and Sorting Algorithms<\/strong><\/h3>\n\n\n\n<p>Searching and <a href=\"https:\/\/www.guvi.in\/blog\/sorting-in-data-structure-categories-types\/\" target=\"_blank\" rel=\"noreferrer noopener\">sorting<\/a> are the workhorses of programming. Every application sorts or searches data constantly.<\/p>\n\n\n\n<p>Start with linear search to understand the baseline, then move to binary search and understand why it only works on sorted data and why it runs in O(log n). For sorting, learn bubble sort to build intuition, merge sort to understand divide-and-conquer, and quick sort to understand partitioning.<\/p>\n\n\n\n<p>Learn to analyze time and space complexity alongside this step using Big O notation, not after it.<\/p>\n\n\n\n<div style=\"background-color: #099f4e; border: 3px solid #110053; border-radius: 12px; padding: 18px 22px; color: #FFFFFF; font-size: 18px; font-family: Montserrat, Helvetica, sans-serif; line-height: 1.6; box-shadow: 0 4px 12px rgba(0, 0, 0, 0.15); max-width: 750px; margin: 30px auto;\">\n  <strong style=\"font-size: 22px; color: #FFFFFF;\">\ud83d\udca1 Did You Know?<\/strong>\n  <br \/><br \/>\n  Dynamic Programming was not invented for software at all. Richard Bellman coined the term in the 1950s while working on multi-stage decision problems for the US government. Today it powers everything from GPS route optimization to stock trading algorithms.\n<\/div>\n\n\n\n<h3 class=\"wp-block-heading\"><strong>Step 4: Move to Advanced Data Structures<\/strong><\/h3>\n\n\n\n<p>Once the basics feel natural, advance to these structures.<\/p>\n\n\n\n<p>Trees: start with binary trees, then <a href=\"https:\/\/www.guvi.in\/hub\/data-structures-and-algorithms-tutorial\/introduction-to-binary-search-tree\/\" target=\"_blank\" rel=\"noreferrer noopener\">Binary Search Trees (BST)<\/a>. Understand traversals such as inorder, preorder, and postorder. Heaps: learn min-heaps and max-heaps and their role in priority queues.<\/p>\n\n\n\n<p>Hash tables are one of the most interview-critical structures you will learn. Understand how hashing works, how collisions are handled, and why lookups can be O(1).<\/p>\n\n\n\n<p>Graphs are next: understand nodes and edges, adjacency lists vs adjacency matrices, then learn Breadth-First Search (BFS) and Depth-First Search (DFS).<\/p>\n\n\n\n<h3 class=\"wp-block-heading\"><strong>Step 5: Learn Core Algorithm Techniques<\/strong><\/h3>\n\n\n\n<p>This is where many beginners either push through and grow, or plateau. Take your time here.<\/p>\n\n\n\n<p>Recursion is the gateway to almost everything that follows. Understanding how functions call themselves is non-negotiable. Backtracking builds on recursion and teaches you to explore possibilities and undo bad choices. Classic examples include N-Queens and the Sudoku Solver.<\/p>\n\n\n\n<p>Greedy algorithms teach you to make locally optimal choices at each step. Learn when this works and when it does not. Dynamic Programming is widely considered the hardest topic for beginners. Start with Fibonacci and the 0\/1 Knapsack problem before tackling complex DP challenges.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>DSA Roadmap Summary at a Glance<\/strong><\/h2>\n\n\n\n<p>Here&#8217;s a quick overview of the steps, key topics, recommended timelines, and where to practice before we dive into each step.<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td><strong>Steps<\/strong><\/td><td><strong>Topics<\/strong><\/td><td><strong>Recommended Time<\/strong><\/td><td><strong>Practice Platform<\/strong><\/td><\/tr><tr><td><strong>Step 1: Programming Fundamentals<\/strong><\/td><td>Variables, loops, functions, basic problem-solving<\/td><td>2 to 4 weeks<\/td><td>HackerRank, GUVI CodeKata<\/td><\/tr><tr><td><strong>Step 2: Basic Data Structures<\/strong><\/td><td>Arrays, strings, linked lists, stacks, queues<\/td><td>3 to 4 weeks<\/td><td>LeetCode (Easy), HackerRank<\/td><\/tr><tr><td><strong>Step 3: Searching &amp; Sorting<\/strong><\/td><td>Linear search, binary search, bubble sort, merge sort, quick sort, Big O<\/td><td>2 to 3 weeks<\/td><td>LeetCode, CodeChef<\/td><\/tr><tr><td><strong>Step 4: Advanced Data Structures<\/strong><\/td><td>Trees, BST, heaps, hash tables, graphs<\/td><td>4 to 6 weeks<\/td><td>LeetCode, Striver&#8217;s DSA Sheet<\/td><\/tr><tr><td><strong>Step 5: Algorithm Techniques<\/strong><\/td><td>Recursion, backtracking, greedy algorithms, dynamic programming<\/td><td>4 to 6 weeks<\/td><td>LeetCode, Codeforces<\/td><\/tr><\/tbody><\/table><figcaption class=\"wp-element-caption\"><em>DSA Roadmap: An Overview<\/em><\/figcaption><\/figure>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>Best Resources to Learn DSA in 2026<\/strong><\/h2>\n\n\n\n<p>There is no shortage of resources, but picking the right ones saves you weeks of wasted time.<\/p>\n\n\n\n<p>LeetCode is the gold standard for interview prep. Start with &#8220;Easy&#8221; and build up gradually. HackerRank is more beginner-friendly with structured learning paths. Striver&#8217;s DSA Sheet (takeUforward) is a popular structured problem list widely used by Indian developers.<\/p>\n\n\n\n<p>For books, &#8220;Introduction to Algorithms&#8221; (CLRS) is the deep-theory reference. &#8220;Cracking the Coding Interview&#8221; by Gayle Laakmann McDowell is the interview-focused choice. For video explanations, Abdul Bari and William Fiset are excellent free resources on YouTube.<\/p>\n\n\n\n<p>Want a structured, beginner-friendly path with certification? HCL GUVI&#8217;s<a href=\"https:\/\/www.guvi.in\/courses\/programming\/dsa-using-python\/?utm_source=blog&amp;utm_medium=content&amp;utm_campaign=dsa-roadmap-beginners-should-know\" target=\"_blank\" rel=\"noreferrer noopener\"> DSA Using Python course<\/a> is built for learners who want to go from zero to interview-ready with an IIT-M Pravartak certification to show for it.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>Common DSA Roadmap Mistakes Beginners Should Avoid&nbsp;<\/strong><\/h2>\n\n\n\n<p>Even the best DSA roadmap won&#8217;t help if you follow the wrong learning habits. Avoid these common mistakes to make faster progress and strengthen your DSA interview preparation.&nbsp;<\/p>\n\n\n\n<p><strong>Watching tutorials without solving problems<\/strong><strong><br><\/strong>Understanding a concept is only half the job. Solve multiple coding problems after every topic to reinforce your learning.<\/p>\n\n\n\n<p><strong>Skipping time and space complexity<\/strong><strong><br><\/strong>A correct solution is not always an efficient one. Get into the habit of analyzing Big O complexity alongside every solution.<\/p>\n\n\n\n<p><strong>Jumping to advanced topics too early<\/strong><strong><br><\/strong>Dynamic Programming and Graphs become much easier once your fundamentals in arrays, linked lists, stacks, and queues are solid.<\/p>\n\n\n\n<p><strong>Memorizing solutions instead of understanding patterns<\/strong><strong><br><\/strong>Focus on why an approach works rather than trying to remember code line by line.<\/p>\n\n\n\n<p><strong>Practicing inconsistently<\/strong><strong><br><\/strong>Even 45\u201360 minutes of regular problem-solving is more effective than studying for several hours only once a week.<\/p>\n\n\n\n<p><strong>Ignoring revision<\/strong> <em><br><\/em>Revisit previously solved questions regularly to strengthen your understanding and recognize common problem-solving patterns.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>Conclusion<\/strong><\/h2>\n\n\n\n<p>Learning DSA is not about memorizing hundreds of solutions. It is about building a way of thinking that breaks complex problems into smaller pieces, spots familiar patterns, and always asks whether a smarter approach exists.<\/p>\n\n\n\n<p>Follow the roadmap in order. Do not rush past the basics. Practice every day, even when progress feels invisible. The engineers who crack top-tier interviews are not smarter than you. They just started earlier and stayed consistent. Your version of that story starts right now.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>FAQs<\/strong><\/h2>\n\n\n<div id=\"rank-math-faq\" class=\"rank-math-block\">\n<div class=\"rank-math-list \">\n<div id=\"faq-question-1781264927121\" class=\"rank-math-list-item\">\n<h3 class=\"rank-math-question \"><strong>1. How to learn DSA as a beginner?<\/strong><\/h3>\n<div class=\"rank-math-answer \">\n\n<p>Pick a programming language (Python or C++ are great choices), then learn basic data structures like arrays and linked lists. Practice 1 to 2 problems daily on LeetCode or HackerRank, starting on easy difficulty, and build up from there.<\/p>\n\n<\/div>\n<\/div>\n<div id=\"faq-question-1781264930120\" class=\"rank-math-list-item\">\n<h3 class=\"rank-math-question \"><strong>2. Can I learn DSA in 2 months?<\/strong><\/h3>\n<div class=\"rank-math-answer \">\n\n<p>You can cover the fundamentals in 2 months with consistent effort, but becoming genuinely interview-ready typically takes 3 to 6 months. Rushing through concepts without practice tends to backfire badly.<\/p>\n\n<\/div>\n<\/div>\n<div id=\"faq-question-1781264934418\" class=\"rank-math-list-item\">\n<h3 class=\"rank-math-question \"><strong>3. Which language is better for DSA, C++ or Python?<\/strong><\/h3>\n<div class=\"rank-math-answer \">\n\n<p>Both work well. Python is more beginner-friendly due to its clean syntax. C++ is preferred for competitive programming because of its speed and the rich Standard Template Library (STL). <\/p>\n\n<\/div>\n<\/div>\n<div id=\"faq-question-1781264939488\" class=\"rank-math-list-item\">\n<h3 class=\"rank-math-question \"><strong>4. Is DSA hard for beginners?<\/strong><\/h3>\n<div class=\"rank-math-answer \">\n\n<p>DSA has a learning curve, but it is not impossible. The first few weeks feel challenging because the thinking style is new. With consistent daily practice, most beginners start seeing real progress within 4 to 6 weeks.<\/p>\n\n<\/div>\n<\/div>\n<div id=\"faq-question-1781264944625\" class=\"rank-math-list-item\">\n<h3 class=\"rank-math-question \"><strong>5. Can I learn DSA without prior coding experience?<\/strong><\/h3>\n<div class=\"rank-math-answer \">\n\n<p>It is strongly recommended to have basic programming knowledge first. Spend 2 to 4 weeks on fundamentals like loops, functions, and basic problem-solving before starting DSA. It makes everything far more understandable.<\/p>\n\n<\/div>\n<\/div>\n<div id=\"faq-question-1781264950220\" class=\"rank-math-list-item\">\n<h3 class=\"rank-math-question \"><strong>6. What is the best order to learn data structures?<\/strong><\/h3>\n<div class=\"rank-math-answer \">\n\n<p>Start with arrays and strings, then move to linked lists, stacks, and queues. Once comfortable, progress to trees and heaps, followed by hash tables and graphs. This order builds each concept on the previous one.<\/p>\n\n<\/div>\n<\/div>\n<div id=\"faq-question-1781264956686\" class=\"rank-math-list-item\">\n<h3 class=\"rank-math-question \"><strong>7. Do I need DSA for frontend development?<\/strong><\/h3>\n<div class=\"rank-math-answer \">\n\n<p>Frontend roles at most companies require less DSA than backend or full-stack roles. However, product-based companies still ask DSA questions in interviews regardless of the role. Knowing the fundamentals always gives you an edge.<\/p>\n\n<\/div>\n<\/div>\n<div id=\"faq-question-1783676206379\" class=\"rank-math-list-item\">\n<h3 class=\"rank-math-question \">How should I prepare for DSA interviews?<\/h3>\n<div class=\"rank-math-answer \">\n\n<p>For effective <strong>DSA interview preparation<\/strong>, follow a structured DSA roadmap, solve coding problems consistently on platforms like LeetCode or HackerRank, analyze the time and space complexity of your solutions, and practice mock interviews. Consistency and pattern recognition are just as important as learning new topics.<\/p>\n\n<\/div>\n<\/div>\n<\/div>\n<\/div>","protected":false},"excerpt":{"rendered":"<p>TL;DR Summary Have You Ever Stared at a Coding Problem and Had No Clue Where to Start? Most beginners feel that way, and it is not because DSA is impossible. It is because no one handed them a clear path how to learn DSA effectively. Data Structures and Algorithms (DSA) is the foundation of how [&hellip;]<\/p>\n","protected":false},"author":66,"featured_media":116487,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[17],"tags":[],"views":"33760","authorinfo":{"name":"Salini Balasubramaniam","url":"https:\/\/www.guvi.in\/blog\/author\/salini\/"},"thumbnailURL":"https:\/\/www.guvi.in\/blog\/wp-content\/uploads\/2023\/02\/Feature-image-22-300x116.png","_links":{"self":[{"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/posts\/16913"}],"collection":[{"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/users\/66"}],"replies":[{"embeddable":true,"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/comments?post=16913"}],"version-history":[{"count":59,"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/posts\/16913\/revisions"}],"predecessor-version":[{"id":122580,"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/posts\/16913\/revisions\/122580"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/media\/116487"}],"wp:attachment":[{"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/media?parent=16913"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/categories?post=16913"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/tags?post=16913"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}