{
    "componentChunkName": "component---src-templates-learn-js",
    "path": "/learn/ds/roadmap",
    "result": {"data":{"mdx":{"frontmatter":{"title":"Roadmap to DSA","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 DSA\",\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\",\n    mdxType: \"AccordationRoadMap\"\n  }, mdx(\"ul\", null, mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"Introduction\")))), mdx(AccordationRoadMap, {\n    title: \"Choosing programming language\",\n    mdxType: \"AccordationRoadMap\"\n  }, mdx(\"ul\", null, mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"Choosing programming language\")))), mdx(AccordationRoadMap, {\n    title: \"Number Systems\",\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  }, \"Binary Number Systems\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"Decimal Number Systems\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"Octal Number Systems\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"HexaDecimal Number Systems\")))), mdx(AccordationRoadMap, {\n    title: \"Binary Operations\",\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  }, \"Binary Addition\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"Binary Substraction\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"Binary Multiplication\")), mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"Binary Division\")))), mdx(AccordationRoadMap, {\n    title: \"Bit Manipulation\",\n    mdxType: \"AccordationRoadMap\"\n  }, mdx(\"ul\", null, mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"Bit Manipulation\")))), mdx(AccordationRoadMap, {\n    title: \"Time Complexity and space\",\n    mdxType: \"AccordationRoadMap\"\n  }, mdx(\"ul\", null, mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"Time Complexity and space\")))), mdx(AccordationRoadMap, {\n    title: \"Linear Data Structures\",\n    mdxType: \"AccordationRoadMap\"\n  }, mdx(\"ul\", null, mdx(\"li\", null, mdx(\"a\", {\n    href: \"intro\"\n  }, \"What are Linear Data Structures\")))), 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":"ds/roadmap"},"allMdx":{"edges":[{"node":{"slug":"ds/arrays","id":"8ab43cbe-bc50-5590-925e-1a45d7028386"}},{"node":{"slug":"ds/binary_addition","id":"26e70246-f787-5a17-baa8-9375bbacc879"}},{"node":{"slug":"ds/binary_divison","id":"ec6f892f-531e-5661-8a44-d08f906ecba5"}},{"node":{"slug":"ds/binary_operations","id":"b2e4a072-3108-546d-a06a-646e43d834cc"}},{"node":{"slug":"ds/binary_multiplication","id":"0b241fae-5107-5843-b21e-7a5ed393168f"}},{"node":{"slug":"ds/binary_substraction","id":"18f53266-039e-5e0c-af57-37c05a2e80ec"}},{"node":{"slug":"ds/linear_data_structures","id":"0d96c16b-7430-59aa-b81a-73e67dcfd3d2"}},{"node":{"slug":"ds/bit_manipulation","id":"03ba2551-8800-5f50-9724-3a84d09a5989"}},{"node":{"slug":"ds/intro","id":"67e2c78b-07c3-57cf-9984-08e405f77783"}},{"node":{"slug":"ds/roadmap","id":"f7856a33-93ca-5464-8e5a-d5dc41765650"}},{"node":{"slug":"ds/programming_language","id":"ac14fda6-ff3a-5306-964a-3ce25168a6f0"}},{"node":{"slug":"ds/number_systems","id":"12494952-aaee-5db2-91ef-4db461c5b95c"}},{"node":{"slug":"ds/time_space_complex","id":"b7695373-5e9c-56c5-9b7f-5a632785916f"}}]}},"pageContext":{"id":"f7856a33-93ca-5464-8e5a-d5dc41765650","filePath":"/ds/","previousPostId":"ds/intro","nextPostId":"ds/programming_language"}},
    "staticQueryHashes": ["2033233798"]}