LeetCode-in-TypeScript

TypeScript-based LeetCode algorithm problem solutions, regularly updated.

"For coding interview preparation, LeetCode is one of the best online resource providing a rich library of more than 300 real coding interview questions for you to practice from using one of the 7 supported languages - C, C++, Java, Python, C#, JavaScript, Ruby."

• Data Structure II
• Algorithm I
• Algorithm II
• Binary Search I
• Binary Search II
• Dynamic Programming I
• Programming Skills I
• Programming Skills II
• Graph Theory I
• SQL I
• Level 1
• Level 2
• Udemy
• Data Structure I

Data Structure II

Day 1 Array

0015	3Sum	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n^2)_Space_O(1)	148	92.62

Day 2 Array

Day 3 Array

Day 4 Array

Day 5 Array

0560	Subarray Sum Equals K	Medium	Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Big_O_Time_O(n)_Space_O(n)	70	92.45

Day 6 String

Day 7 String

0763	Partition Labels	Medium	Top_100_Liked_Questions, String, Hash_Table, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1)	54	94.74

Day 8 String

Day 9 String

0005	Longest Palindromic Substring	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n)	68	95.34

Day 10 Linked List

0002	Add Two Numbers	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M))	92	77.86

Day 11 Linked List

Day 12 Linked List

0024	Swap Nodes in Pairs	Medium	Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1)	59	62.67

Day 13 Linked List

0025	Reverse Nodes in k-Group	Hard	Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k)	74	66.83

Day 14 Stack Queue

Day 15 Tree

Day 16 Tree

Day 17 Tree

Day 18 Tree

Day 19 Graph

Day 20 Heap Priority Queue

Day 21 Heap Priority Queue

Algorithm I

Day 1 Binary Search

0035	Search Insert Position	Easy	Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1)	51	80.95

Day 2 Two Pointers

Day 3 Two Pointers

Day 4 Two Pointers

Day 5 Two Pointers

0019	Remove Nth Node From End of List	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L)	54	87.87

Day 6 Sliding Window

0003	Longest Substring Without Repeating Characters	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1)	65	90.77

Day 7 Breadth First Search Depth First Search

Day 8 Breadth First Search Depth First Search

Day 9 Breadth First Search Depth First Search

Day 10 Recursion Backtracking

0021	Merge Two Sorted Lists	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n)	59	86.77

Day 11 Recursion Backtracking

Day 12 Dynamic Programming

Day 13 Bit Manipulation

Day 14 Bit Manipulation

Algorithm II

Day 1 Binary Search

0034	Find First and Last Position of Element in Sorted Array	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1)	45	98.05
0033	Search in Rotated Sorted Array	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1)	43	98.54

Day 2 Binary Search

Day 3 Two Pointers

0015	3Sum	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n^2)_Space_O(1)	148	92.62

Day 4 Two Pointers

0011	Container With Most Water	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1)	57	98.23

Day 5 Sliding Window

0438	Find All Anagrams in a String	Medium	Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m)_Space_O(1)	69	96.69

Day 6 Breadth First Search Depth First Search

Day 7 Breadth First Search Depth First Search

Day 8 Breadth First Search Depth First Search

Day 9 Recursion Backtracking

Day 10 Recursion Backtracking

Day 11 Recursion Backtracking

0017	Letter Combinations of a Phone Number	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n)	52	79.11
0022	Generate Parentheses	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n)	60	62.03

Day 12 Dynamic Programming

Day 13 Dynamic Programming

Day 14 Dynamic Programming

0005	Longest Palindromic Substring	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n)	68	95.34

Day 15 Dynamic Programming

Day 16 Dynamic Programming

Day 17 Dynamic Programming

1143	Longest Common Subsequence	Medium	Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(nm)_Space_O(nm)	94	80.56

Day 18 Dynamic Programming

Day 19 Bit Manipulation

Day 20 Others

Day 21 Others

Binary Search I

Day 1

Day 2

0035	Search Insert Position	Easy	Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1)	51	80.95

Day 3

Day 4

Day 5

0034	Find First and Last Position of Element in Sorted Array	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1)	45	98.05

Day 6

Day 7

Day 8

Day 9

Day 10

Day 11

0033	Search in Rotated Sorted Array	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1)	43	98.54

Day 12

Binary Search II

Day 1

Day 2

Day 3

Day 4

Day 5

Day 6

Day 7

Day 8

Day 9

Day 10

Day 11

Day 12

Day 13

Day 14

Day 15

Day 16

Day 17

Day 18

Day 19

Day 20

Dynamic Programming I

Day 1

Day 2

Day 3

Day 4

Day 5

Day 6

Day 7

Day 8

Day 9

Day 10

Day 11

Day 12

Day 13

Day 14

Day 15

Day 16

Day 17

0005	Longest Palindromic Substring	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n)	68	95.34

Day 18

Day 19

1143	Longest Common Subsequence	Medium	Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(nm)_Space_O(nm)	94	80.56

Day 20

Day 21

Programming Skills I

Day 1 Basic Data Type

Day 2 Operator

Day 3 Conditional Statements

Day 4 Loop

Day 5 Function

Day 6 Array

Day 7 Array

Day 8 String

Day 9 String

Day 10 Linked List and Tree

Day 11 Containers and Libraries

Day 12 Class and Object

Programming Skills II

Day 1

Day 2

Day 3

Day 4

Day 5

Day 6

0739	Daily Temperatures	Medium	Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(n)	194	97.36

Day 7

Day 8

Day 9

Day 10

Day 11

Day 12

0438	Find All Anagrams in a String	Medium	Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m)_Space_O(1)	69	96.69

Day 13

Day 14

Day 15

0002	Add Two Numbers	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M))	92	77.86

Day 16

Day 17

Day 18

Day 19

Day 20

Graph Theory I

Day 1 Matrix Related Problems

Day 2 Matrix Related Problems

Day 3 Matrix Related Problems

Day 4 Matrix Related Problems

Day 5 Matrix Related Problems

Day 6 Matrix Related Problems

Day 7 Standard Traversal

Day 8 Standard Traversal

Day 9 Standard Traversal

Day 10 Standard Traversal

Day 11 Breadth First Search

Day 12 Breadth First Search

Day 13 Graph Theory

Day 14 Graph Theory

SQL I

Day 1 Select

Day 2 Select and Order

Day 3 String Processing Functions

Day 4 Union and Select

Day 5 Union

Day 6 Union

Day 7 Function

Day 8 Function

Day 9 Control of Flow

Day 10 Where

Level 1

Day 1 Prefix Sum

Day 2 String

Day 3 Linked List

0021	Merge Two Sorted Lists	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n)	59	86.77

Day 4 Linked List

Day 5 Greedy

Day 6 Tree

Day 7 Binary Search

Day 8 Binary Search Tree

Day 9 Graph/BFS/DFS

Day 10 Dynamic Programming

Day 11 Dynamic Programming

Day 12 Sliding Window/Two Pointer

0438	Find All Anagrams in a String	Medium	Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m)_Space_O(1)	69	96.69

Day 13 Hashmap

0001	Two Sum	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n)	54	91.72

Day 14 Stack

Day 15 Heap

Level 2

Day 1 Implementation/Simulation

Day 2 String

Day 3 Linked List

0019	Remove Nth Node From End of List	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L)	54	87.87

Day 4 Linked List

Day 5 Greedy

Day 6 Tree

Day 7 Tree

0543	Diameter of Binary Tree	Easy	Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n)	61	80.89
0437	Path Sum III	Medium	Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n)	68	86.71

Day 8 Binary Search

0033	Search in Rotated Sorted Array	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1)	43	98.54

Day 9 Binary Search Tree

Day 10 Graph/BFS/DFS

Day 11 Graph/BFS/DFS

Day 12 Dynamic Programming

Day 13 Dynamic Programming

0416	Partition Equal Subset Sum	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Big_O_Time_O(nsums)_Space_O(nsums)	91	74.38

Day 14 Sliding Window/Two Pointer

0003	Longest Substring Without Repeating Characters	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1)	65	90.77

Day 15 Tree

Day 16 Design

Day 17 Interval

Day 18 Stack

Day 19 Union Find

Day 20 Brute Force/Backtracking

Udemy

Udemy Integers

0007	Reverse Integer	Medium	Top_Interview_Questions, Math	56	95.68
0009	Palindrome Number	Easy	Math	137	88.64

Udemy Strings

0003	Longest Substring Without Repeating Characters	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1)	65	90.77
0020	Valid Parentheses	Easy	Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n)	50	95.90
0005	Longest Palindromic Substring	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n)	68	95.34

Udemy Binary Search

0033	Search in Rotated Sorted Array	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1)	43	98.54

Udemy Arrays

0001	Two Sum	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n)	54	91.72

Udemy Two Pointers

0015	3Sum	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n^2)_Space_O(1)	148	92.62

Udemy Famous Algorithm

Udemy Sorting Algorithms

Udemy 2D Arrays/Matrix

Udemy Linked List

0024	Swap Nodes in Pairs	Medium	Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1)	59	62.67
0021	Merge Two Sorted Lists	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n)	59	86.77
0025	Reverse Nodes in k-Group	Hard	Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k)	74	66.83

Udemy Tree Stack Queue

0543	Diameter of Binary Tree	Easy	Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n)	61	80.89

Udemy Trie and Heap

Udemy Graph

Udemy Dynamic Programming

1143	Longest Common Subsequence	Medium	Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(nm)_Space_O(nm)	94	80.56
0010	Regular Expression Matching	Hard	Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Recursion, Big_O_Time_O(mn)_Space_O(mn)	69	92.65

Udemy Backtracking/Recursion

0022	Generate Parentheses	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n)	60	62.03
0017	Letter Combinations of a Phone Number	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n)	52	79.11

Udemy Bit Manipulation

Udemy Design

Data Structure I

Day 1 Array

Day 2 Array

0001	Two Sum	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n)	54	91.72

Day 3 Array

Day 4 Array

Day 5 Array

Day 6 String

Day 7 Linked List

0021	Merge Two Sorted Lists	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n)	59	86.77

Day 8 Linked List

Day 9 Stack Queue

0020	Valid Parentheses	Easy	Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n)	50	95.90

Day 10 Tree

Day 11 Tree

Day 12 Tree

Day 13 Tree

Day 14 Tree

Algorithms

#	Title	Difficulty	Tag	Time, ms	Time, %
1143	Longest Common Subsequence	Medium	Top_100_Liked_Questions, String, Dynamic_Programming, Algorithm_II_Day_17_Dynamic_Programming, Dynamic_Programming_I_Day_19, Udemy_Dynamic_Programming, Big_O_Time_O(nm)_Space_O(nm)	94	80.56
0763	Partition Labels	Medium	Top_100_Liked_Questions, String, Hash_Table, Greedy, Two_Pointers, Data_Structure_II_Day_7_String, Big_O_Time_O(n)_Space_O(1)	54	94.74
0739	Daily Temperatures	Medium	Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, Programming_Skills_II_Day_6, Big_O_Time_O(n)_Space_O(n)	194	97.36
0647	Palindromic Substrings	Medium	Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n)	60	89.76
0560	Subarray Sum Equals K	Medium	Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Data_Structure_II_Day_5_Array, Big_O_Time_O(n)_Space_O(n)	70	92.45
0543	Diameter of Binary Tree	Easy	Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Level_2_Day_7_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(n)_Space_O(n)	61	80.89
0494	Target Sum	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Backtracking, Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s))	77	81.99
0438	Find All Anagrams in a String	Medium	Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Algorithm_II_Day_5_Sliding_Window, Programming_Skills_II_Day_12, Level_1_Day_12_Sliding_Window/Two_Pointer, Big_O_Time_O(n+m)_Space_O(1)	69	96.69
0437	Path Sum III	Medium	Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Level_2_Day_7_Tree, Big_O_Time_O(n)_Space_O(n)	68	86.71
0416	Partition Equal Subset Sum	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Level_2_Day_13_Dynamic_Programming, Big_O_Time_O(nsums)_Space_O(nsums)	91	74.38
0035	Search Insert Position	Easy	Top_100_Liked_Questions, Array, Binary_Search, Algorithm_I_Day_1_Binary_Search, Binary_Search_I_Day_2, Big_O_Time_O(log_n)_Space_O(1)	51	80.95
0034	Find First and Last Position of Element in Sorted Array	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Algorithm_II_Day_1_Binary_Search, Binary_Search_I_Day_5, Big_O_Time_O(log_n)_Space_O(1)	45	98.05
0033	Search in Rotated Sorted Array	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Algorithm_II_Day_1_Binary_Search, Binary_Search_I_Day_11, Level_2_Day_8_Binary_Search, Udemy_Binary_Search, Big_O_Time_O(log_n)_Space_O(1)	43	98.54
0032	Longest Valid Parentheses	Hard	Top_100_Liked_Questions, String, Dynamic_Programming, Stack, Big_O_Time_O(n)_Space_O(1)	56	89.31
0031	Next Permutation	Medium	Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1)	47	99.30
0025	Reverse Nodes in k-Group	Hard	Top_100_Liked_Questions, Linked_List, Recursion, Data_Structure_II_Day_13_Linked_List, Udemy_Linked_List, Big_O_Time_O(n)_Space_O(k)	74	66.83
0024	Swap Nodes in Pairs	Medium	Top_100_Liked_Questions, Linked_List, Recursion, Data_Structure_II_Day_12_Linked_List, Udemy_Linked_List, Big_O_Time_O(n)_Space_O(1)	59	62.67
0023	Merge k Sorted Lists	Hard	Top_100_Liked_Questions, Top_Interview_Questions, Heap_Priority_Queue, Linked_List, Divide_and_Conquer, Merge_Sort, Big_O_Time_O(knlog(k))_Space_O(log(k))	75	97.06
0022	Generate Parentheses	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Udemy_Backtracking/Recursion, Big_O_Time_O(2^n)_Space_O(n)	60	62.03
0021	Merge Two Sorted Lists	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Data_Structure_I_Day_7_Linked_List, Algorithm_I_Day_10_Recursion_Backtracking, Level_1_Day_3_Linked_List, Udemy_Linked_List, Big_O_Time_O(m+n)_Space_O(m+n)	59	86.77
0020	Valid Parentheses	Easy	Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Data_Structure_I_Day_9_Stack_Queue, Udemy_Strings, Big_O_Time_O(n)_Space_O(n)	50	95.90
0019	Remove Nth Node From End of List	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Algorithm_I_Day_5_Two_Pointers, Level_2_Day_3_Linked_List, Big_O_Time_O(L)_Space_O(L)	54	87.87
0017	Letter Combinations of a Phone Number	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Udemy_Backtracking/Recursion, Big_O_Time_O(4^n)_Space_O(n)	52	79.11
0015	3Sum	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Data_Structure_II_Day_1_Array, Algorithm_II_Day_3_Two_Pointers, Udemy_Two_Pointers, Big_O_Time_O(n^2)_Space_O(1)	148	92.62
0011	Container With Most Water	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Algorithm_II_Day_4_Two_Pointers, Big_O_Time_O(n)_Space_O(1)	57	98.23
0010	Regular Expression Matching	Hard	Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Recursion, Udemy_Dynamic_Programming, Big_O_Time_O(mn)_Space_O(mn)	69	92.65
0009	Palindrome Number	Easy	Math, Udemy_Integers	137	88.64
0008	String to Integer (atoi)	Medium	Top_Interview_Questions, String	56	99.01
0007	Reverse Integer	Medium	Top_Interview_Questions, Math, Udemy_Integers	56	95.68
0006	Zigzag Conversion	Medium	String	64	95.38
0005	Longest Palindromic Substring	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Data_Structure_II_Day_9_String, Algorithm_II_Day_14_Dynamic_Programming, Dynamic_Programming_I_Day_17, Udemy_Strings, Big_O_Time_O(n)_Space_O(n)	68	95.34
0004	Median of Two Sorted Arrays	Hard	Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Divide_and_Conquer, Big_O_Time_O(log(min(N,M)))_Space_O(1)	86	92.15
0003	Longest Substring Without Repeating Characters	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Algorithm_I_Day_6_Sliding_Window, Level_2_Day_14_Sliding_Window/Two_Pointer, Udemy_Strings, Big_O_Time_O(n)_Space_O(1)	65	90.77
0002	Add Two Numbers	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Data_Structure_II_Day_10_Linked_List, Programming_Skills_II_Day_15, Big_O_Time_O(max(N,M))_Space_O(max(N,M))	92	77.86
0001	Two Sum	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Data_Structure_I_Day_2_Array, Level_1_Day_13_Hashmap, Udemy_Arrays, Big_O_Time_O(n)_Space_O(n)	54	91.72

Contributing

Your ideas/fixes/algorithms are more than welcome!

1. Fork this repo
2. Clone your forked repo (git clone https://github.com/YOUR_GITHUB_USERNAME/LeetCode-in-TypeScript.git) onto your local machine
3. cd into your cloned directory, create your feature branch (git checkout -b my-awesome-fix)
4. git add your desired changes to this repo
5. Commit your changes (git commit -m 'Added some awesome features/fixes')
6. Push to the branch (git push origin my-awesome-feature)
7. Open your forked repo on Github website, create a new Pull Request to this repo!