"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."

• 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
• Top Interview 150
• Data Structure I
• Data Structure II
• Algorithm I
• Algorithm II

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)	0	100.00

Day 3

Day 4

0069	Sqrt(x)	Hard	Array, String, Simulation	0	100.00

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)	0	100.00

Day 6

Day 7

Day 8

0074	Search a 2D Matrix	Medium	Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1)	0	100.00

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)	0	100.00

Day 12

0153	Find Minimum in Rotated Sorted Array	Medium	Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N)	0	100.00

Binary Search II

Day 1

Day 2

Day 3

0300	Longest Increasing Subsequence	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n*log_n)_Space_O(n)	6	84.68

Day 4

Day 5

0287	Find the Duplicate Number	Medium	Top_100_Liked_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Big_O_Time_O(n)_Space_O(n)	5	88.65

Day 6

Day 7

Day 8

0240	Search a 2D Matrix II	Medium	Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1)	42	94.61

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

0070	Climbing Stairs	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n)	0	100.00

Day 3

0198	House Robber	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n)	0	100.00

Day 4

0055	Jump Game	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1)	0	100.00
0045	Jump Game II	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1)	1	84.27

Day 5

0053	Maximum Subarray	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1)	0	100.00

Day 6

0152	Maximum Product Subarray	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1)	0	100.00

Day 7

0121	Best Time to Buy and Sell Stock	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1)	1	96.44
0122	Best Time to Buy and Sell Stock II	Medium	Top_Interview_Questions, Array, Dynamic_Programming, Greedy	0	100.00

Day 8

Day 9

0139	Word Break	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max*N)_Space_O(M+N+max)	4	76.41
0042	Trapping Rain Water	Hard	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1)	0	100.00

Day 10

Day 11

0096	Unique Binary Search Trees	Medium	Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(1)	0	100.00

Day 12

Day 13

0120	Triangle	Medium	Array, Dynamic_Programming	0	100.00

Day 14

Day 15

0062	Unique Paths	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m*n)_Space_O(m*n)	0	100.00
0063	Unique Paths II	Medium	Array, Dynamic_Programming, Matrix	0	100.00

Day 16

0064	Minimum Path Sum	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m*n)_Space_O(m*n)	4	70.73
0221	Maximal Square	Medium	Array, Dynamic_Programming, Matrix, Big_O_Time_O(m*n)_Space_O(m*n)	18	59.02

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)	8	99.14

Day 18

0300	Longest Increasing Subsequence	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n*log_n)_Space_O(n)	6	84.68

Day 19

1143	Longest Common Subsequence	Medium	Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n*m)_Space_O(n*m)	50	69.40
0072	Edit Distance	Medium	Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2)	6	93.83

Day 20

0322	Coin Change	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m*n)_Space_O(amount)	27	89.42

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

0283	Move Zeroes	Easy	Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1)	1	82.86

Day 7 Array

Day 8 String

Day 9 String

Day 10 Linked List and Tree

0104	Maximum Depth of Binary Tree	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(H)	0	100.00

Day 11 Containers and Libraries

Day 12 Class and Object

Programming Skills II

Day 1

0028	Implement strStr()	Easy	Top_Interview_Questions, String, Two_Pointers, String_Matching	0	100.00

Day 2

Day 3

0066	Plus One	Easy	Top_Interview_Questions, Array, Math	0	100.00

Day 4

Day 5

0067	Add Binary	Easy	String, Math, Bit_Manipulation, Simulation	0	100.00

Day 6

0739	Daily Temperatures	Medium	Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(n)	18	80.57
0058	Length of Last Word	Easy	String	0	100.00

Day 7

0048	Rotate Image	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1)	0	100.00

Day 8

0054	Spiral Matrix	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Simulation	0	100.00

Day 9

Day 10

Day 11

0049	Group Anagrams	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n*k_log_k)_Space_O(n)	27	78.99

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)	8	97.80

Day 13

Day 14

0138	Copy List with Random Pointer	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Big_O_Time_O(N)_Space_O(N)	49	72.42

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)), AI_can_be_used_to_solve_the_task	2	95.82

Day 16

0061	Rotate List	Medium	Two_Pointers, Linked_List	0	100.00

Day 17

Day 18

0155	Min Stack	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N)	5	99.10

Day 19

Day 20

Graph Theory I

Day 1 Matrix Related Problems

0200	Number of Islands	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M*N)_Space_O(M*N)	57	93.94

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

0127	Word Ladder	Hard	Top_Interview_Questions, String, Hash_Table, Breadth_First_Search	41	95.63

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)	1	51.21
0206	Reverse Linked List	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1)	0	100.00

Day 4 Linked List

0142	Linked List Cycle II	Medium	Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1)	51	76.99

Day 5 Greedy

0121	Best Time to Buy and Sell Stock	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1)	1	96.44

Day 6 Tree

0102	Binary Tree Level Order Traversal	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N)	0	100.00

Day 7 Binary Search

Day 8 Binary Search Tree

0098	Validate Binary Search Tree	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N))	0	100.00

Day 9 Graph/BFS/DFS

0200	Number of Islands	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M*N)_Space_O(M*N)	57	93.94

Day 10 Dynamic Programming

0070	Climbing Stairs	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n)	0	100.00

Day 11 Dynamic Programming

0062	Unique Paths	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m*n)_Space_O(m*n)	0	100.00

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)	8	97.80

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), AI_can_be_used_to_solve_the_task	1	89.70

Day 14 Stack

0394	Decode String	Medium	Top_100_Liked_Questions, String, Stack, Recursion, Big_O_Time_O(n)_Space_O(n)	0	100.00

Day 15 Heap

Level 2

Day 1 Implementation/Simulation

0054	Spiral Matrix	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Simulation	0	100.00

Day 2 String

0014	Longest Common Prefix	Easy	Top_100_Liked_Questions, Top_Interview_Questions, String	0	100.00

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)	0	100.00
0234	Palindrome Linked List	Easy	Top_100_Liked_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1)	3	92.85

Day 4 Linked List

0148	Sort List	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort, Big_O_Time_O(log(N))_Space_O(log(N))	36	44.94

Day 5 Greedy

Day 6 Tree

0226	Invert Binary Tree	Easy	Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n)	0	100.00

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)	1	87.16
0437	Path Sum III	Medium	Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n)	3	86.41

Day 8 Binary Search

0074	Search a 2D Matrix	Medium	Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1)	0	100.00
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)	0	100.00

Day 9 Binary Search Tree

0108	Convert Sorted Array to Binary Search Tree	Easy	Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer	0	100.00
0230	Kth Smallest Element in a BST	Medium	Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n)	0	100.00

Day 10 Graph/BFS/DFS

Day 11 Graph/BFS/DFS

Day 12 Dynamic Programming

0198	House Robber	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n)	0	100.00
0322	Coin Change	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m*n)_Space_O(amount)	27	89.42

Day 13 Dynamic Programming

0416	Partition Equal Subset Sum	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Big_O_Time_O(n*sums)_Space_O(n*sums)	33	93.24
0152	Maximum Product Subarray	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1)	0	100.00

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), AI_can_be_used_to_solve_the_task	3	96.91
0076	Minimum Window Substring	Hard	Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(s.length())_Space_O(1)	20	90.35

Day 15 Tree

0101	Symmetric Tree	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(log(N))	0	100.00

Day 16 Design

0155	Min Stack	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N)	5	99.10
0208	Implement Trie (Prefix Tree)	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N)	48	63.95

Day 17 Interval

0057	Insert Interval	Medium	Array	0	100.00
0056	Merge Intervals	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n)	7	87.99

Day 18 Stack

Day 19 Union Find

Day 20 Brute Force/Backtracking

0039	Combination Sum	Medium	Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n)	1	98.17
0046	Permutations	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n*n!)_Space_O(n+n!)	1	84.44

Udemy

Udemy Integers

0136	Single Number	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1)	1	78.27
0007	Reverse Integer	Medium	Top_Interview_Questions, Math	53	83.14
0009	Palindrome Number	Easy	Math	3	99.14
0050	Pow(x, n)	Medium	Top_Interview_Questions, Math, Recursion	0	100.00

Udemy Strings

0014	Longest Common Prefix	Easy	Top_100_Liked_Questions, Top_Interview_Questions, String	0	100.00
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), AI_can_be_used_to_solve_the_task	3	96.91
0020	Valid Parentheses	Easy	Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n)	1	86.85
0005	Longest Palindromic Substring	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n)	8	99.14
0394	Decode String	Medium	Top_100_Liked_Questions, String, Stack, Recursion, Big_O_Time_O(n)_Space_O(n)	0	100.00
0049	Group Anagrams	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n*k_log_k)_Space_O(n)	27	78.99

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)	0	100.00
0153	Find Minimum in Rotated Sorted Array	Medium	Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N)	0	100.00

Udemy Arrays

0121	Best Time to Buy and Sell Stock	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1)	1	96.44
0283	Move Zeroes	Easy	Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1)	1	82.86
0001	Two Sum	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task	1	89.70
0058	Length of Last Word	Easy	String	0	100.00
0122	Best Time to Buy and Sell Stock II	Medium	Top_Interview_Questions, Array, Dynamic_Programming, Greedy	0	100.00
0080	Remove Duplicates from Sorted Array II	Medium	Array, Two_Pointers	40	99.63
0189	Rotate Array	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1)	1	86.17
0055	Jump Game	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1)	0	100.00
0075	Sort Colors	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n)_Space_O(1)	0	100.00
0066	Plus One	Easy	Top_Interview_Questions, Array, Math	0	100.00
0238	Product of Array Except Self	Medium	Top_100_Liked_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n)	3	92.81
0041	First Missing Positive	Hard	Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n)	1	99.11
0239	Sliding Window Maximum	Hard	Top_100_Liked_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue, Big_O_Time_O(n*k)_Space_O(n+k)	26	99.07

Udemy Two Pointers

0125	Valid Palindrome	Easy	Top_Interview_Questions, String, Two_Pointers	0	100.00
0026	Remove Duplicates from Sorted Array	Easy	Top_Interview_Questions, Array, Two_Pointers	0	100.00
0042	Trapping Rain Water	Hard	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1)	0	100.00
0015	3Sum	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n*log(n))_Space_O(n^2)	30	91.56

Udemy Famous Algorithm

0053	Maximum Subarray	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1)	0	100.00
0169	Majority Element	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1)	0	100.00

Udemy Sorting Algorithms

Udemy 2D Arrays/Matrix

0074	Search a 2D Matrix	Medium	Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1)	0	100.00
0054	Spiral Matrix	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Simulation	0	100.00
0048	Rotate Image	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1)	0	100.00
0073	Set Matrix Zeroes	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Matrix, Big_O_Time_O(m*n)_Space_O(1)	4	50.63
0056	Merge Intervals	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n)	7	87.99

Udemy Linked List

0114	Flatten Binary Tree to Linked List	Medium	Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List, Big_O_Time_O(N)_Space_O(N)	0	100.00
0061	Rotate List	Medium	Two_Pointers, Linked_List	0	100.00
0024	Swap Nodes in Pairs	Medium	Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1)	0	100.00
0142	Linked List Cycle II	Medium	Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1)	51	76.99
0141	Linked List Cycle	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1)	47	89.37
0206	Reverse Linked List	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1)	0	100.00
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)	1	51.21
0160	Intersection of Two Linked Lists	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(M+N)_Space_O(1)	65	72.36
0234	Palindrome Linked List	Easy	Top_100_Liked_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1)	3	92.85
0138	Copy List with Random Pointer	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Big_O_Time_O(N)_Space_O(N)	49	72.42
0025	Reverse Nodes in k-Group	Hard	Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k)	0	100.00
0146	LRU Cache	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Big_O_Time_O(1)_Space_O(capacity)	97	81.52

Udemy Tree Stack Queue

0094	Binary Tree Inorder Traversal	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Big_O_Time_O(n)_Space_O(n)	0	100.00
0102	Binary Tree Level Order Traversal	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N)	0	100.00
0103	Binary Tree Zigzag Level Order Traversal	Medium	Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree	0	100.00
0108	Convert Sorted Array to Binary Search Tree	Easy	Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer	0	100.00
0543	Diameter of Binary Tree	Easy	Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n)	1	87.16
0226	Invert Binary Tree	Easy	Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n)	0	100.00
0104	Maximum Depth of Binary Tree	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(H)	0	100.00
0124	Binary Tree Maximum Path Sum	Hard	Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N)	2	71.11
0098	Validate Binary Search Tree	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N))	0	100.00
0236	Lowest Common Ancestor of a Binary Tree	Medium	Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n)	61	75.97

Udemy Trie and Heap

0208	Implement Trie (Prefix Tree)	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N)	48	63.95

Udemy Graph

0200	Number of Islands	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M*N)_Space_O(M*N)	57	93.94

Udemy Dynamic Programming

0120	Triangle	Medium	Array, Dynamic_Programming	0	100.00
0139	Word Break	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max*N)_Space_O(M+N+max)	4	76.41
0152	Maximum Product Subarray	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1)	0	100.00
0198	House Robber	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n)	0	100.00
0070	Climbing Stairs	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n)	0	100.00
0064	Minimum Path Sum	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m*n)_Space_O(m*n)	4	70.73
0300	Longest Increasing Subsequence	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n*log_n)_Space_O(n)	6	84.68
1143	Longest Common Subsequence	Medium	Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n*m)_Space_O(n*m)	50	69.40
0072	Edit Distance	Medium	Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2)	6	93.83
0010	Regular Expression Matching	Hard	Top_Interview_Questions, String, Dynamic_Programming, Recursion, Big_O_Time_O(m*n)_Space_O(m*n)	5	90.44

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)	1	72.82
0039	Combination Sum	Medium	Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n)	1	98.17
0078	Subsets	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Big_O_Time_O(2^n)_Space_O(n*2^n)	0	100.00
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)	0	100.00
0046	Permutations	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n*n!)_Space_O(n+n!)	1	84.44

Udemy Bit Manipulation

0338	Counting Bits	Easy	Dynamic_Programming, Bit_Manipulation, Big_O_Time_O(num)_Space_O(num)	1	89.22

Udemy Design

0155	Min Stack	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N)	5	99.10

Top Interview 150

Top Interview 150 Array/String

0088	Merge Sorted Array	Medium	Two_Pointers, Linked_List	0	100.00
0027	Remove Element	Easy	Array, Two_Pointers	0	100.00
0026	Remove Duplicates from Sorted Array	Easy	Top_Interview_Questions, Array, Two_Pointers	0	100.00
0080	Remove Duplicates from Sorted Array II	Medium	Array, Two_Pointers	40	99.63
0169	Majority Element	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1)	0	100.00
0189	Rotate Array	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1)	1	86.17
0121	Best Time to Buy and Sell Stock	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1)	1	96.44
0122	Best Time to Buy and Sell Stock II	Medium	Top_Interview_Questions, Array, Dynamic_Programming, Greedy	0	100.00
0055	Jump Game	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1)	0	100.00
0045	Jump Game II	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1)	1	84.27
0238	Product of Array Except Self	Medium	Top_100_Liked_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n)	3	92.81
0134	Gas Station	Medium	Top_Interview_Questions, Array, Greedy	0	100.00
0135	Candy	Hard	Array, Greedy	2	96.15
0042	Trapping Rain Water	Hard	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1)	0	100.00
0013	Roman to Integer	Easy	Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Math	3	94.58
0012	Integer to Roman	Medium	String, Hash_Table, Math	3	93.02
0058	Length of Last Word	Easy	String	0	100.00
0014	Longest Common Prefix	Easy	Top_100_Liked_Questions, Top_Interview_Questions, String	0	100.00
0006	Zigzag Conversion	Medium	String	2	99.08
0028	Implement strStr()	Easy	Top_Interview_Questions, String, Two_Pointers, String_Matching	0	100.00
0068	Text Justification	Hard	Array, String, Simulation	0	100.00

Top Interview 150 Two Pointers

0125	Valid Palindrome	Easy	Top_Interview_Questions, String, Two_Pointers	0	100.00
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)	2	80.13
0015	3Sum	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n*log(n))_Space_O(n^2)	30	91.56

Top Interview 150 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), AI_can_be_used_to_solve_the_task	3	96.91
0030	Substring with Concatenation of All Words	Hard	String, Hash_Table, Sliding_Window	13	97.44
0076	Minimum Window Substring	Hard	Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(s.length())_Space_O(1)	20	90.35

Top Interview 150 Matrix

0036	Valid Sudoku	Medium	Top_Interview_Questions, Array, Hash_Table, Matrix	1	99.60
0054	Spiral Matrix	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Simulation	0	100.00
0048	Rotate Image	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1)	0	100.00
0073	Set Matrix Zeroes	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Matrix, Big_O_Time_O(m*n)_Space_O(1)	4	50.63

Top Interview 150 Hashmap

0049	Group Anagrams	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n*k_log_k)_Space_O(n)	27	78.99
0001	Two Sum	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task	1	89.70
0128	Longest Consecutive Sequence	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Union_Find, Big_O_Time_O(N_log_N)_Space_O(1)	34	90.07

Top Interview 150 Intervals

0056	Merge Intervals	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n)	7	87.99
0057	Insert Interval	Medium	Array	0	100.00

Top Interview 150 Stack

0020	Valid Parentheses	Easy	Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n)	1	86.85
0071	Simplify Path	Medium	String, Stack	0	100.00
0155	Min Stack	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N)	5	99.10

Top Interview 150 Linked List

0141	Linked List Cycle	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1)	47	89.37
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)), AI_can_be_used_to_solve_the_task	2	95.82
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)	1	51.21
0138	Copy List with Random Pointer	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Big_O_Time_O(N)_Space_O(N)	49	72.42
0092	Reverse Linked List II	Medium	Linked_List	0	100.00
0025	Reverse Nodes in k-Group	Hard	Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k)	0	100.00
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)	0	100.00
0082	Remove Duplicates from Sorted List II	Medium	Two_Pointers, Linked_List	0	100.00
0061	Rotate List	Medium	Two_Pointers, Linked_List	0	100.00
0086	Partition List	Medium	Two_Pointers, Linked_List	0	100.00
0146	LRU Cache	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Big_O_Time_O(1)_Space_O(capacity)	97	81.52

Top Interview 150 Binary Tree General

0104	Maximum Depth of Binary Tree	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(H)	0	100.00
0226	Invert Binary Tree	Easy	Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n)	0	100.00
0101	Symmetric Tree	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(log(N))	0	100.00
0105	Construct Binary Tree from Preorder and Inorder Traversal	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Big_O_Time_O(N)_Space_O(N)	2	93.38
0106	Construct Binary Tree from Inorder and Postorder Traversal	Medium	Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer	1	98.78
0117	Populating Next Right Pointers in Each Node II	Medium	Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List	47	97.74
0114	Flatten Binary Tree to Linked List	Medium	Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List, Big_O_Time_O(N)_Space_O(N)	0	100.00
0112	Path Sum	Easy	Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree	0	100.00
0129	Sum Root to Leaf Numbers	Medium	Depth_First_Search, Tree, Binary_Tree	0	100.00
0124	Binary Tree Maximum Path Sum	Hard	Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N)	2	71.11
0236	Lowest Common Ancestor of a Binary Tree	Medium	Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n)	61	75.97

Top Interview 150 Binary Tree BFS

0102	Binary Tree Level Order Traversal	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N)	0	100.00
0103	Binary Tree Zigzag Level Order Traversal	Medium	Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree	0	100.00

Top Interview 150 Binary Search Tree

0230	Kth Smallest Element in a BST	Medium	Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n)	0	100.00
0098	Validate Binary Search Tree	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N))	0	100.00

Top Interview 150 Graph General

0200	Number of Islands	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M*N)_Space_O(M*N)	57	93.94
0207	Course Schedule	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort, Big_O_Time_O(N)_Space_O(N)	11	81.08

Top Interview 150 Graph BFS

0127	Word Ladder	Hard	Top_Interview_Questions, String, Hash_Table, Breadth_First_Search	41	95.63

Top Interview 150 Trie

0208	Implement Trie (Prefix Tree)	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N)	48	63.95

Top Interview 150 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)	0	100.00
0077	Combinations	Medium	Backtracking	46	96.14
0046	Permutations	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n*n!)_Space_O(n+n!)	1	84.44
0039	Combination Sum	Medium	Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n)	1	98.17
0052	N-Queens II	Hard	Backtracking	1	96.89
0022	Generate Parentheses	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n)	1	72.82
0079	Word Search	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Big_O_Time_O(4^(m*n))_Space_O(m*n)	243	85.30

Top Interview 150 Divide and Conquer

0108	Convert Sorted Array to Binary Search Tree	Easy	Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer	0	100.00
0148	Sort List	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort, Big_O_Time_O(log(N))_Space_O(log(N))	36	44.94
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(k*n*log(k))_Space_O(log(k))	4	97.65

Top Interview 150 Kadane's Algorithm

0053	Maximum Subarray	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1)	0	100.00

Top Interview 150 Binary Search

0035	Search Insert Position	Easy	Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1)	0	100.00
0074	Search a 2D Matrix	Medium	Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1)	0	100.00
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)	0	100.00
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)	0	100.00
0153	Find Minimum in Rotated Sorted Array	Medium	Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N)	0	100.00
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), AI_can_be_used_to_solve_the_task	3	82.74

Top Interview 150 Heap

0215	Kth Largest Element in an Array	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, Big_O_Time_O(n*log(n))_Space_O(log(n))	4	99.64
0295	Find Median from Data Stream	Hard	Top_100_Liked_Questions, Sorting, Two_Pointers, Design, Heap_Priority_Queue, Data_Stream, Big_O_Time_O(n*log_n)_Space_O(n)	106	92.31

Top Interview 150 Bit Manipulation

0067	Add Binary	Easy	String, Math, Bit_Manipulation, Simulation	0	100.00
0136	Single Number	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1)	1	78.27
0137	Single Number II	Medium	Array, Bit_Manipulation	0	100.00

Top Interview 150 Math

0009	Palindrome Number	Easy	Math	3	99.14
0066	Plus One	Easy	Top_Interview_Questions, Array, Math	0	100.00
0069	Sqrt(x)	Hard	Array, String, Simulation	0	100.00
0050	Pow(x, n)	Medium	Top_Interview_Questions, Math, Recursion	0	100.00

Top Interview 150 1D DP

0070	Climbing Stairs	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n)	0	100.00
0198	House Robber	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n)	0	100.00
0139	Word Break	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max*N)_Space_O(M+N+max)	4	76.41
0322	Coin Change	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m*n)_Space_O(amount)	27	89.42
0300	Longest Increasing Subsequence	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n*log_n)_Space_O(n)	6	84.68

Top Interview 150 Multidimensional DP

0120	Triangle	Medium	Array, Dynamic_Programming	0	100.00
0064	Minimum Path Sum	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m*n)_Space_O(m*n)	4	70.73
0063	Unique Paths II	Medium	Array, Dynamic_Programming, Matrix	0	100.00
0005	Longest Palindromic Substring	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n)	8	99.14
0097	Interleaving String	Medium	String, Dynamic_Programming	43	97.65
0072	Edit Distance	Medium	Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2)	6	93.83
0123	Best Time to Buy and Sell Stock III	Hard	Array, Dynamic_Programming	5	85.07
0221	Maximal Square	Medium	Array, Dynamic_Programming, Matrix, Big_O_Time_O(m*n)_Space_O(m*n)	18	59.02

Data Structure I

Day 1 Array

0053	Maximum Subarray	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1)	0	100.00

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), AI_can_be_used_to_solve_the_task	1	89.70
0088	Merge Sorted Array	Medium	Two_Pointers, Linked_List	0	100.00

Day 3 Array

0121	Best Time to Buy and Sell Stock	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1)	1	96.44

Day 4 Array

Day 5 Array

0036	Valid Sudoku	Medium	Top_Interview_Questions, Array, Hash_Table, Matrix	1	99.60
0074	Search a 2D Matrix	Medium	Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1)	0	100.00

Day 6 String

Day 7 Linked List

0141	Linked List Cycle	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1)	47	89.37
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)	1	51.21

Day 8 Linked List

0206	Reverse Linked List	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1)	0	100.00

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)	1	86.85

Day 10 Tree

0094	Binary Tree Inorder Traversal	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Big_O_Time_O(n)_Space_O(n)	0	100.00

Day 11 Tree

0102	Binary Tree Level Order Traversal	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N)	0	100.00
0104	Maximum Depth of Binary Tree	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(H)	0	100.00
0101	Symmetric Tree	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(log(N))	0	100.00

Day 12 Tree

0226	Invert Binary Tree	Easy	Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n)	0	100.00
0112	Path Sum	Easy	Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree	0	100.00

Day 13 Tree

Day 14 Tree

0098	Validate Binary Search Tree	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N))	0	100.00

Data Structure II

Day 1 Array

0136	Single Number	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1)	1	78.27
0169	Majority Element	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1)	0	100.00
0015	3Sum	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n*log(n))_Space_O(n^2)	30	91.56

Day 2 Array

0075	Sort Colors	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n)_Space_O(1)	0	100.00
0056	Merge Intervals	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n)	7	87.99

Day 3 Array

0048	Rotate Image	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1)	0	100.00

Day 4 Array

0240	Search a 2D Matrix II	Medium	Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1)	42	94.61

Day 5 Array

0238	Product of Array Except Self	Medium	Top_100_Liked_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n)	3	92.81
0560	Subarray Sum Equals K	Medium	Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Big_O_Time_O(n)_Space_O(n)	14	87.34

Day 6 String

Day 7 String

0763	Partition Labels	Medium	String, Hash_Table, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1)	4	86.89

Day 8 String

0049	Group Anagrams	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n*k_log_k)_Space_O(n)	27	78.99

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)	8	99.14

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)), AI_can_be_used_to_solve_the_task	2	95.82
0142	Linked List Cycle II	Medium	Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1)	51	76.99

Day 11 Linked List

0160	Intersection of Two Linked Lists	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(M+N)_Space_O(1)	65	72.36
0082	Remove Duplicates from Sorted List II	Medium	Two_Pointers, Linked_List	0	100.00

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)	0	100.00

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)	0	100.00

Day 14 Stack Queue

0155	Min Stack	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N)	5	99.10

Day 15 Tree

0108	Convert Sorted Array to Binary Search Tree	Easy	Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer	0	100.00
0105	Construct Binary Tree from Preorder and Inorder Traversal	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Big_O_Time_O(N)_Space_O(N)	2	93.38
0103	Binary Tree Zigzag Level Order Traversal	Medium	Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree	0	100.00

Day 16 Tree

Day 17 Tree

0230	Kth Smallest Element in a BST	Medium	Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n)	0	100.00

Day 18 Tree

0236	Lowest Common Ancestor of a Binary Tree	Medium	Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n)	61	75.97

Day 19 Graph

Day 20 Heap Priority Queue

0215	Kth Largest Element in an Array	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, Big_O_Time_O(n*log(n))_Space_O(log(n))	4	99.64
0347	Top K Frequent Elements	Medium	Top_100_Liked_Questions, Array, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Divide_and_Conquer, Quickselect, Bucket_Sort, Big_O_Time_O(n*log(n))_Space_O(k)	7	87.13

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)	0	100.00

Day 2 Two Pointers

0189	Rotate Array	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1)	1	86.17

Day 3 Two Pointers

0283	Move Zeroes	Easy	Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1)	1	82.86

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)	0	100.00

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), AI_can_be_used_to_solve_the_task	3	96.91

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)	1	51.21
0206	Reverse Linked List	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1)	0	100.00

Day 11 Recursion Backtracking

0077	Combinations	Medium	Backtracking	46	96.14
0046	Permutations	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n*n!)_Space_O(n+n!)	1	84.44

Day 12 Dynamic Programming

0070	Climbing Stairs	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n)	0	100.00
0198	House Robber	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n)	0	100.00
0120	Triangle	Medium	Array, Dynamic_Programming	0	100.00

Day 13 Bit Manipulation

Day 14 Bit Manipulation

0136	Single Number	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1)	1	78.27

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)	0	100.00
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)	0	100.00
0074	Search a 2D Matrix	Medium	Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1)	0	100.00

Day 2 Binary Search

0153	Find Minimum in Rotated Sorted Array	Medium	Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N)	0	100.00

Day 3 Two Pointers

0082	Remove Duplicates from Sorted List II	Medium	Two_Pointers, Linked_List	0	100.00
0015	3Sum	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n*log(n))_Space_O(n^2)	30	91.56

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)	2	80.13

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)	8	97.80

Day 6 Breadth First Search Depth First Search

0200	Number of Islands	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M*N)_Space_O(M*N)	57	93.94

Day 7 Breadth First Search Depth First Search

0117	Populating Next Right Pointers in Each Node II	Medium	Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List	47	97.74

Day 8 Breadth First Search Depth First Search

Day 9 Recursion Backtracking

0078	Subsets	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Big_O_Time_O(2^n)_Space_O(n*2^n)	0	100.00

Day 10 Recursion Backtracking

0039	Combination Sum	Medium	Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n)	1	98.17

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)	0	100.00
0022	Generate Parentheses	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n)	1	72.82
0079	Word Search	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Big_O_Time_O(4^(m*n))_Space_O(m*n)	243	85.30

Day 12 Dynamic Programming

0055	Jump Game	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1)	0	100.00

Day 13 Dynamic Programming

0045	Jump Game II	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1)	1	84.27
0062	Unique Paths	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m*n)_Space_O(m*n)	0	100.00

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)	8	99.14

Day 15 Dynamic Programming

0139	Word Break	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max*N)_Space_O(M+N+max)	4	76.41

Day 16 Dynamic Programming

0300	Longest Increasing Subsequence	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n*log_n)_Space_O(n)	6	84.68

Day 17 Dynamic Programming

1143	Longest Common Subsequence	Medium	Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n*m)_Space_O(n*m)	50	69.40

Day 18 Dynamic Programming

0072	Edit Distance	Medium	Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2)	6	93.83
0322	Coin Change	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m*n)_Space_O(amount)	27	89.42

Day 19 Bit Manipulation

Day 20 Others

Day 21 Others

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(n*m)_Space_O(n*m)	50	69.40
0763	Partition Labels	Medium	String, Hash_Table, Greedy, Two_Pointers, Data_Structure_II_Day_7_String, Big_O_Time_O(n)_Space_O(1)	4	86.89
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)	18	80.57
0647	Palindromic Substrings	Medium	String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n)	5	100.00
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)	14	87.34
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)	1	87.16
0494	Target Sum	Medium	Array, Dynamic_Programming, Backtracking, Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s))	24	83.43
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)	8	97.80
0437	Path Sum III	Medium	Depth_First_Search, Tree, Binary_Tree, Level_2_Day_7_Tree, Big_O_Time_O(n)_Space_O(n)	3	86.41
0416	Partition Equal Subset Sum	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Level_2_Day_13_Dynamic_Programming, Big_O_Time_O(n*sums)_Space_O(n*sums)	33	93.24
0394	Decode String	Medium	Top_100_Liked_Questions, String, Stack, Recursion, Level_1_Day_14_Stack, Udemy_Strings, Big_O_Time_O(n)_Space_O(n)	0	100.00
0347	Top K Frequent Elements	Medium	Top_100_Liked_Questions, Array, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Divide_and_Conquer, Quickselect, Bucket_Sort, Data_Structure_II_Day_20_Heap_Priority_Queue, Big_O_Time_O(n*log(n))_Space_O(k)	7	87.13
0338	Counting Bits	Easy	Dynamic_Programming, Bit_Manipulation, Udemy_Bit_Manipulation, Big_O_Time_O(num)_Space_O(num)	1	89.22
0322	Coin Change	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Algorithm_II_Day_18_Dynamic_Programming, Dynamic_Programming_I_Day_20, Level_2_Day_12_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(m*n)_Space_O(amount)	27	89.42
0300	Longest Increasing Subsequence	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Algorithm_II_Day_16_Dynamic_Programming, Binary_Search_II_Day_3, Dynamic_Programming_I_Day_18, Udemy_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(n*log_n)_Space_O(n)	6	84.68
0295	Find Median from Data Stream	Hard	Top_100_Liked_Questions, Sorting, Two_Pointers, Design, Heap_Priority_Queue, Data_Stream, Top_Interview_150_Heap, Big_O_Time_O(n*log_n)_Space_O(n)	106	92.31
0287	Find the Duplicate Number	Medium	Top_100_Liked_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Binary_Search_II_Day_5, Big_O_Time_O(n)_Space_O(n)	5	88.65
0283	Move Zeroes	Easy	Top_100_Liked_Questions, Array, Two_Pointers, Algorithm_I_Day_3_Two_Pointers, Programming_Skills_I_Day_6_Array, Udemy_Arrays, Big_O_Time_O(n)_Space_O(1)	1	82.86
0240	Search a 2D Matrix II	Medium	Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Data_Structure_II_Day_4_Array, Binary_Search_II_Day_8, Big_O_Time_O(n+m)_Space_O(1)	42	94.61
0239	Sliding Window Maximum	Hard	Top_100_Liked_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue, Udemy_Arrays, Big_O_Time_O(n*k)_Space_O(n+k)	26	99.07
0238	Product of Array Except Self	Medium	Top_100_Liked_Questions, Array, Prefix_Sum, Data_Structure_II_Day_5_Array, Udemy_Arrays, Top_Interview_150_Array/String, Big_O_Time_O(n^2)_Space_O(n)	3	92.81
0236	Lowest Common Ancestor of a Binary Tree	Medium	Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Data_Structure_II_Day_18_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(n)_Space_O(n)	61	75.97
0234	Palindrome Linked List	Easy	Top_100_Liked_Questions, Two_Pointers, Stack, Linked_List, Recursion, Level_2_Day_3_Linked_List, Udemy_Linked_List, Big_O_Time_O(n)_Space_O(1)	3	92.85
0230	Kth Smallest Element in a BST	Medium	Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_II_Day_17_Tree, Level_2_Day_9_Binary_Search_Tree, Top_Interview_150_Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n)	0	100.00
0226	Invert Binary Tree	Easy	Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_12_Tree, Level_2_Day_6_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(n)_Space_O(n)	0	100.00
0221	Maximal Square	Medium	Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16, Top_Interview_150_Multidimensional_DP, Big_O_Time_O(m*n)_Space_O(m*n)	18	59.02
0215	Kth Largest Element in an Array	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, Data_Structure_II_Day_20_Heap_Priority_Queue, Top_Interview_150_Heap, Big_O_Time_O(n*log(n))_Space_O(log(n))	4	99.64
0208	Implement Trie (Prefix Tree)	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, Level_2_Day_16_Design, Udemy_Trie_and_Heap, Top_Interview_150_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N)	48	63.95
0207	Course Schedule	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort, Top_Interview_150_Graph_General, Big_O_Time_O(N)_Space_O(N)	11	81.08
0206	Reverse Linked List	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Data_Structure_I_Day_8_Linked_List, Algorithm_I_Day_10_Recursion_Backtracking, Level_1_Day_3_Linked_List, Udemy_Linked_List, Big_O_Time_O(N)_Space_O(1)	0	100.00
0200	Number of Islands	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_1_Matrix_Related_Problems, Level_1_Day_9_Graph/BFS/DFS, Udemy_Graph, Top_Interview_150_Graph_General, Big_O_Time_O(M*N)_Space_O(M*N)	57	93.94
0198	House Robber	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_3, Level_2_Day_12_Dynamic_Programming, Udemy_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(n)_Space_O(n)	0	100.00
0189	Rotate Array	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Algorithm_I_Day_2_Two_Pointers, Udemy_Arrays, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1)	1	86.17
0169	Majority Element	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Data_Structure_II_Day_1_Array, Udemy_Famous_Algorithm, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1)	0	100.00
0160	Intersection of Two Linked Lists	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_II_Day_11_Linked_List, Udemy_Linked_List, Big_O_Time_O(M+N)_Space_O(1)	65	72.36
0155	Min Stack	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Data_Structure_II_Day_14_Stack_Queue, Programming_Skills_II_Day_18, Level_2_Day_16_Design, Udemy_Design, Top_Interview_150_Stack, Big_O_Time_O(1)_Space_O(N)	5	99.10
0153	Find Minimum in Rotated Sorted Array	Medium	Top_100_Liked_Questions, Array, Binary_Search, Algorithm_II_Day_2_Binary_Search, Binary_Search_I_Day_12, Udemy_Binary_Search, Top_Interview_150_Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N)	0	100.00
0152	Maximum Product Subarray	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Dynamic_Programming_I_Day_6, Level_2_Day_13_Dynamic_Programming, Udemy_Dynamic_Programming, Big_O_Time_O(N)_Space_O(1)	0	100.00
0148	Sort List	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort, Level_2_Day_4_Linked_List, Top_Interview_150_Divide_and_Conquer, Big_O_Time_O(log(N))_Space_O(log(N))	36	44.94
0146	LRU Cache	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Udemy_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(1)_Space_O(capacity)	97	81.52
0142	Linked List Cycle II	Medium	Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_II_Day_10_Linked_List, Level_1_Day_4_Linked_List, Udemy_Linked_List, Big_O_Time_O(N)_Space_O(1)	51	76.99
0141	Linked List Cycle	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_I_Day_7_Linked_List, Udemy_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(N)_Space_O(1)	47	89.37
0139	Word Break	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Algorithm_II_Day_15_Dynamic_Programming, Dynamic_Programming_I_Day_9, Udemy_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(M+max*N)_Space_O(M+N+max)	4	76.41
0138	Copy List with Random Pointer	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Programming_Skills_II_Day_14, Udemy_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(N)_Space_O(N)	49	72.42
0137	Single Number II	Medium	Array, Bit_Manipulation, Top_Interview_150_Bit_Manipulation	0	100.00
0136	Single Number	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Data_Structure_II_Day_1_Array, Algorithm_I_Day_14_Bit_Manipulation, Udemy_Integers, Top_Interview_150_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1)	1	78.27
0135	Candy	Hard	Array, Greedy, Top_Interview_150_Array/String	2	96.15
0134	Gas Station	Medium	Top_Interview_Questions, Array, Greedy, Top_Interview_150_Array/String	0	100.00
0131	Palindrome Partitioning	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(N*2^N)_Space_O(2^N*N)	13	94.96
0129	Sum Root to Leaf Numbers	Medium	Depth_First_Search, Tree, Binary_Tree, Top_Interview_150_Binary_Tree_General	0	100.00
0128	Longest Consecutive Sequence	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Union_Find, Top_Interview_150_Hashmap, Big_O_Time_O(N_log_N)_Space_O(1)	34	90.07
0127	Word Ladder	Hard	Top_Interview_Questions, String, Hash_Table, Breadth_First_Search, Graph_Theory_I_Day_12_Breadth_First_Search, Top_Interview_150_Graph_BFS	41	95.63
0125	Valid Palindrome	Easy	Top_Interview_Questions, String, Two_Pointers, Udemy_Two_Pointers, Top_Interview_150_Two_Pointers	0	100.00
0124	Binary Tree Maximum Path Sum	Hard	Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(N)	2	71.11
0123	Best Time to Buy and Sell Stock III	Hard	Array, Dynamic_Programming, Top_Interview_150_Multidimensional_DP	5	85.07
0122	Best Time to Buy and Sell Stock II	Medium	Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Dynamic_Programming_I_Day_7, Udemy_Arrays, Top_Interview_150_Array/String	0	100.00
0121	Best Time to Buy and Sell Stock	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Data_Structure_I_Day_3_Array, Dynamic_Programming_I_Day_7, Level_1_Day_5_Greedy, Udemy_Arrays, Top_Interview_150_Array/String, Big_O_Time_O(N)_Space_O(1)	1	96.44
0120	Triangle	Medium	Array, Dynamic_Programming, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_13, Udemy_Dynamic_Programming, Top_Interview_150_Multidimensional_DP	0	100.00
0117	Populating Next Right Pointers in Each Node II	Medium	Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List, Algorithm_II_Day_7_Breadth_First_Search_Depth_First_Search, Top_Interview_150_Binary_Tree_General	47	97.74
0114	Flatten Binary Tree to Linked List	Medium	Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List, Udemy_Linked_List, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(N)	0	100.00
0112	Path Sum	Easy	Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_12_Tree, Top_Interview_150_Binary_Tree_General	0	100.00
0108	Convert Sorted Array to Binary Search Tree	Easy	Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer, Data_Structure_II_Day_15_Tree, Level_2_Day_9_Binary_Search_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Divide_and_Conquer	0	100.00
0106	Construct Binary Tree from Inorder and Postorder Traversal	Medium	Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Top_Interview_150_Binary_Tree_General	1	98.78
0105	Construct Binary Tree from Preorder and Inorder Traversal	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Data_Structure_II_Day_15_Tree, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(N)	2	93.38
0104	Maximum Depth of Binary Tree	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Programming_Skills_I_Day_10_Linked_List_and_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(H)	0	100.00
0103	Binary Tree Zigzag Level Order Traversal	Medium	Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_II_Day_15_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_BFS	0	100.00
0102	Binary Tree Level Order Traversal	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Level_1_Day_6_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_BFS, Big_O_Time_O(N)_Space_O(N)	0	100.00
0101	Symmetric Tree	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Level_2_Day_15_Tree, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(log(N))	0	100.00
0098	Validate Binary Search Tree	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_I_Day_14_Tree, Level_1_Day_8_Binary_Search_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N))	0	100.00
0097	Interleaving String	Medium	String, Dynamic_Programming, Top_Interview_150_Multidimensional_DP	43	97.65
0096	Unique Binary Search Trees	Medium	Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Dynamic_Programming_I_Day_11, Big_O_Time_O(n)_Space_O(1)	0	100.00
0094	Binary Tree Inorder Traversal	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Data_Structure_I_Day_10_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(n)_Space_O(n)	0	100.00
0092	Reverse Linked List II	Medium	Linked_List, Top_Interview_150_Linked_List	0	100.00
0088	Merge Sorted Array	Medium	Two_Pointers, Linked_List, Top_Interview_150_Linked_List	0	100.00
0086	Partition List	Medium	Two_Pointers, Linked_List, Top_Interview_150_Linked_List	0	100.00
0084	Largest Rectangle in Histogram	Hard	Top_100_Liked_Questions, Top_Interview_Questions, Array, Stack, Monotonic_Stack, Big_O_Time_O(n_log_n)_Space_O(log_n)	15	72.81
0082	Remove Duplicates from Sorted List II	Medium	Two_Pointers, Linked_List, Data_Structure_II_Day_11_Linked_List, Algorithm_II_Day_3_Two_Pointers, Top_Interview_150_Linked_List	0	100.00
0080	Remove Duplicates from Sorted Array II	Medium	Array, Two_Pointers, Udemy_Arrays, Top_Interview_150_Array/String	40	99.63
0079	Word Search	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Top_Interview_150_Backtracking, Big_O_Time_O(4^(m*n))_Space_O(m*n)	243	85.30
0078	Subsets	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Algorithm_II_Day_9_Recursion_Backtracking, Udemy_Backtracking/Recursion, Big_O_Time_O(2^n)_Space_O(n*2^n)	0	100.00
0077	Combinations	Medium	Backtracking, Algorithm_I_Day_11_Recursion_Backtracking, Top_Interview_150_Backtracking	46	96.14
0076	Minimum Window Substring	Hard	Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Level_2_Day_14_Sliding_Window/Two_Pointer, Top_Interview_150_Sliding_Window, Big_O_Time_O(s.length())_Space_O(1)	20	90.35
0075	Sort Colors	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Data_Structure_II_Day_2_Array, Udemy_Arrays, Big_O_Time_O(n)_Space_O(1)	0	100.00
0074	Search a 2D Matrix	Medium	Top_100_Liked_Questions, Array, Binary_Search, Matrix, Data_Structure_I_Day_5_Array, Algorithm_II_Day_1_Binary_Search, Binary_Search_I_Day_8, Level_2_Day_8_Binary_Search, Udemy_2D_Arrays/Matrix, Top_Interview_150_Binary_Search, Big_O_Time_O(endRow+endCol)_Space_O(1)	0	100.00
0073	Set Matrix Zeroes	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Matrix, Udemy_2D_Arrays/Matrix, Top_Interview_150_Matrix, Big_O_Time_O(m*n)_Space_O(1)	4	50.63
0072	Edit Distance	Medium	Top_100_Liked_Questions, String, Dynamic_Programming, Algorithm_II_Day_18_Dynamic_Programming, Dynamic_Programming_I_Day_19, Udemy_Dynamic_Programming, Top_Interview_150_Multidimensional_DP, Big_O_Time_O(n^2)_Space_O(n2)	6	93.83
0071	Simplify Path	Medium	String, Stack, Top_Interview_150_Stack	0	100.00
0070	Climbing Stairs	Easy	Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_2, Level_1_Day_10_Dynamic_Programming, Udemy_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(n)_Space_O(n)	0	100.00
0069	Sqrt(x)	Hard	Array, String, Simulation, Top_Interview_150_Array/String	0	100.00
0068	Text Justification	Hard	Array, String, Simulation, Top_Interview_150_Array/String	0	100.00
0067	Add Binary	Easy	String, Math, Bit_Manipulation, Simulation, Programming_Skills_II_Day_5, Top_Interview_150_Bit_Manipulation	0	100.00
0066	Plus One	Easy	Top_Interview_Questions, Array, Math, Programming_Skills_II_Day_3, Udemy_Arrays, Top_Interview_150_Math	0	100.00
0064	Minimum Path Sum	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16, Udemy_Dynamic_Programming, Top_Interview_150_Multidimensional_DP, Big_O_Time_O(m*n)_Space_O(m*n)	4	70.73
0063	Unique Paths II	Medium	Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_15, Top_Interview_150_Multidimensional_DP	0	100.00
0062	Unique Paths	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Algorithm_II_Day_13_Dynamic_Programming, Dynamic_Programming_I_Day_15, Level_1_Day_11_Dynamic_Programming, Big_O_Time_O(m*n)_Space_O(m*n)	0	100.00
0061	Rotate List	Medium	Two_Pointers, Linked_List, Programming_Skills_II_Day_16, Udemy_Linked_List, Top_Interview_150_Linked_List	0	100.00
0058	Length of Last Word	Easy	String, Programming_Skills_II_Day_6, Udemy_Arrays, Top_Interview_150_Array/String	0	100.00
0057	Insert Interval	Medium	Array, Level_2_Day_17_Interval, Top_Interview_150_Intervals	0	100.00
0056	Merge Intervals	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Data_Structure_II_Day_2_Array, Level_2_Day_17_Interval, Udemy_2D_Arrays/Matrix, Top_Interview_150_Intervals, Big_O_Time_O(n_log_n)_Space_O(n)	7	87.99
0055	Jump Game	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Algorithm_II_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_4, Udemy_Arrays, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1)	0	100.00
0054	Spiral Matrix	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Simulation, Programming_Skills_II_Day_8, Level_2_Day_1_Implementation/Simulation, Udemy_2D_Arrays/Matrix, Top_Interview_150_Matrix	0	100.00
0053	Maximum Subarray	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Data_Structure_I_Day_1_Array, Dynamic_Programming_I_Day_5, Udemy_Famous_Algorithm, Top_Interview_150_Kadane's_Algorithm, Big_O_Time_O(n)_Space_O(1)	0	100.00
0052	N-Queens II	Hard	Backtracking, Top_Interview_150_Backtracking	1	96.89
0051	N-Queens	Hard	Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(N!)_Space_O(N)	6	95.85
0050	Pow(x, n)	Medium	Top_Interview_Questions, Math, Recursion, Udemy_Integers, Top_Interview_150_Math	0	100.00
0049	Group Anagrams	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Data_Structure_II_Day_8_String, Programming_Skills_II_Day_11, Udemy_Strings, Top_Interview_150_Hashmap, Big_O_Time_O(n*k_log_k)_Space_O(n)	27	78.99
0048	Rotate Image	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Data_Structure_II_Day_3_Array, Programming_Skills_II_Day_7, Udemy_2D_Arrays/Matrix, Top_Interview_150_Matrix, Big_O_Time_O(n^2)_Space_O(1)	0	100.00
0046	Permutations	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Algorithm_I_Day_11_Recursion_Backtracking, Level_2_Day_20_Brute_Force/Backtracking, Udemy_Backtracking/Recursion, Top_Interview_150_Backtracking, Big_O_Time_O(n*n!)_Space_O(n+n!)	1	84.44
0045	Jump Game II	Medium	Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Algorithm_II_Day_13_Dynamic_Programming, Dynamic_Programming_I_Day_4, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1)	1	84.27
0042	Trapping Rain Water	Hard	Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Dynamic_Programming_I_Day_9, Udemy_Two_Pointers, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1)	0	100.00
0041	First Missing Positive	Hard	Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Udemy_Arrays, Big_O_Time_O(n)_Space_O(n)	1	99.11
0039	Combination Sum	Medium	Top_100_Liked_Questions, Array, Backtracking, Algorithm_II_Day_10_Recursion_Backtracking, Level_2_Day_20_Brute_Force/Backtracking, Udemy_Backtracking/Recursion, Top_Interview_150_Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n)	1	98.17
0036	Valid Sudoku	Medium	Top_Interview_Questions, Array, Hash_Table, Matrix, Data_Structure_I_Day_5_Array, Top_Interview_150_Matrix	1	99.60
0035	Search Insert Position	Easy	Top_100_Liked_Questions, Array, Binary_Search, Algorithm_I_Day_1_Binary_Search, Binary_Search_I_Day_2, Top_Interview_150_Binary_Search, Big_O_Time_O(log_n)_Space_O(1)	0	100.00
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, Top_Interview_150_Binary_Search, Big_O_Time_O(log_n)_Space_O(1)	0	100.00
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, Top_Interview_150_Binary_Search, Big_O_Time_O(log_n)_Space_O(1)	0	100.00
0032	Longest Valid Parentheses	Hard	Top_100_Liked_Questions, String, Dynamic_Programming, Stack, Big_O_Time_O(n)_Space_O(1)	3	71.05
0031	Next Permutation	Medium	Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1)	0	100.00
0030	Substring with Concatenation of All Words	Hard	String, Hash_Table, Sliding_Window, Top_Interview_150_Sliding_Window	13	97.44
0028	Implement strStr()	Easy	Top_Interview_Questions, String, Two_Pointers, String_Matching, Programming_Skills_II_Day_1, Top_Interview_150_Array/String	0	100.00
0027	Remove Element	Easy	Array, Two_Pointers, Top_Interview_150_Array/String	0	100.00
0026	Remove Duplicates from Sorted Array	Easy	Top_Interview_Questions, Array, Two_Pointers, Udemy_Two_Pointers, Top_Interview_150_Array/String	0	100.00
0025	Reverse Nodes in k-Group	Hard	Top_100_Liked_Questions, Linked_List, Recursion, Data_Structure_II_Day_13_Linked_List, Udemy_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(n)_Space_O(k)	0	100.00
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)	0	100.00
0023	Merge k Sorted Lists	Hard	Top_100_Liked_Questions, Top_Interview_Questions, Heap_Priority_Queue, Linked_List, Divide_and_Conquer, Merge_Sort, Top_Interview_150_Divide_and_Conquer, Big_O_Time_O(k*n*log(k))_Space_O(log(k))	4	97.65
0022	Generate Parentheses	Medium	Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Udemy_Backtracking/Recursion, Top_Interview_150_Backtracking, Big_O_Time_O(2^n)_Space_O(n)	1	72.82
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, Top_Interview_150_Linked_List, Big_O_Time_O(m+n)_Space_O(m+n)	1	51.21
0020	Valid Parentheses	Easy	Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Data_Structure_I_Day_9_Stack_Queue, Udemy_Strings, Top_Interview_150_Stack, Big_O_Time_O(n)_Space_O(n)	1	86.85
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, Top_Interview_150_Linked_List, Big_O_Time_O(L)_Space_O(L)	0	100.00
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, Top_Interview_150_Backtracking, Big_O_Time_O(4^n)_Space_O(n)	0	100.00
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, Top_Interview_150_Two_Pointers, Big_O_Time_O(n*log(n))_Space_O(n^2)	30	91.56
0014	Longest Common Prefix	Easy	Top_100_Liked_Questions, Top_Interview_Questions, String, Level_2_Day_2_String, Udemy_Strings, Top_Interview_150_Array/String	0	100.00
0013	Roman to Integer	Easy	Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Math, Top_Interview_150_Array/String	3	94.58
0012	Integer to Roman	Medium	String, Hash_Table, Math, Top_Interview_150_Array/String	3	93.02
0011	Container With Most Water	Medium	Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Algorithm_II_Day_4_Two_Pointers, Top_Interview_150_Two_Pointers, Big_O_Time_O(n)_Space_O(1)	2	80.13
0010	Regular Expression Matching	Hard	Top_Interview_Questions, String, Dynamic_Programming, Recursion, Udemy_Dynamic_Programming, Big_O_Time_O(m*n)_Space_O(m*n)	5	90.44
0009	Palindrome Number	Easy	Math, Udemy_Integers, Top_Interview_150_Math	3	99.14
0008	String to Integer (atoi)	Medium	Top_Interview_Questions, String	1	90.14
0007	Reverse Integer	Medium	Top_Interview_Questions, Math, Udemy_Integers	53	83.14
0006	Zigzag Conversion	Medium	String, Top_Interview_150_Array/String	2	99.08
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, Top_Interview_150_Multidimensional_DP, Big_O_Time_O(n)_Space_O(n)	8	99.14
0004	Median of Two Sorted Arrays	Hard	Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Divide_and_Conquer, Top_Interview_150_Binary_Search, Big_O_Time_O(log(min(N,M)))_Space_O(1), AI_can_be_used_to_solve_the_task	3	82.74
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, Top_Interview_150_Sliding_Window, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task	3	96.91
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, Top_Interview_150_Linked_List, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task	2	95.82
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, Top_Interview_150_Hashmap, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task	1	89.70