{"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-06-02T12:59:13","modified_gmt":"2026-06-02T07:29:13","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 for Beginners: How to Learn DSA Effectively?"},"content":{"rendered":"\n<p>Ever looked at a LeetCode problem and had no idea where to even begin? You&#8217;re not alone. Most beginners feel overwhelmed by DSA, not because it&#8217;s impossible, but because they don&#8217;t have a clear roadmap to follow.<\/p>\n\n\n\n<p>Data Structures and Algorithms (DSA) is the foundation of software development. It&#8217;s what separates developers who write working code from those who write <em>efficient<\/em> code. And in 2026, with competition for tech roles at an all-time high, DSA skills are more important than ever.<\/p>\n\n\n\n<p>This article breaks down the DSA roadmap for beginners in a step-by-step way, no fluff, no overwhelm. Whether you&#8217;re a student, a career switcher, or someone prepping for interviews, this is the path that actually works.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>TL;DR Summary<\/strong><\/h2>\n\n\n\n<ul>\n<li>Start with programming basics before jumping into DSA concepts<\/li>\n\n\n\n<li>Learn core data structures in order: arrays, strings, linked lists, stacks, and queues<\/li>\n\n\n\n<li>Move to advanced structures like trees, heaps, hash tables, and graphs once basics are solid<\/li>\n\n\n\n<li>Master key algorithms, searching, sorting, recursion, and dynamic programming step by step<\/li>\n\n\n\n<li>Practice daily on platforms like LeetCode and HackerRank, starting with easy problems<\/li>\n\n\n\n<li>Always analyze time and space complexity, not just whether your solution works<\/li>\n\n\n\n<li>Avoid common traps, don&#8217;t memorize solutions, don&#8217;t skip fundamentals, don&#8217;t rush<\/li>\n\n\n\n<li>With 1\u20132 focused hours daily, you can be interview-ready in 3\u20136 months<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>What Are Data Structures and Algorithms?<\/strong><\/h2>\n\n\n\n<p>Before jumping into the roadmap, let&#8217;s make sure you understand exactly what you&#8217;re learning with <a href=\"https:\/\/www.guvi.in\/blog\/what-are-data-structures-and-algorithms\/\" target=\"_blank\" rel=\"noreferrer noopener\">data structure and algorithms<\/a> and why it matters.<\/p>\n\n\n\n<p>A <strong>data structure<\/strong> is simply a way of organizing and storing data so it can be used efficiently. Think of it like a filing cabinet; different filing systems work better for different types of information.<\/p>\n\n\n\n<ul>\n<li>An <strong>array<\/strong> stores items in a sequence<\/li>\n\n\n\n<li>A <strong>stack<\/strong> works on a last-in, first-out (LIFO) basis<\/li>\n\n\n\n<li>A <strong>graph<\/strong> models relationships between connected entities<\/li>\n<\/ul>\n\n\n\n<p>An <a href=\"https:\/\/www.guvi.in\/blog\/what-is-an-algorithm\/\" target=\"_blank\" rel=\"noreferrer noopener\"><strong>algorithm<\/strong><\/a> is a set of step-by-step instructions to solve a specific problem. Sorting a list, searching for a value, finding the shortest path between two cities, each has algorithms designed to handle it.<\/p>\n\n\n\n<p>Together, data structures and algorithms determine how fast your program runs, how much memory it uses, 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;\">\n  <strong style=\"font-size: 22px; color: #FFFFFF;\">\ud83d\udca1 Did You Know?<\/strong>\n  <br \/><br \/>\n  Google&#8217;s Search, Uber&#8217;s routing engine, and even your social media feed all rely on advanced data structures and algorithms to work in milliseconds. When you learn DSA, you&#8217;re learning the invisible machinery behind the 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>This is a fair question, especially if you just want to build apps or websites. Here&#8217;s the honest answer: you can&#8217;t go far in software engineering without DSA.<\/p>\n\n\n\n<p><strong>For interviews:<\/strong> Almost every product-based company, Google, Amazon, Microsoft, Flipkart, uses DSA problems to evaluate candidates. They use these problems to test logical thinking, not just coding ability.<\/p>\n\n\n\n<p><strong>For better code:<\/strong> 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><strong>For career growth:<\/strong> Backend developers, data engineers, and competitive programmers all rely on DSA daily. It&#8217;s the skill that keeps paying dividends throughout your career.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>Prerequisites Before You Begin<\/strong><\/h2>\n\n\n\n<p>You don&#8217;t need a computer science degree to start. But you do need a few basics in place before diving into DSA.<\/p>\n\n\n\n<ul>\n<li><strong>A working knowledge of one programming language<\/strong>: <a href=\"https:\/\/guvi.in\/hub\/python\" target=\"_blank\" rel=\"noreferrer noopener\">Python<\/a>, Java, or<a href=\"https:\/\/www.guvi.in\/hub\/cpp\/\" target=\"_blank\" rel=\"noreferrer noopener\"> C++<\/a> is the most commonly used. Python is beginner-friendly; C++ is preferred for competitive programming.<\/li>\n\n\n\n<li><strong>Comfort with variables, loops, conditionals, and functions<\/strong>: If you can write a loop that prints numbers 1 to 100, you&#8217;re ready.<\/li>\n\n\n\n<li><strong>Basic math concepts<\/strong>: Logarithms, simple probability, and logical reasoning are enough to get started. You don&#8217;t need advanced math.<\/li>\n<\/ul>\n\n\n\n<p>If you&#8217;re not confident here yet, spend 2\u20134 weeks on programming basics first. It&#8217;ll make every step after this 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<p>Now let&#8217;s get into the actual roadmap. Follow these steps in order, don&#8217;t skip ahead, even if you feel impatient. The foundation matters more than you think.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\"><strong>Step 1: Learn Programming Fundamentals<\/strong><\/h3>\n\n\n\n<p>Before touching any DSA topic, get solid with your chosen language. Practice writing clean functions, understand how memory works at a basic level, and get comfortable reading and debugging code.<\/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 it makes every step after it faster.<\/p>\n\n\n\n<p><strong>Spend:<\/strong> 2\u20134 weeks<\/p>\n\n\n\n<p><strong>Also Read:<\/strong><a href=\"https:\/\/www.guvi.in\/blog\/how-much-dsa-for-full-stack-development\/\" target=\"_blank\" rel=\"noreferrer noopener\"> How Much DSA for Full Stack Development Is Required?<\/a><\/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:<\/p>\n\n\n\n<ul>\n<li><strong>Arrays<\/strong> \u2014 the most fundamental structure. Learn indexing, traversal, insertion, and deletion.<\/li>\n\n\n\n<li><strong>Strings<\/strong> \u2014 understand string manipulation, reversal, and basic pattern matching.<\/li>\n\n\n\n<li><strong>Linked Lists<\/strong> \u2014 singly and doubly linked. Focus on pointer manipulation and how nodes connect.<\/li>\n\n\n\n<li><strong>Stacks<\/strong> \u2014 learn the LIFO principle and real-world uses like undo operations and expression evaluation.<\/li>\n\n\n\n<li><strong>Queues<\/strong> \u2014 learn FIFO. Explore circular queues and deques once you&#8217;re comfortable.<\/li>\n<\/ul>\n\n\n\n<p>Spend enough time here. Shaky basics in these structures will slow you down significantly when things get harder.<\/p>\n\n\n\n<p><strong>You Might Like:<\/strong><a href=\"https:\/\/www.guvi.in\/blog\/linked-list-in-data-structure\/\" target=\"_blank\" rel=\"noreferrer noopener\"> Linked List in Data Structure: A Complete Guide<\/a><\/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><a href=\"https:\/\/www.guvi.in\/hub\/data-structures-and-algorithms-tutorial\/introduction-to-searching-algorithms\/\" target=\"_blank\" rel=\"noreferrer noopener\">Searching<\/a> and sorting are the workhorses of programming. Every application sorts or searches data constantly.<\/p>\n\n\n\n<ul>\n<li><strong>Linear Search<\/strong> \u2014 simple, but important for understanding the baseline.<\/li>\n\n\n\n<li><strong>Binary Search<\/strong> \u2014 a powerful leap. Understand why it only works on sorted data and why it runs in O(log n).<\/li>\n\n\n\n<li><strong>Bubble Sort<\/strong> \u2014 not practical for production, but great for building intuition about comparisons and swaps.<\/li>\n\n\n\n<li><strong>Merge Sort<\/strong> \u2014 your first dive into divide-and-conquer. Clean, predictable, O(n log n).<\/li>\n\n\n\n<li><strong>Quick Sort<\/strong> \u2014 fast in practice, tricky to implement perfectly. Worth mastering despite the edge cases.<\/li>\n<\/ul>\n\n\n\n<p>Learn to analyze time and space complexity (Big O notation) alongside this step, not after it.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\"><strong>Step 4: Learn Advanced Data Structures<\/strong><\/h3>\n\n\n\n<p>Once the basics feel second nature, move on to these:<\/p>\n\n\n\n<ul>\n<li><strong>Trees<\/strong> \u2014 start with binary trees, then Binary Search Trees (BST). Understand traversals: inorder, preorder, and postorder.<\/li>\n\n\n\n<li><strong>Heaps<\/strong> \u2014 min-heaps and max-heaps. Understand their role in priority queues and sorting.<\/li>\n\n\n\n<li><strong>Hash Tables<\/strong> \u2014 learn how hashing works, how collisions are handled, and why lookups can be O(1). This is one of the most interview-critical structures.<\/li>\n\n\n\n<li><strong>Graphs<\/strong> \u2014 nodes and edges. Understand adjacency lists vs. adjacency matrices, then dive into BFS and DFS.<\/li>\n<\/ul>\n\n\n\n<p><strong>Also Read:<\/strong><a href=\"https:\/\/www.guvi.in\/blog\/dsa-interview-questions-and-answers\/\" target=\"_blank\" rel=\"noreferrer noopener\"> 30 Sure-Shot DSA Interview Questions and Answers<\/a><\/p>\n\n\n\n<h3 class=\"wp-block-heading\"><strong>Step 5: Learn Core Algorithms<\/strong><\/h3>\n\n\n\n<p>This is where many beginners either push through and grow, or plateau. Don&#8217;t rush this section.<\/p>\n\n\n\n<ul>\n<li><strong>Recursion<\/strong> \u2014 understanding how functions call themselves is the gateway to almost everything that follows.<\/li>\n\n\n\n<li><strong>Backtracking<\/strong> \u2014 solving problems by exploring possibilities and undoing bad choices. Classic examples: N-Queens, Sudoku Solver.<\/li>\n\n\n\n<li><strong>Greedy Algorithms<\/strong> \u2014 making locally optimal choices at each step. Learn when this strategy works and when it doesn&#8217;t.<\/li>\n\n\n\n<li><strong>Dynamic Programming (DP)<\/strong> \u2014 widely considered the hardest topic for beginners. Start with Fibonacci and the 0\/1 Knapsack before tackling complex DP problems.<\/li>\n<\/ul>\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;\">\n  <strong style=\"font-size: 22px; color: #FFFFFF;\">\ud83d\udca1 Did You Know?<\/strong>\n  <br \/><br \/>\n  Dynamic Programming was actually invented for operational research, not software development. 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<h2 class=\"wp-block-heading\"><strong>Best Resources to Learn DSA<\/strong><\/h2>\n\n\n\n<p>There&#8217;s no shortage of resources out there, but picking the right ones saves you a lot of wasted time. Here are the ones that actually work:<\/p>\n\n\n\n<ul>\n<li><strong>LeetCode<\/strong> \u2014 the gold standard for interview prep. Start with &#8220;Easy&#8221; and build up.<\/li>\n\n\n\n<li><strong>HackerRank<\/strong> \u2014 beginner-friendly with structured learning paths.<\/li>\n\n\n\n<li><strong>HCL GUVI&#8217;s DSA Course<\/strong> \u2014 structured, beginner-friendly, with IIT-M Pravartak Certification.<a href=\"https:\/\/www.guvi.in\/courses\/programming\/dsa-using-python\/?utm_source=Blog&amp;utm_medium=hyperlink&amp;utm_campaign=dsa-roadmap-beginners-should-know\" target=\"_blank\" rel=\"noreferrer noopener\"> Explore here<\/a>.<\/li>\n\n\n\n<li><strong>Striver&#8217;s DSA Sheet (takeUforward)<\/strong> \u2014 a popular structured problem list widely used in India.<\/li>\n\n\n\n<li><strong>Books<\/strong> \u2014 <em>Introduction to Algorithms<\/em> (CLRS) for deep theory; <em>Cracking the Coding Interview<\/em> by Gayle Laakmann McDowell for interview-focused prep.<\/li>\n\n\n\n<li><strong>YouTube<\/strong> \u2014 Abdul Bari for algorithm explanations, CodeWithHarry for Hindi-medium learners, William Fiset for graph algorithms.<\/li>\n<\/ul>\n\n\n\n<p>If you want to read more about how DSA paves the way for effective coding and its use cases, consider reading HCL GUVI\u2019s Free Ebook: <a href=\"https:\/\/www.guvi.in\/mlp\/dsa-ebook?utm_source=blog&amp;utm_medium=hyperlink&amp;utm_campaign=dsa-roadmap\" target=\"_blank\" rel=\"noreferrer noopener\">The Complete Data Structures and Algorithms Handbook<\/a>, which covers the key concepts of Data Structures and Algorithms, including essential concepts, problem-solving techniques, and real MNC questions<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>How to Practice DSA Effectively<\/strong><\/h2>\n\n\n\n<p>Having resources isn&#8217;t enough, how you practice matters just as much as what you practice.<\/p>\n\n\n\n<p><strong>Consistency beats intensity.<\/strong> Solving two problems daily for six months will take you further than cramming twenty a week for one month.<\/p>\n\n\n\n<p>Follow a <strong>progressive difficulty ladder<\/strong>: spend your first month entirely on easy problems, then introduce mediums, and only attempt hard problems once mediums feel manageable.<\/p>\n\n\n\n<p>When you solve a problem, don&#8217;t stop there. <strong>Revisit it after a week<\/strong> to confirm that the understanding actually stuck.<\/p>\n\n\n\n<p>Most importantly, analyze your solutions after writing them. Ask yourself: What is the time complexity? Can I do this with less memory? Is there a cleaner approach? This habit separates engineers who grow from those who stagnate.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>Common Mistakes Beginners Make<\/strong><\/h2>\n\n\n\n<p>Almost every beginner makes at least one of these. Knowing them in advance saves you weeks of frustration.<\/p>\n\n\n\n<ul>\n<li><strong>Skipping fundamentals<\/strong> to jump straight into dynamic programming or graphs, this almost always backfires.<\/li>\n\n\n\n<li><strong>Memorizing solutions<\/strong> instead of understanding the pattern. Interviews throw new problems at you; pattern recognition matters, rote memory doesn&#8217;t.<\/li>\n\n\n\n<li><strong>Giving up too quickly<\/strong> on hard problems. Sitting with a problem for 30\u201345 minutes before looking at hints is part of the training.<\/li>\n\n\n\n<li><strong>Neglecting complexity analysis<\/strong>, writing a working solution is only half the job.<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>How Long Does It Take to Learn DSA?<\/strong><\/h2>\n\n\n\n<p>For a complete beginner dedicating 1\u20132 hours daily, a realistic timeline is <strong>3\u20136 months<\/strong> to cover all major topics and feel interview-ready at a junior level.<\/p>\n\n\n\n<p>Factors that affect your speed include prior programming experience, consistency of practice, quality of resources, and whether you seek feedback on your solutions. There&#8217;s no shortcut \u2014 but there is a clear path, and you&#8217;re already on it.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>Career Opportunities After Learning DSA<\/strong><\/h2>\n\n\n\n<p>Strong DSA skills unlock doors across the software industry. Here are the roles where it directly pays off:<\/p>\n\n\n\n<ul>\n<li><strong>Software Developer \/ Software Engineer<\/strong> at product-based companies<\/li>\n\n\n\n<li><strong>Backend Developer<\/strong> roles requiring performance-conscious code<\/li>\n\n\n\n<li><strong>Data Engineer<\/strong> roles where efficient data processing is critical<\/li>\n\n\n\n<li><strong>Competitive Programmer<\/strong> transitioning into high-paying quant or research roles<\/li>\n<\/ul>\n\n\n\n<p>Companies like Google, Microsoft, Amazon, and Flipkart use DSA-based interviews as their primary hiring filter. The investment you make today pays dividends for your entire career.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>Conclusion<\/strong><\/h2>\n\n\n\n<p>Learning DSA isn&#8217;t about memorizing hundreds of solutions, it&#8217;s about building a way of thinking. One 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. Don&#8217;t rush past the basics. Practice every day, even when it feels unproductive. The engineers who crack top-tier coding interviews aren&#8217;t smarter than you, they just started earlier and stayed consistent.<\/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-1779771014866\" class=\"rank-math-list-item\">\n<h3 class=\"rank-math-question \"><strong>1. How do I start DSA as a beginner?<\/strong> <\/h3>\n<div class=\"rank-math-answer \">\n\n<p>Start by picking a programming language (Python or C++ are great choices), then learn basic data structures like arrays and linked lists. Practice 1\u20132 problems daily on LeetCode or HackerRank and gradually increase difficulty.<\/p>\n\n<\/div>\n<\/div>\n<div id=\"faq-question-1779771017281\" 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 basics in 2 months with consistent effort, but becoming truly interview-ready typically takes 3\u20136 months. Rushing through concepts without practice tends to backfire.<\/p>\n\n<\/div>\n<\/div>\n<div id=\"faq-question-1779771025437\" class=\"rank-math-list-item\">\n<h3 class=\"rank-math-question \"><strong>3. Which language is better for DSA \u2014 C++ or Python?<\/strong><\/h3>\n<div class=\"rank-math-answer \">\n\n<p>Both work. Python is more beginner-friendly due to its clean syntax. C++ is preferred for competitive programming because of its speed and rich Standard Template Library (STL). Pick one and stick with it.<\/p>\n\n<\/div>\n<\/div>\n<div id=\"faq-question-1779771035636\" 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&#8217;s not impossible. The first few weeks feel challenging because the thinking style is new. With consistent practice, most beginners start seeing real progress within 4\u20136 weeks.<\/p>\n\n<\/div>\n<\/div>\n<div id=\"faq-question-1779771043956\" 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&#8217;s highly recommended to have basic programming knowledge first. Spend 2\u20134 weeks on programming fundamentals before starting DSA \u2014 it&#8217;ll make everything far more understandable.<\/p>\n\n<\/div>\n<\/div>\n<\/div>\n<\/div>","protected":false},"excerpt":{"rendered":"<p>Ever looked at a LeetCode problem and had no idea where to even begin? You&#8217;re not alone. Most beginners feel overwhelmed by DSA, not because it&#8217;s impossible, but because they don&#8217;t have a clear roadmap to follow. Data Structures and Algorithms (DSA) is the foundation of software development. It&#8217;s what separates developers who write working [&hellip;]<\/p>\n","protected":false},"author":66,"featured_media":17104,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[17],"tags":[],"views":"32646","authorinfo":{"name":"Salini Balasubramaniam","url":"https:\/\/www.guvi.in\/blog\/author\/salini\/"},"thumbnailURL":"https:\/\/www.guvi.in\/blog\/wp-content\/uploads\/2023\/02\/DSA1-300x127.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":50,"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/posts\/16913\/revisions"}],"predecessor-version":[{"id":112206,"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/posts\/16913\/revisions\/112206"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.guvi.in\/blog\/wp-json\/wp\/v2\/media\/17104"}],"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}]}}