{"id":14314,"date":"2026-08-10T11:12:04","date_gmt":"2026-08-10T11:12:04","guid":{"rendered":"https:\/\/nokobox.com\/index.php\/item\/designgurus-grokking-linkedin-coding-interview-2025-10\/"},"modified":"2026-08-10T11:12:04","modified_gmt":"2026-08-10T11:12:04","slug":"designgurus-grokking-linkedin-coding-interview-2025-10","status":"publish","type":"digital_item","link":"https:\/\/nokobox.com\/index.php\/item\/designgurus-grokking-linkedin-coding-interview-2025-10\/","title":{"rendered":"DesignGurus \u2013 Grokking LinkedIn Coding Interview 2025-10"},"content":{"rendered":"<div class=\"w-post-elm post_content\">\n<h2 dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Description<\/span><\/h2>\n<p dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Grokking LinkedIn Coding Interview Course. This course is a comprehensive and expert guide to mastering the forty most frequently asked coding questions in LinkedIn job interviews, designed as a complete resource to prepare candidates for the company\u2019s technical and difficult hiring stages. This training resource provides programmers with the necessary mental and technical tools by carefully examining forty of the most frequently asked questions in real interviews in recent years. The main focus of this course is on practical and real-world learning, allowing users to test their skills in a fully interactive coding environment within the browser, which is a unique feature that allows the person to directly solve technical challenges and receive immediate feedback without the need to install complex software or additional settings. Focusing on key areas and complex challenges that commonly occur in the hiring process of top-tier companies, the training ensures that candidates answer questions with confidence and accuracy, highlighting critical aspects of the interview with the aim of strengthening problem-solving skills, increasing efficiency in coding, and deepening understanding of algorithm concepts, data structures, and programming patterns. Each question in this series has been meticulously selected to reflect the real challenges that software engineers face in professional environments. Since competition in the technology job market is very intense, this course acts as a detailed roadmap for overcoming technical obstacles and provides the necessary mental preparation to analyze issues under time pressure during the interview.<\/span><\/p>\n<h3 dir=\"ltr\" style=\"text-align: left\" data-path-to-node=\"7\"><span dir=\"auto\" style=\"vertical-align: inherit\">What you will learn<\/span><\/h3>\n<ul dir=\"ltr\" style=\"text-align: left\">\n<li data-path-to-node=\"8,0,0\"><span dir=\"auto\" style=\"vertical-align: inherit\">Complete mastery of the forty programming questions that, according to statistics, are the most frequently asked in LinkedIn interview sessions.<\/span><\/li>\n<li data-path-to-node=\"8,1,0\"><span dir=\"auto\" style=\"vertical-align: inherit\">Learn how to solve problems in an interactive, direct-to-browser coding environment to increase speed.<\/span><\/li>\n<li data-path-to-node=\"8,2,0\"><span dir=\"auto\" style=\"vertical-align: inherit\">Strengthening fundamental problem-solving skills and learning methods for optimizing written code.<\/span><\/li>\n<li data-path-to-node=\"8,3,0\"><span dir=\"auto\" style=\"vertical-align: inherit\">Deepen your understanding of advanced concepts of algorithms and data structures that are required in large technology companies.<\/span><\/li>\n<li data-path-to-node=\"8,4,0\"><span dir=\"auto\" style=\"vertical-align: inherit\">Familiarity with specific coding patterns that help solve complex problems faster.<\/span><\/li>\n<li data-path-to-node=\"8,5,0\"><span dir=\"auto\" style=\"vertical-align: inherit\">Gaining mental and technical preparation to face surprising questions during the hiring process.<\/span><\/li>\n<li data-path-to-node=\"8,6,0\"><span dir=\"auto\" style=\"vertical-align: inherit\">Increasing accuracy in analyzing the temporal and spatial complexity of generated codes.<\/span><\/li>\n<\/ul>\n<h3 dir=\"ltr\" style=\"text-align: left\" data-path-to-node=\"10\"><span dir=\"auto\" style=\"vertical-align: inherit\">This course is suitable for people who:<\/span><\/h3>\n<ul dir=\"ltr\" style=\"text-align: left\">\n<li data-path-to-node=\"11,0,0\"><span dir=\"auto\" style=\"vertical-align: inherit\">New programmers who want to prepare for interviews with big tech companies early in their career.<\/span><\/li>\n<li data-path-to-node=\"11,1,0\"><span dir=\"auto\" style=\"vertical-align: inherit\">Experienced developers who want to brush up on their technical knowledge and update their problem-solving skills.<\/span><\/li>\n<li data-path-to-node=\"11,2,0\"><span dir=\"auto\" style=\"vertical-align: inherit\">Applicants who have specifically applied for software engineering positions on LinkedIn.<\/span><\/li>\n<li data-path-to-node=\"11,3,0\"><span dir=\"auto\" style=\"vertical-align: inherit\">Anyone looking for a practical and in-depth understanding of how technical questions are designed at Tier 1 companies.<\/span><\/li>\n<li data-path-to-node=\"11,4,0\"><span dir=\"auto\" style=\"vertical-align: inherit\">Students who want to bring their coding level closer to industry standards by practicing on real questions.<\/span><\/li>\n<\/ul>\n<h3 dir=\"ltr\" style=\"text-align: left\" data-path-to-node=\"14\"><span dir=\"auto\" style=\"vertical-align: inherit\">Grokking LinkedIn Coding Interview Course Details<\/span><\/h3>\n<ul dir=\"ltr\" style=\"text-align: left\">\n<li data-path-to-node=\"15,0,0\"><span dir=\"auto\" style=\"vertical-align: inherit\">Publisher: <\/span><a href=\"https:\/\/href.li\/?https:\/\/www.designgurus.io\/course\/grokking-linkedin-coding-interview\" target=\"_blank\" rel=\"noopener\"><span dir=\"auto\" style=\"vertical-align: inherit\">DesignGurus<\/span><\/a><\/li>\n<li><span dir=\"auto\" style=\"vertical-align: inherit\">Instructor: <\/span><a href=\"https:\/\/downloadlynet.ir\/tag\/designgurus\/\" rel=\"noopener\"><span dir=\"auto\" style=\"vertical-align: inherit\">DesignGurus<\/span><\/a><\/li>\n<li data-path-to-node=\"15,1,0\"><span dir=\"auto\" style=\"vertical-align: inherit\">Training level: Beginner<\/span><\/li>\n<li><span dir=\"auto\" style=\"vertical-align: inherit\">Training duration: 20 hours<\/span><\/li>\n<li><span dir=\"auto\" style=\"vertical-align: inherit\">Number of lessons: 81<\/span><\/li>\n<\/ul>\n<h3 dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Course headings<\/span><\/h3>\n<ul dir=\"ltr\" style=\"text-align: left\">\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Who Should Take This Course?<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Find Pivot Index easily<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Find Pivot Index<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Isomorphic Strings easy<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Isomorphic Strings Solution<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Second Minimum Node In a Binary Tree easy<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Second Minimum Node In a Binary Tree<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Minimum Time to Type Word Using Special Typewriter easy<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Minimum Time to Type Word Using Special Typewriter<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Intersection of Two Arrays easy<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Intersection of Two Arrays<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Can Place Flowers Easily<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Can Place Flowers<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Valid Perfect Square easy<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Valid Perfect Square<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Maximum Depth or Height of Binary Tree easy<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Maximum Depth or Height of Binary Tree<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Sqrt easy<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Sqrt<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Valid Palindrome easy<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Valid Palindrome<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Rotate List medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Rotate List<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Find Leaves of Binary Tree medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Find Leaves of Binary Tree<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Valid Triangle Number medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Valid Triangle Number<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Valid Parenthesis String medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Valid Parenthesis String<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Edit Distance medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Edit Distance<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Remove All Ones With Row and Column Flips II medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Remove All Ones With Row and Column Flips II<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Reverse Integer medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Reverse Integer Solution<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Triplet Sum to Zero medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Triplet Sum to Zero Solution<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Longest Substring Without Repeating Characters medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Longest Substring Without Repeating Characters medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Decode Ways medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Decode Ways<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Quadruple Sum to Target medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Quadruple Sum to Target<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Next Permutation medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Next Permutation<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Search in Rotated Array medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Search in Rotated Array<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Word Search medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Word Search Solution<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Remove Nth Node From End of List Medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Remove Nth Node From End of List<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">House Robber II medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">House Robber II Solution<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Coin Exchange<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Coin Change Solution<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Design Add and Search Words Data Structure medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Design Add and Search Words Data Structure<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Merge Intervals medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Merge Intervals<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Number of Islands easy<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Number of Islands<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Longest Palindromic Subsequence medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Longest Palindromic Subsequence<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Kth Smallest Number medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Kth Smallest Number<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Maximum Product Subarray medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Maximum Product Subarray<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Same Tree medium<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Same Tree<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Max Points on a Line hard<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Max Points on a Line<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Closest Binary Search Tree Value II hard<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Closest Binary Search Tree Value II<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Word Ladder hard<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Word Ladder Solution<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Median of Two Sorted Arrays hard<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Median of Two Sorted Arrays<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Largest Rectangle in Histogram hard<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Largest Rectangle in Histogram<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Serialize and Deserialize Binary Tree hard<\/span><\/li>\n<li dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Solution Serialize and Deserialize Binary Tree<\/span><\/li>\n<\/ul>\n<h3 dir=\"ltr\" style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Course images<\/span><\/h3>\n<p dir=\"ltr\" style=\"text-align: left\"><img loading=\"lazy\" decoding=\"async\" class=\"aligncenter wp-image-1033768 size-full\" src=\"https:\/\/downloadly.ir\/wp-content\/uploads\/2026\/02\/Grokking-LinkedIn-Coding-Interview.png\" alt=\"Grokking LinkedIn Coding Interview\" width=\"1077\" height=\"317\"><\/p>\n<div dir=\"ltr\">\n<div style=\"text-align: left\">\n<h3><span dir=\"auto\" style=\"vertical-align: inherit\">Installation Guide<\/span><\/h3>\n<\/div>\n<h3 style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Download link<\/span><\/h3>\n<h4 style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">Downloadly<\/span><\/h4>\n<p style=\"text-align: left\"><a href=\"https:\/\/dl1.downloadly.ir\/Files\/Elearning\/DesignGurus_Grokking_LinkedIn_Coding_Interview_2025-10_Downloadly.ir.rar?nocache=1786177944\"><span dir=\"auto\" style=\"vertical-align: inherit\">Download file \u2013 43 MB<\/span><\/a><\/p>\n<h4 dir=\"ltr\">Rapidgator link<\/h4>\n<p><a href=\"https:\/\/rapidgator.net\/file\/5c745d44295c15f3e8e29f6e1a001f30\/DesignGurus_Grokking_LinkedIn_Coding_Interview_2025-10_Downloadly.ir.rar.html\">Download file \u2013 43 MB<\/a>&nbsp;<\/p>\n<p style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">File(s) password: www.downloadly.ir<\/span><\/p>\n<h3 style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">File size<\/span><\/h3>\n<p style=\"text-align: left\"><span dir=\"auto\" style=\"vertical-align: inherit\">43 MB<\/span><\/p>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Description Grokking LinkedIn Coding Interview Course. This course is a comprehensive and expert guide to mastering the forty most frequently asked coding quest<\/p>\n","protected":false},"author":1,"template":"","dgi_category":[10458],"dgi_tag":[116703,113048,116704,116705,116706,116707],"class_list":["post-14314","digital_item","type-digital_item","status-publish","has-post-thumbnail","hentry","dgi_category-video-tutorials","dgi_tag-course-grokking-linkedin-coding-interview","dgi_tag-designgurus","dgi_tag-download-course-grokking-linkedin-coding-interview","dgi_tag-download-grokking-linkedin-coding-interview","dgi_tag-free-download-grokking-linkedin-coding-interview","dgi_tag-free-grokking-linkedin-coding-interview"],"_links":{"self":[{"href":"https:\/\/nokobox.com\/index.php\/wp-json\/wp\/v2\/digital_item\/14314","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/nokobox.com\/index.php\/wp-json\/wp\/v2\/digital_item"}],"about":[{"href":"https:\/\/nokobox.com\/index.php\/wp-json\/wp\/v2\/types\/digital_item"}],"author":[{"embeddable":true,"href":"https:\/\/nokobox.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"version-history":[{"count":0,"href":"https:\/\/nokobox.com\/index.php\/wp-json\/wp\/v2\/digital_item\/14314\/revisions"}],"wp:attachment":[{"href":"https:\/\/nokobox.com\/index.php\/wp-json\/wp\/v2\/media?parent=14314"}],"wp:term":[{"taxonomy":"dgi_category","embeddable":true,"href":"https:\/\/nokobox.com\/index.php\/wp-json\/wp\/v2\/dgi_category?post=14314"},{"taxonomy":"dgi_tag","embeddable":true,"href":"https:\/\/nokobox.com\/index.php\/wp-json\/wp\/v2\/dgi_tag?post=14314"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}