---
title: 'Data Structure (Basic)'
description: 'https://leetcode.com/study-plan/data-structure'
hide_table_of_contents: true
sidebar_position: 20
keywords:
  - leetcode
  - study plan
  - roadmap
  - Data Structure - I
---

export const problems = [
  {
    "problemName": "217. Contains Duplicate",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/contains-duplicate",
    "solutionLink": "../../solutions/0200-0299/contains-duplicate-easy"
  },
  {
    "problemName": "53. Maximum Subarray",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/maximum-subarray",
    "solutionLink": "../../solutions/0000-0099/maximum-subarray-medium"
  },
  {
    "problemName": "1. Two Sum",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/two-sum/",
    "solutionLink": "../../solutions/0000-0099/two-sum"
  },
  {
    "problemName": "88. Merge Sorted Array",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/merge-sorted-array",
    "solutionLink": "../../solutions/0000-0099/merge-sorted-array-easy"
  },
  {
    "problemName": "350. Intersection of Two Arrays II",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/intersection-of-two-arrays-ii",
    "solutionLink": ""
  },
  {
    "problemName": "121. Best Time to Buy and Sell Stock",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock",
    "solutionLink": "../../solutions/0100-0199/best-time-to-buy-and-sell-stock-easy"
  },
  {
    "problemName": "566. Reshape the Matrix",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/reshape-the-matrix",
    "solutionLink": ""
  },
  {
    "problemName": "118. Pascal's Triangle",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/pascals-triangle",
    "solutionLink": "../../solutions/0100-0199/pascals-triangle-easy"
  },
  {
    "problemName": "36. Valid Sudoku",
    "difficulty": "Medium",
    "leetCodeLink": "https://leetcode.com/problems/valid-sudoku/",
    "solutionLink": "../../solutions/0000-0099/valid-sudoku-easy"
  },
  {
    "problemName": "74. Search a 2D Matrix",
    "difficulty": "Medium",
    "leetCodeLink": "https://leetcode.com/problems/search-a-2d-matrix",
    "solutionLink": "../../solutions/0000-0099/search-a-2d-matrix-medium"
  },
  {
    "problemName": "387. First Unique Character in a String",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/first-unique-character-in-a-string/",
    "solutionLink": ""
  },
  {
    "problemName": "383. Ransom Note",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/ransom-note/",
    "solutionLink": "../../solutions/0300-0399/ransom-note-easy"
  },
  {
    "problemName": "242. Valid Anagram",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/valid-anagram/",
    "solutionLink": "../../solutions/0200-0299/valid-anagram-easy"
  },
  {
    "problemName": "141. Linked List Cycle",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/linked-list-cycle/",
    "solutionLink": "../../solutions/0100-0199/linked-list-cycle"
  },
  {
    "problemName": "21. Merge Two Sorted Lists",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/merge-two-sorted-lists/",
    "solutionLink": ""
  },
  {
    "problemName": "203. Remove Linked List Elements",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/remove-linked-list-elements/",
    "solutionLink": ""
  },
  {
    "problemName": "206. Reverse Linked List",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/reverse-linked-list/",
    "solutionLink": "../../solutions/0200-0299/reverse-linked-list-easy"
  },
  {
    "problemName": "83. Remove Duplicates from Sorted List",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/remove-duplicates-from-sorted-list/",
    "solutionLink": ""
  },
  {
    "problemName": "20. Valid Parentheses",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/valid-parentheses/",
    "solutionLink": "../../solutions/0000-0099/valid-parentheses-easy"
  },
  {
    "problemName": "232. Implement Queue using Stacks",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/implement-queue-using-stacks/",
    "solutionLink": ""
  },
  {
    "problemName": "144. Binary Tree Preorder Traversal",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/binary-tree-preorder-traversal/",
    "solutionLink": "../../solutions/0100-0199/binary-tree-preorder-traversal-easy"
  },
  {
    "problemName": "94. Binary Tree Inorder Traversal",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/binary-tree-inorder-traversal/",
    "solutionLink": "../../solutions/0000-0099/binary-tree-inorder-traversal-easy"
  },
  {
    "problemName": "145. Binary Tree Postorder Traversal",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/binary-tree-postorder-traversal/",
    "solutionLink": "../../solutions/0100-0199/binary-tree-postorder-traversal-easy"
  },
  {
    "problemName": "102. Binary Tree Level Order Traversal",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/binary-tree-level-order-traversal/",
    "solutionLink": "../../solutions/0100-0199/binary-tree-level-order-traversal-medium"
  },
  {
    "problemName": "104. Maximum Depth of Binary Tree",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/maximum-depth-of-binary-tree/",
    "solutionLink": "../../solutions/0100-0199/maximum-depth-of-binary-tree-easy"
  },
  {
    "problemName": "101. Symmetric Tree",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/symmetric-tree/",
    "solutionLink": "../../solutions/0100-0199/symmetric-tree-easy"
  },
  {
    "problemName": "226. Invert Binary Tree",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/invert-binary-tree/",
    "solutionLink": "../../solutions/0200-0299/invert-binary-tree-easy"
  },
  {
    "problemName": "112. Path Sum",
    "difficulty": "Easy",
    "leetCodeLink": "https://leetcode.com/problems/path-sum/",
    "solutionLink": "../../solutions/0100-0199/path-sum-easy"
  },
]

<Table 
    title=""
    data={problems}
    isSorted={false}
    collectionLink="https://leetcode.com/study-plan/data-structure"
/>