{
    "componentChunkName": "component---src-templates-learn-js",
    "path": "/learn/js/roadmap",
    "result": {"data":{"mdx":{"frontmatter":{"title":"Roadmap to Javascript","date":"July 24, 2021","tags":["ds"],"description":"Data Structure Introduction"},"body":"var _excluded = [\"components\"];\n\nfunction _extends() { _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\n\nfunction _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }\n\nfunction _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\n\n/* @jsxRuntime classic */\n\n/* @jsx mdx */\nvar _frontmatter = {\n  \"title\": \"Roadmap to Javascript\",\n  \"date\": \"2021-07-24\",\n  \"description\": \"Data Structure Introduction\",\n  \"tags\": [\"ds\"],\n  \"type\": \"tuts\"\n};\n\nvar makeShortcode = function makeShortcode(name) {\n  return function MDXDefaultShortcode(props) {\n    console.warn(\"Component \" + name + \" was not imported, exported, or provided by MDXProvider as global scope\");\n    return mdx(\"div\", props);\n  };\n};\n\nvar AccordationRoadMap = makeShortcode(\"AccordationRoadMap\");\nvar layoutProps = {\n  _frontmatter: _frontmatter\n};\nvar MDXLayout = \"wrapper\";\nreturn function MDXContent(_ref) {\n  var components = _ref.components,\n      props = _objectWithoutProperties(_ref, _excluded);\n\n  return mdx(MDXLayout, _extends({}, layoutProps, props, {\n    components: components,\n    mdxType: \"MDXLayout\"\n  }), mdx(AccordationRoadMap, {\n    title: \"Introduction to Javascript\",\n    mdxType: \"AccordationRoadMap\"\n  }, mdx(\"ul\", null, mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"Introduction to Javascript\")))), mdx(AccordationRoadMap, {\n    title: \"The ECMAScript Guide\",\n    mdxType: \"AccordationRoadMap\"\n  }, mdx(\"ul\", null, mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"The ECMAScript Guide\")))), mdx(AccordationRoadMap, {\n    title: \"How Javascript is executed ?\",\n    mdxType: \"AccordationRoadMap\"\n  }, mdx(\"ul\", null, mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"How Javascript is executed ?\")))), mdx(AccordationRoadMap, {\n    title: \"The Javascript Glossary\",\n    mdxType: \"AccordationRoadMap\"\n  }, mdx(\"ul\", null, mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \" The Javascript Glossary\")))), mdx(AccordationRoadMap, {\n    title: \"Arrays\",\n    mdxType: \"AccordationRoadMap\"\n  }, mdx(\"ul\", null, mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \" Basics\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Operations\")), mdx(\"ul\", null, mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Insertion\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Deletion\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Replacing\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Searching\"))), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Dynamic Arrays\")))), mdx(AccordationRoadMap, {\n    title: \"Linked List\",\n    mdxType: \"AccordationRoadMap\"\n  }, mdx(\"ul\", null, mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Introduction\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Basics\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Types\")), mdx(\"ul\", null, mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Single Linked List \")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Double Linked List\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Circler Linked List\"))), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Adding First\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Adding Last\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Finding Node and index\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Removing First\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Removing Last\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Converting Linked List to Arrays\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Reversing an Linked List\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Find Kth Node from the End.\")))), mdx(AccordationRoadMap, {\n    title: \"Stacks\",\n    mdxType: \"AccordationRoadMap\"\n  }, mdx(\"ul\", null, mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"What are Stacks \")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"Why we use Stacks \")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Stack Implementation using Arrays\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Stack Implementation using Linked Lists\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Reversing String\")))), mdx(AccordationRoadMap, {\n    title: \"Queues\",\n    mdxType: \"AccordationRoadMap\"\n  }, mdx(\"ul\", null, mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"What are Queues \")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"Why we use Queues \")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Building Queues using Array\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Building Queues using Stack\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Priority Queues\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Implementing Circular Queues using Arrays \")))), mdx(AccordationRoadMap, {\n    title: \"Hash Tabes\",\n    mdxType: \"AccordationRoadMap\"\n  }, mdx(\"ul\", null, mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"Introduction\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"What are Hash Tables \")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Hash Functions\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Collions\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Chaining \")), \" \", mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Linear Probing \")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Building Hash tables using Array\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Inserting \")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Finding an element \")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"\"\n  }, \"Removing an element \")))), mdx(AccordationRoadMap, {\n    title: \"Non-Linear Data Structures\",\n    mdxType: \"AccordationRoadMap\"\n  }, mdx(\"ul\", null, mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"What are Non-Linear Data Structures\")))), mdx(AccordationRoadMap, {\n    title: \"Graphs\",\n    mdxType: \"AccordationRoadMap\"\n  }, mdx(\"ul\", null, mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"What are Graphs\")))), mdx(AccordationRoadMap, {\n    title: \"Trees\",\n    mdxType: \"AccordationRoadMap\"\n  }, mdx(\"ul\", null, mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"What are Trees\")))));\n}\n;\nMDXContent.isMDXComponent = true;","slug":"js/roadmap"},"allMdx":{"edges":[{"node":{"slug":"js/intro","id":"f20f183c-f457-5578-8c61-6e6dfac19742"}},{"node":{"slug":"js/roadmap","id":"dd837316-9226-5585-9d3b-fc5134b1ffd6"}}]}},"pageContext":{"id":"dd837316-9226-5585-9d3b-fc5134b1ffd6","filePath":"/js/","previousPostId":"js/intro","nextPostId":"css/anatomy-of-css"}},
    "staticQueryHashes": ["2033233798"]}