Files

 master

/

Data Structure 1

/

Copy path

Directory actions

More options

Directory actions

More options

Latest commit

 

History

History

 master

/

Data Structure 1

/

Top

Folders and files

Name		Name	Last commit message	Last commit date
parent directory ..
sources		sources
1. Two Sum.md		1. Two Sum.md
101. Symmetric Tree.md		101. Symmetric Tree.md
102. Binary Tree Level Order Traversal.md		102. Binary Tree Level Order Traversal.md
104. Maximum Depth of Binary Tree.md		104. Maximum Depth of Binary Tree.md
112. Path Sum.md		112. Path Sum.md
118. Pascal's Triangle.md		118. Pascal's Triangle.md
121. Best Time to Buy and Sell Stock.md		121. Best Time to Buy and Sell Stock.md
141. Linked List Cycle.md		141. Linked List Cycle.md
144. Binary Tree Preorder Traversal.md		144. Binary Tree Preorder Traversal.md
145. Binary Tree Postorder Traversal.md		145. Binary Tree Postorder Traversal.md
20. Valid Parentheses.md		20. Valid Parentheses.md
203. Remove Linked List Elements.md		203. Remove Linked List Elements.md
206. Reverse Linked List.md		206. Reverse Linked List.md
21. Merge Two Sorted Lists.md		21. Merge Two Sorted Lists.md
217. Contains Duplicate.md		217. Contains Duplicate.md
226. Invert Binary Tree.md		226. Invert Binary Tree.md
232. Implement Queue using Stacks.md		232. Implement Queue using Stacks.md
235. Lowest Common Ancestor of a Binary Search Tree.md		235. Lowest Common Ancestor of a Binary Search Tree.md
242. Valid Anagram.md		242. Valid Anagram.md
350. Intersection of Two Arrays II.md		350. Intersection of Two Arrays II.md
36. Valid Sudoku.md		36. Valid Sudoku.md
383. Ransom Note.md		383. Ransom Note.md
387. First Unique Character in a String.md		387. First Unique Character in a String.md
53. Maximum Subarray.md		53. Maximum Subarray.md
566. Reshape Matrix.md		566. Reshape Matrix.md
653. Two Sum IV - Input is a BST.md		653. Two Sum IV - Input is a BST.md
700. Search in a Binary Search Tree.md		700. Search in a Binary Search Tree.md
701. Insert into a Binary Search Tree.md		701. Insert into a Binary Search Tree.md
74. Search a 2D matrix.md		74. Search a 2D matrix.md
83. Remove Duplicates from Sorted List.md		83. Remove Duplicates from Sorted List.md
88. Merge Sorted Array.md		88. Merge Sorted Array.md
94. Binary Tree Inorder Traversal.md		94. Binary Tree Inorder Traversal.md
98. Validate Binary Search Tree.md		98. Validate Binary Search Tree.md
README.md		README.md
View all files

README.md

LeetCode Study Plan 📋 | Data Structures 1

Solutions

• 1. Two Sum - Brute Force and Dictionary

• 20. Valid Parentheses - Stack

• 21. Merge Two Sorted Lists - Linked List

• 36. Valid Sudoku - Array

• 53. Max Sub Array - Kadane's Algorithm

• 74. Search a 2D matrix - Array

• 83. Remove Duplicates from Sorted List - Recursion

• 88. Merge Sorted Array - Two Pointers, Compersion Sorting

• 94. Binary Tree Inorder Traversal - Tree

• 98. Validate Binary Search Tree - Tree

• 101. Symmetric Tree - Tree

• 102. Binary Tree Level Order Traversal - Tree

• 104. Maximum Depth of Binary Tree - Tree

• 112. Path Sum - Tree

• 118. Pascal's Triangle - Array

• 121. Best Time to Buy and Sell Stock

• 141. Linked List Cycle - Hashmap, Loop

• 144. Binary Tree Preorder Traversal - Tree

• 145. Binary Tree Postorder Traversal - Tree

• 203. Remove element from LinkedList - Recursion

• 206. Reverse the LinkedList - Recursion

• 217. Contains Duplication - Dictionary

• 226. Invert Binary Tree - Tree

• 232. Implement Queue - Stack

• 235. Lowest Common Ancestor of a Binary Search Tree - Tree

• 242. Valid Anagram - String, Hash Table

• 350. Intersection of Two Arrays II - Dictionary, Loops

• 383. Ransom Note - HashMap, Counting

• 387. First Unique Character in a String

• 566. Reshape Matrix -Array

• 653. Two Sum IV Input is a BST - Tree

• 700. Search in a Binary Search Tree - Tree

• 701. Insert into a Binary Search Tree - Tree