leetcode_training

Collection of leetcode problems solved and noted by me (list of problems not full)

Statistics by months and years:

List of problems(542):

N	Title	Difficulty	Link	Code
2	Add Two Numbers	$\color{orange}{\textsf{Medium}}$	Link	Code
5	Longest Palindromic Substring	$\color{orange}{\textsf{Medium}}$	Link	Code
12	Integer to Roman	$\color{orange}{\textsf{Medium}}$	Link	Code
16	3Sum Closest	$\color{orange}{\textsf{Medium}}$	Link	Code
17	Letter Combinations of a Phone Number	$\color{orange}{\textsf{Medium}}$	Link	Code
18	4Sum	$\color{orange}{\textsf{Medium}}$	Link	Code
22	Generate Parentheses	$\color{orange}{\textsf{Medium}}$	Link	Code
23	Merge k Sorted Lists	$\color{red}{\textsf{Hard}}$	Link	Code
24	Swap Nodes in Pairs	$\color{orange}{\textsf{Medium}}$	Link	Code
25	Reverse Nodes in k-Group	$\color{red}{\textsf{Hard}}$	Link	Code
30	Substring with Concatenation of All Words	$\color{red}{\textsf{Hard}}$	Link	Code
31	Next Permutation	$\color{orange}{\textsf{Medium}}$	Link	Code
32	Longest Valid Parentheses	$\color{red}{\textsf{Hard}}$	Link	Code
37	Sudoku Solver	$\color{red}{\textsf{Hard}}$	Link	Code
39	Combination Sum	$\color{orange}{\textsf{Medium}}$	Link	Code
40	Combination Sum II	$\color{orange}{\textsf{Medium}}$	Link	Code
42	Trapping Rain Water	$\color{red}{\textsf{Hard}}$	Link	Code
45	Jump Game II	$\color{orange}{\textsf{Medium}}$	Link	Code
46	Permutations	$\color{orange}{\textsf{Medium}}$	Link	Code
47	Permutations II	$\color{orange}{\textsf{Medium}}$	Link	Code
48	Rotate Image	$\color{orange}{\textsf{Medium}}$	Link	Code
51	N-Queens	$\color{red}{\textsf{Hard}}$	Link	Code
52	N-Queens II	$\color{red}{\textsf{Hard}}$	Link	Code
54	Spiral Matrix	$\color{orange}{\textsf{Medium}}$	Link	Code
59	Spiral Matrix II	$\color{orange}{\textsf{Medium}}$	Link	Code
61	Rotate List	$\color{orange}{\textsf{Medium}}$	Link	Code
62	Unique Paths	$\color{orange}{\textsf{Medium}}$	Link	Code
63	Unique Paths II	$\color{orange}{\textsf{Medium}}$	Link	Code
64	Minimum Path Sum	$\color{orange}{\textsf{Medium}}$	Link	Code
68	Text Justification	$\color{red}{\textsf{Hard}}$	Link	Code
71	Simplify Path	$\color{orange}{\textsf{Medium}}$	Link	Code
72	Edit Distance	$\color{orange}{\textsf{Medium}}$	Link	Code
76	Minimum Window Substring	$\color{red}{\textsf{Hard}}$	Link	Code
77	Combinations	$\color{orange}{\textsf{Medium}}$	Link	Code
79	Word Search	$\color{orange}{\textsf{Medium}}$	Link	Code
81	Search in Rotated Sorted Array II	$\color{orange}{\textsf{Medium}}$	Link	Code
82	Remove Duplicates from Sorted List II	$\color{orange}{\textsf{Medium}}$	Link	Code
84	Largest Rectangle in Histogram	$\color{red}{\textsf{Hard}}$	Link	Code
92	Reverse Linked List II	$\color{orange}{\textsf{Medium}}$	Link	Code
93	Restore IP Addresses	$\color{orange}{\textsf{Medium}}$	Link	Code
97	Interleaving String	$\color{orange}{\textsf{Medium}}$	Link	Code
98	Validate Binary Search Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
102	Binary Tree Level Order Traversal	$\color{orange}{\textsf{Medium}}$	Link	Code
103	Binary Tree Zigzag Level Order Traversal	$\color{orange}{\textsf{Medium}}$	Link	Code
105	Construct Binary Tree from Preorder and Inorder Traversal	$\color{orange}{\textsf{Medium}}$	Link	Code
106	Construct Binary Tree from Inorder and Postorder Traversal	$\color{orange}{\textsf{Medium}}$	Link	Code
107	Binary Tree Level Order Traversal II	$\color{orange}{\textsf{Medium}}$	Link	Code
108	Convert Sorted Array to Binary Search Tree	$\color{green}{\textsf{Easy}}$	Link	Code
109	Convert Sorted List to Binary Search Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
110	Balanced Binary Tree	$\color{green}{\textsf{Easy}}$	Link	Code
112	Path Sum	$\color{green}{\textsf{Easy}}$	Link	Code
113	Path Sum II	$\color{orange}{\textsf{Medium}}$	Link	Code
114	Flatten Binary Tree to Linked List	$\color{orange}{\textsf{Medium}}$	Link	Code
116	Populating Next Right Pointers in Each Node	$\color{orange}{\textsf{Medium}}$	Link	Code
117	Populating Next Right Pointers in Each Node II	$\color{orange}{\textsf{Medium}}$	Link	Code
124	Binary Tree Maximum Path Sum	$\color{red}{\textsf{Hard}}$	Link	Code
127	Word Ladder	$\color{red}{\textsf{Hard}}$	Link	Code
129	Sum Root to Leaf Numbers	$\color{orange}{\textsf{Medium}}$	Link	Code
130	Surrounded Regions	$\color{orange}{\textsf{Medium}}$	Link	Code
131	Palindrome Partitioning	$\color{orange}{\textsf{Medium}}$	Link	Code
133	Clone Graph	$\color{orange}{\textsf{Medium}}$	Link	Code
134	Gas Station	$\color{orange}{\textsf{Medium}}$	Link	Code
135	Candy	$\color{red}{\textsf{Hard}}$	Link	Code
138	Copy List with Random Pointer	$\color{orange}{\textsf{Medium}}$	Link	Code
139	Word Break	$\color{orange}{\textsf{Medium}}$	Link	Code
140	Word Break II	$\color{red}{\textsf{Hard}}$	Link	Code
141	Linked List Cycle	$\color{green}{\textsf{Easy}}$	Link	Code
142	Linked List Cycle II	$\color{orange}{\textsf{Medium}}$	Link	Code
143	Reorder List	$\color{orange}{\textsf{Medium}}$	Link	Code
146	LRU Cache	$\color{orange}{\textsf{Medium}}$	Link	Code
148	Sort List	$\color{orange}{\textsf{Medium}}$	Link	Code
150	Evaluate Reverse Polish Notation	$\color{orange}{\textsf{Medium}}$	Link	Code
154	Find Minimum in Rotated Sorted Array II	$\color{red}{\textsf{Hard}}$	Link	Code
159	Longest Substring with At Most Two Distinct Characters	$\color{orange}{\textsf{Medium}}$	Link	Code
160	Intersection of Two Linked Lists	$\color{green}{\textsf{Easy}}$	Link	Code
161	One Edit Distance	$\color{orange}{\textsf{Medium}}$	Link	Code
164	Maximum Gap	$\color{orange}{\textsf{Medium}}$	Link	Code
170	Two Sum III - Data structure design	$\color{green}{\textsf{Easy}}$	Link	Code
172	Factorial Trailing Zeroes	$\color{orange}{\textsf{Medium}}$	Link	Code
173	Binary Search Tree Iterator	$\color{orange}{\textsf{Medium}}$	Link	Code
175	Combine Two Tables	$\color{green}{\textsf{Easy}}$	Link	Code
176	Second Highest Salary	$\color{orange}{\textsf{Medium}}$	Link	Code
178	Rank Scores	$\color{orange}{\textsf{Medium}}$	Link	Code
179	Largest Number	$\color{orange}{\textsf{Medium}}$	Link	Code
186	Reverse Words in a String II	$\color{orange}{\textsf{Medium}}$	Link	Code
187	Repeated DNA Sequences	$\color{orange}{\textsf{Medium}}$	Link	Code
188	Best Time to Buy and Sell Stock IV	$\color{red}{\textsf{Hard}}$	Link	Code
204	Count Primes	$\color{orange}{\textsf{Medium}}$	Link	Code
207	Course Schedule	$\color{orange}{\textsf{Medium}}$	Link	Code
208	Implement Trie (Prefix Tree)	$\color{orange}{\textsf{Medium}}$	Link	Code
210	Course Schedule II	$\color{orange}{\textsf{Medium}}$	Link	Code
211	Design Add and Search Words Data Structure	$\color{orange}{\textsf{Medium}}$	Link	Code
212	Word Search II	$\color{red}{\textsf{Hard}}$	Link	Code
216	Combination Sum III	$\color{orange}{\textsf{Medium}}$	Link	Code
224	Basic Calculator	$\color{red}{\textsf{Hard}}$	Link	Code
227	Basic Calculator II	$\color{orange}{\textsf{Medium}}$	Link	Code
228	Summary Ranges	$\color{green}{\textsf{Easy}}$	Link	Code
229	Majority Element II	$\color{orange}{\textsf{Medium}}$	Link	Code
230	Kth Smallest Element in a BST	$\color{orange}{\textsf{Medium}}$	Link	Code
235	Lowest Common Ancestor of a Binary Search Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
236	Lowest Common Ancestor of a Binary Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
237	Delete Node in a Linked List	$\color{orange}{\textsf{Medium}}$	Link	Code
239	Sliding Window Maximum	$\color{red}{\textsf{Hard}}$	Link	Code
240	Search a 2D Matrix II	$\color{orange}{\textsf{Medium}}$	Link	Code
246	Strobogrammatic Number	$\color{green}{\textsf{Easy}}$	Link	Code
247	Strobogrammatic Number II	$\color{orange}{\textsf{Medium}}$	Link	Code
250	Count Univalue Subtrees	$\color{orange}{\textsf{Medium}}$	Link	Code
252	Meeting Rooms	$\color{green}{\textsf{Easy}}$	Link	Code
253	Meeting Rooms II	$\color{orange}{\textsf{Medium}}$	Link	Code
254	Factor Combinations	$\color{orange}{\textsf{Medium}}$	Link	Code
256	Paint House	$\color{orange}{\textsf{Medium}}$	Link	Code
257	Binary Tree Paths	$\color{green}{\textsf{Easy}}$	Link	Code
259	3Sum Smaller	$\color{orange}{\textsf{Medium}}$	Link	Code
261	Graph Valid Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
267	Palindrome Permutation II	$\color{orange}{\textsf{Medium}}$	Link	Code
270	Closest Binary Search Tree Value	$\color{green}{\textsf{Easy}}$	Link	Code
271	Encode and Decode Strings	$\color{orange}{\textsf{Medium}}$	Link	Code
272	Closest Binary Search Tree Value II	$\color{red}{\textsf{Hard}}$	Link	Code
274	H-Index	$\color{orange}{\textsf{Medium}}$	Link	Code
282	Expression Add Operators	$\color{red}{\textsf{Hard}}$	Link	Code
284	Peeking Iterator	$\color{orange}{\textsf{Medium}}$	Link	Code
286	Walls and Gates	$\color{orange}{\textsf{Medium}}$	Link	Code
289	Game of Life	$\color{orange}{\textsf{Medium}}$	Link	Code
290	Word Pattern	$\color{green}{\textsf{Easy}}$	Link	Code
295	Find Median from Data Stream	$\color{red}{\textsf{Hard}}$	Link	Code
297	Serialize and Deserialize Binary Tree	$\color{red}{\textsf{Hard}}$	Link	Code
300	Longest Increasing Subsequence	$\color{orange}{\textsf{Medium}}$	Link	Code
302	Smallest Rectangle Enclosing Black Pixels	$\color{red}{\textsf{Hard}}$	Link	Code
307	Range Sum Query - Mutable	$\color{orange}{\textsf{Medium}}$	Link	Code
308	Range Sum Query 2D - Mutable	$\color{red}{\textsf{Hard}}$	Link	Code
314	Binary Tree Vertical Order Traversal	$\color{orange}{\textsf{Medium}}$	Link	Code
316	Remove Duplicate Letters	$\color{orange}{\textsf{Medium}}$	Link	Code
322	Coin Change	$\color{orange}{\textsf{Medium}}$	Link	Code
323	Number of Connected Components in an Undirected Graph	$\color{orange}{\textsf{Medium}}$	Link	Code
329	Longest Increasing Path in a Matrix	$\color{red}{\textsf{Hard}}$	Link	Code
340	Longest Substring with At Most K Distinct Characters	$\color{orange}{\textsf{Medium}}$	Link	Code
346	Moving Average from Data Stream	$\color{green}{\textsf{Easy}}$	Link	Code
355	Design Twitter	$\color{orange}{\textsf{Medium}}$	Link	Code
359	Logger Rate Limiter	$\color{green}{\textsf{Easy}}$	Link	Code
366	Find Leaves of Binary Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
368	Largest Divisible Subset	$\color{orange}{\textsf{Medium}}$	Link	Code
369	Plus One Linked List	$\color{orange}{\textsf{Medium}}$	Link	Code
373	Find K Pairs with Smallest Sums	$\color{orange}{\textsf{Medium}}$	Link	Code
377	Combination Sum IV	$\color{orange}{\textsf{Medium}}$	Link	Code
378	Kth Smallest Element in a Sorted Matrix	$\color{orange}{\textsf{Medium}}$	Link	Code
380	Insert Delete GetRandom O(1)	$\color{orange}{\textsf{Medium}}$	Link	Code
384	Shuffle an Array	$\color{orange}{\textsf{Medium}}$	Link	Code
386	Lexicographical Numbers	$\color{orange}{\textsf{Medium}}$	Link	Code
390	Elimination Game	$\color{orange}{\textsf{Medium}}$	Link	Code
397	Integer Replacement	$\color{orange}{\textsf{Medium}}$	Link	Code
398	Random Pick Index	$\color{orange}{\textsf{Medium}}$	Link	Code
399	Evaluate Division	$\color{orange}{\textsf{Medium}}$	Link	Code
404	Sum of Left Leaves	$\color{green}{\textsf{Easy}}$	Link	Code
409	Longest Palindrome	$\color{green}{\textsf{Easy}}$	Link	Code
413	Arithmetic Slices	$\color{orange}{\textsf{Medium}}$	Link	Code
416	Partition Equal Subset Sum	$\color{orange}{\textsf{Medium}}$	Link	Code
422	Valid Word Square	$\color{green}{\textsf{Easy}}$	Link	Code
424	Longest Repeating Character Replacement	$\color{orange}{\textsf{Medium}}$	Link	Code
431	Encode N-ary Tree to Binary Tree	$\color{red}{\textsf{Hard}}$	Link	Code
433	Minimum Genetic Mutation	$\color{orange}{\textsf{Medium}}$	Link	Code
436	Find Right Interval	$\color{orange}{\textsf{Medium}}$	Link	Code
437	Path Sum III	$\color{orange}{\textsf{Medium}}$	Link	Code
441	Arranging Coins	$\color{green}{\textsf{Easy}}$	Link	Code
445	Add Two Numbers II	$\color{orange}{\textsf{Medium}}$	Link	Code
446	Arithmetic Slices II - Subsequence	$\color{red}{\textsf{Hard}}$	Link	Code
452	Minimum Number of Arrows to Burst Balloons	$\color{orange}{\textsf{Medium}}$	Link	Code
455	Assign Cookies	$\color{green}{\textsf{Easy}}$	Link	Code
460	LFU Cache	$\color{red}{\textsf{Hard}}$	Link	Code
487	Max Consecutive Ones II	$\color{orange}{\textsf{Medium}}$	Link	Code
491	Non-decreasing Subsequences	$\color{orange}{\textsf{Medium}}$	Link	Code
494	Target Sum	$\color{orange}{\textsf{Medium}}$	Link	Code
496	Next Greater Element I	$\color{green}{\textsf{Easy}}$	Link	Code
502	IPO	$\color{red}{\textsf{Hard}}$	Link	Code
503	Next Greater Element II	$\color{orange}{\textsf{Medium}}$	Link	Code
506	Relative Ranks	$\color{green}{\textsf{Easy}}$	Link	Code
513	Find Bottom Left Tree Value	$\color{orange}{\textsf{Medium}}$	Link	Code
518	Coin Change II	$\color{orange}{\textsf{Medium}}$	Link	Code
520	Detect Capital	$\color{green}{\textsf{Easy}}$	Link	Code
525	Contiguous Array	$\color{orange}{\textsf{Medium}}$	Link	Code
526	Beautiful Arrangement	$\color{orange}{\textsf{Medium}}$	Link	Code
532	K-diff Pairs in an Array	$\color{orange}{\textsf{Medium}}$	Link	Code
538	Convert BST to Greater Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
539	Minimum Time Difference	$\color{orange}{\textsf{Medium}}$	Link	Code
543	Diameter of Binary Tree	$\color{green}{\textsf{Easy}}$	Link	Code
547	Number of Provinces	$\color{orange}{\textsf{Medium}}$	Link	Code
551	Student Attendance Record I	$\color{green}{\textsf{Easy}}$	Link	Code
559	Maximum Depth of N-ary Tree	$\color{green}{\textsf{Easy}}$	Link	Code
560	Subarray Sum Equals K	$\color{orange}{\textsf{Medium}}$	Link	Code
563	Binary Tree Tilt	$\color{green}{\textsf{Easy}}$	Link	Code
572	Subtree of Another Tree	$\color{green}{\textsf{Easy}}$	Link	Code
575	Distribute Candies	$\color{green}{\textsf{Easy}}$	Link	Code
576	Out of Boundary Paths	$\color{orange}{\textsf{Medium}}$	Link	Code
582	Kill Process	$\color{orange}{\textsf{Medium}}$	Link	Code
588	Design In-Memory File System	$\color{red}{\textsf{Hard}}$	Link	Code
589	N-ary Tree Preorder Traversal	$\color{green}{\textsf{Easy}}$	Link	Code
590	N-ary Tree Postorder Traversal	$\color{green}{\textsf{Easy}}$	Link	Code
606	Construct String from Binary Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
621	Task Scheduler	$\color{orange}{\textsf{Medium}}$	Link	Code
622	Design Circular Queue	$\color{orange}{\textsf{Medium}}$	Link	Code
623	Add One Row to Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
630	Course Schedule III	$\color{red}{\textsf{Hard}}$	Link	Code
636	Exclusive Time of Functions	$\color{orange}{\textsf{Medium}}$	Link	Code
641	Design Circular Deque	$\color{orange}{\textsf{Medium}}$	Link	Code
646	Maximum Length of Pair Chain	$\color{orange}{\textsf{Medium}}$	Link	Code
648	Replace Words	$\color{orange}{\textsf{Medium}}$	Link	Code
650	2 Keys Keyboard	$\color{orange}{\textsf{Medium}}$	Link	Code
654	Maximum Binary Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
655	Print Binary Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
658	Find K Closest Elements	$\color{orange}{\textsf{Medium}}$	Link	Code
665	Non-decreasing Array	$\color{orange}{\textsf{Medium}}$	Link	Code
671	Second Minimum Node In a Binary Tree	$\color{green}{\textsf{Easy}}$	Link	Code
676	Implement Magic Dictionary	$\color{orange}{\textsf{Medium}}$	Link	Code
677	Map Sum Pairs	$\color{orange}{\textsf{Medium}}$	Link	Code
678	Valid Parenthesis String	$\color{orange}{\textsf{Medium}}$	Link	Code
680	Valid Palindrome II	$\color{green}{\textsf{Easy}}$	Link	Code
684	Redundant Connection	$\color{orange}{\textsf{Medium}}$	Link	Code
687	Longest Univalue Path	$\color{orange}{\textsf{Medium}}$	Link	Code
690	Employee Importance	$\color{orange}{\textsf{Medium}}$	Link	Code
692	Top K Frequent Words	$\color{orange}{\textsf{Medium}}$	Link	Code
701	Insert into a Binary Search Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
702	Search in a Sorted Array of Unknown Size	$\color{orange}{\textsf{Medium}}$	Link	Code
703	Kth Largest Element in a Stream	$\color{green}{\textsf{Easy}}$	Link	Code
707	Design Linked List	$\color{orange}{\textsf{Medium}}$	Link	Code
708	Insert into a Sorted Circular Linked List	$\color{orange}{\textsf{Medium}}$	Link	Code
713	Subarray Product Less Than K	$\color{orange}{\textsf{Medium}}$	Link	Code
721	Accounts Merge	$\color{orange}{\textsf{Medium}}$	Link	Code
725	Split Linked List in Parts	$\color{orange}{\textsf{Medium}}$	Link	Code
728	Self Dividing Numbers	$\color{green}{\textsf{Easy}}$	Link	Code
729	My Calendar I	$\color{orange}{\textsf{Medium}}$	Link	Code
739	Daily Temperatures	$\color{orange}{\textsf{Medium}}$	Link	Code
740	Delete and Earn	$\color{orange}{\textsf{Medium}}$	Link	Code
741	Cherry Pickup	$\color{red}{\textsf{Hard}}$	Link	Code
742	Closest Leaf in a Binary Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
743	Network Delay Time	$\color{orange}{\textsf{Medium}}$	Link	Code
745	Prefix and Suffix Search	$\color{red}{\textsf{Hard}}$	Link	Code
749	Contain Virus	$\color{red}{\textsf{Hard}}$	Link	Code
759	Employee Free Time	$\color{red}{\textsf{Hard}}$	Link	Code
763	Partition Labels	$\color{orange}{\textsf{Medium}}$	Link	Code
767	Reorganize String	$\color{orange}{\textsf{Medium}}$	Link	Code
773	Sliding Puzzle	$\color{red}{\textsf{Hard}}$	Link	Code
784	Letter Case Permutation	$\color{orange}{\textsf{Medium}}$	Link	Code
785	Is Graph Bipartite?	$\color{orange}{\textsf{Medium}}$	Link	Code
786	K-th Smallest Prime Fraction	$\color{orange}{\textsf{Medium}}$	Link	Code
787	Cheapest Flights Within K Stops	$\color{orange}{\textsf{Medium}}$	Link	Code
790	Domino and Tromino Tiling	$\color{orange}{\textsf{Medium}}$	Link	Code
792	Number of Matching Subsequences	$\color{orange}{\textsf{Medium}}$	Link	Code
797	All Paths From Source to Target	$\color{orange}{\textsf{Medium}}$	Link	Code
802	Find Eventual Safe States	$\color{orange}{\textsf{Medium}}$	Link	Code
814	Binary Tree Pruning	$\color{orange}{\textsf{Medium}}$	Link	Code
815	Bus Routes	$\color{red}{\textsf{Hard}}$	Link	Code
817	Linked List Components	$\color{orange}{\textsf{Medium}}$	Link	Code
818	Race Car	$\color{red}{\textsf{Hard}}$	Link	Code
819	Most Common Word	$\color{green}{\textsf{Easy}}$	Link	Code
821	Shortest Distance to a Character	$\color{green}{\textsf{Easy}}$	Link	Code
826	Most Profit Assigning Work	$\color{orange}{\textsf{Medium}}$	Link	Code
834	Sum of Distances in Tree	$\color{red}{\textsf{Hard}}$	Link	Code
840	Magic Squares In Grid	$\color{orange}{\textsf{Medium}}$	Link	Code
846	Hand of Straights	$\color{orange}{\textsf{Medium}}$	Link	Code
848	Shifting Letters	$\color{orange}{\textsf{Medium}}$	Link	Code
849	Maximize Distance to Closest Person	$\color{orange}{\textsf{Medium}}$	Link	Code
853	Car Fleet	$\color{orange}{\textsf{Medium}}$	Link	Code
860	Lemonade Change	$\color{green}{\textsf{Easy}}$	Link	Code
863	All Nodes Distance K in Binary Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
865	Smallest Subtree with all the Deepest Nodes	$\color{orange}{\textsf{Medium}}$	Link	Code
867	Transpose Matrix	$\color{green}{\textsf{Easy}}$	Link	Code
874	Walking Robot Simulation	$\color{orange}{\textsf{Medium}}$	Link	Code
875	Koko Eating Bananas	$\color{orange}{\textsf{Medium}}$	Link	Code
881	Boats to Save People	$\color{orange}{\textsf{Medium}}$	Link	Code
884	Uncommon Words from Two Sentences	$\color{green}{\textsf{Easy}}$	Link	Code
897	Increasing Order Search Tree	$\color{green}{\textsf{Easy}}$	Link	Code
900	RLE Iterator	$\color{orange}{\textsf{Medium}}$	Link	Code
905	Sort Array By Parity	$\color{green}{\textsf{Easy}}$	Link	Code
909	Snakes and Ladders	$\color{orange}{\textsf{Medium}}$	Link	Code
921	Minimum Add to Make Parentheses Valid	$\color{orange}{\textsf{Medium}}$	Link	Code
930	Binary Subarrays With Sum	$\color{orange}{\textsf{Medium}}$	Link	Code
931	Minimum Falling Path Sum	$\color{orange}{\textsf{Medium}}$	Link	Code
935	Knight Dialer	$\color{orange}{\textsf{Medium}}$	Link	Code
938	Range Sum of BST	$\color{green}{\textsf{Easy}}$	Link	Code
941	Valid Mountain Array	$\color{green}{\textsf{Easy}}$	Link	Code
945	Minimum Increment to Make Array Unique	$\color{orange}{\textsf{Medium}}$	Link	Code
946	Validate Stack Sequences	$\color{orange}{\textsf{Medium}}$	Link	Code
948	Bag of Tokens	$\color{orange}{\textsf{Medium}}$	Link	Code
958	Check Completeness of a Binary Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
965	Univalued Binary Tree	$\color{green}{\textsf{Easy}}$	Link	Code
967	Numbers With Same Consecutive Differences	$\color{orange}{\textsf{Medium}}$	Link	Code
973	K Closest Points to Origin	$\color{orange}{\textsf{Medium}}$	Link	Code
974	Subarray Sums Divisible by K	$\color{orange}{\textsf{Medium}}$	Link	Code
980	Unique Paths III	$\color{red}{\textsf{Hard}}$	Link	Code
981	Time Based Key-Value Store	$\color{orange}{\textsf{Medium}}$	Link	Code
983	Minimum Cost For Tickets	$\color{orange}{\textsf{Medium}}$	Link	Code
987	Vertical Order Traversal of a Binary Tree	$\color{red}{\textsf{Hard}}$	Link	Code
988	Smallest String Starting From Leaf	$\color{orange}{\textsf{Medium}}$	Link	Code
993	Cousins in Binary Tree	$\color{green}{\textsf{Easy}}$	Link	Code
1002	Find Common Characters	$\color{green}{\textsf{Easy}}$	Link	Code
1008	Construct Binary Search Tree from Preorder Traversal	$\color{orange}{\textsf{Medium}}$	Link	Code
1010	Pairs of Songs With Total Durations Divisible by 60	$\color{orange}{\textsf{Medium}}$	Link	Code
1011	Capacity To Ship Packages Within D Days	$\color{orange}{\textsf{Medium}}$	Link	Code
1020	Number of Enclaves	$\color{orange}{\textsf{Medium}}$	Link	Code
1038	Binary Search Tree to Greater Sum Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
1042	Flower Planting With No Adjacent	$\color{orange}{\textsf{Medium}}$	Link	Code
1046	Last Stone Weight	$\color{green}{\textsf{Easy}}$	Link	Code
1054	Distant Barcodes	$\color{orange}{\textsf{Medium}}$	Link	Code
1062	Longest Repeating Substring	$\color{orange}{\textsf{Medium}}$	Link	Code
1079	Letter Tile Possibilities	$\color{orange}{\textsf{Medium}}$	Link	Code
1080	Insufficient Nodes in Root to Leaf Paths	$\color{orange}{\textsf{Medium}}$	Link	Code
1081	Smallest Subsequence of Distinct Characters	$\color{orange}{\textsf{Medium}}$	Link	Code
1091	Shortest Path in Binary Matrix	$\color{orange}{\textsf{Medium}}$	Link	Code
1095	Find in Mountain Array	$\color{red}{\textsf{Hard}}$	Link	Code
1100	Find K-Length Substrings With No Repeated Characters	$\color{orange}{\textsf{Medium}}$	Link	Code
1101	The Earliest Moment When Everyone Become Friends	$\color{orange}{\textsf{Medium}}$	Link	Code
1110	Delete Nodes And Return Forest	$\color{orange}{\textsf{Medium}}$	Link	Code
1123	Lowest Common Ancestor of Deepest Leaves	$\color{orange}{\textsf{Medium}}$	Link	Code
1128	Number of Equivalent Domino Pairs	$\color{green}{\textsf{Easy}}$	Link	Code
1135	Connecting Cities With Minimum Cost	$\color{orange}{\textsf{Medium}}$	Link	Code
1136	Parallel Courses	$\color{orange}{\textsf{Medium}}$	Link	Code
1146	Snapshot Array	$\color{orange}{\textsf{Medium}}$	Link	Code
1155	Number of Dice Rolls With Target Sum	$\color{orange}{\textsf{Medium}}$	Link	Code
1162	As Far from Land as Possible	$\color{orange}{\textsf{Medium}}$	Link	Code
1167	Minimum Cost to Connect Sticks	$\color{orange}{\textsf{Medium}}$	Link	Code
1171	Remove Zero Sum Consecutive Nodes from Linked List	$\color{orange}{\textsf{Medium}}$	Link	Code
1190	Reverse Substrings Between Each Pair of Parentheses	$\color{orange}{\textsf{Medium}}$	Link	Code
1197	Minimum Knight Moves	$\color{orange}{\textsf{Medium}}$	Link	Code
1198	Find Smallest Common Element in All Rows	$\color{orange}{\textsf{Medium}}$	Link	Code
1200	Minimum Absolute Difference	$\color{green}{\textsf{Easy}}$	Link	Code
1213	Intersection of Three Sorted Arrays	$\color{green}{\textsf{Easy}}$	Link	Code
1214	Two Sum BSTs	$\color{orange}{\textsf{Medium}}$	Link	Code
1219	Path with Maximum Gold	$\color{orange}{\textsf{Medium}}$	Link	Code
1221	Split a String in Balanced Strings	$\color{green}{\textsf{Easy}}$	Link	Code
1222	Queens That Can Attack the King	$\color{orange}{\textsf{Medium}}$	Link	Code
1233	Remove Sub-Folders from the Filesystem	$\color{orange}{\textsf{Medium}}$	Link	Code
1235	Maximum Profit in Job Scheduling	$\color{red}{\textsf{Hard}}$	Link	Code
1239	Maximum Length of a Concatenated String with Unique Characters	$\color{orange}{\textsf{Medium}}$	Link	Code
1248	Count Number of Nice Subarrays	$\color{orange}{\textsf{Medium}}$	Link	Code
1254	Number of Closed Islands	$\color{orange}{\textsf{Medium}}$	Link	Code
1255	Maximum Score Words Formed by Letters	$\color{red}{\textsf{Hard}}$	Link	Code
1258	Synonymous Sentences	$\color{orange}{\textsf{Medium}}$	Link	Code
1265	Print Immutable Linked List in Reverse	$\color{orange}{\textsf{Medium}}$	Link	Code
1267	Count Servers that Communicate	$\color{orange}{\textsf{Medium}}$	Link	Code
1277	Count Square Submatrices with All Ones	$\color{orange}{\textsf{Medium}}$	Link	Code
1283	Find the Smallest Divisor Given a Threshold	$\color{orange}{\textsf{Medium}}$	Link	Code
1284	Minimum Number of Flips to Convert Binary Matrix to Zero Matrix	$\color{red}{\textsf{Hard}}$	Link	Code
1286	Iterator for Combination	$\color{orange}{\textsf{Medium}}$	Link	Code
1289	Minimum Falling Path Sum II	$\color{red}{\textsf{Hard}}$	Link	Code
1290	Convert Binary Number in a Linked List to Integer	$\color{green}{\textsf{Easy}}$	Link	Code
1291	Sequential Digits	$\color{orange}{\textsf{Medium}}$	Link	Code
1293	Shortest Path in a Grid with Obstacles Elimination	$\color{red}{\textsf{Hard}}$	Link	Code
1296	Divide Array in Sets of K Consecutive Numbers	$\color{orange}{\textsf{Medium}}$	Link	Code
1302	Deepest Leaves Sum	$\color{orange}{\textsf{Medium}}$	Link	Code
1305	All Elements in Two Binary Search Trees	$\color{orange}{\textsf{Medium}}$	Link	Code
1306	Jump Game III	$\color{orange}{\textsf{Medium}}$	Link	Code
1314	Matrix Block Sum	$\color{orange}{\textsf{Medium}}$	Link	Code
1315	Sum of Nodes with Even-Valued Grandparent	$\color{orange}{\textsf{Medium}}$	Link	Code
1324	Print Words Vertically	$\color{orange}{\textsf{Medium}}$	Link	Code
1325	Delete Leaves With a Given Value	$\color{orange}{\textsf{Medium}}$	Link	Code
1333	Filter Restaurants by Vegan-Friendly, Price and Distance	$\color{orange}{\textsf{Medium}}$	Link	Code
1337	The K Weakest Rows in a Matrix	$\color{green}{\textsf{Easy}}$	Link	Code
1338	Reduce Array Size to The Half	$\color{orange}{\textsf{Medium}}$	Link	Code
1343	Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold	$\color{orange}{\textsf{Medium}}$	Link	Code
1345	Jump Game IV	$\color{red}{\textsf{Hard}}$	Link	Code
1361	Validate Binary Tree Nodes	$\color{orange}{\textsf{Medium}}$	Link	Code
1367	Linked List in Binary Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
1372	Longest ZigZag Path in a Binary Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
1380	Lucky Numbers in a Matrix	$\color{green}{\textsf{Easy}}$	Link	Code
1387	Sort Integers by The Power Value	$\color{orange}{\textsf{Medium}}$	Link	Code
1395	Count Number of Teams	$\color{orange}{\textsf{Medium}}$	Link	Code
1402	Reducing Dishes	$\color{red}{\textsf{Hard}}$	Link	Code
1405	Longest Happy String	$\color{orange}{\textsf{Medium}}$	Link	Code
1414	Find the Minimum Number of Fibonacci Numbers Whose Sum Is K	$\color{orange}{\textsf{Medium}}$	Link	Code
1415	The k-th Lexicographical String of All Happy Strings of Length n	$\color{orange}{\textsf{Medium}}$	Link	Code
1419	Minimum Number of Frogs Croaking	$\color{orange}{\textsf{Medium}}$	Link	Code
1448	Count Good Nodes in Binary Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
1457	Pseudo-Palindromic Paths in a Binary Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
1466	Reorder Routes to Make All Paths Lead to the City Zero	$\color{orange}{\textsf{Medium}}$	Link	Code
1472	Design Browser History	$\color{orange}{\textsf{Medium}}$	Link	Code
1474	Delete N Nodes After M Nodes of a Linked List	$\color{green}{\textsf{Easy}}$	Link	Code
1475	Final Prices With a Special Discount in a Shop	$\color{green}{\textsf{Easy}}$	Link	Code
1481	Least Number of Unique Integers after K Removals	$\color{orange}{\textsf{Medium}}$	Link	Code
1487	Making File Names Unique	$\color{orange}{\textsf{Medium}}$	Link	Code
1506	Find Root of N-Ary Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
1508	Range Sum of Sorted Subarray Sums	$\color{orange}{\textsf{Medium}}$	Link	Code
1509	Minimum Difference Between Largest and Smallest Value in Three Moves	$\color{orange}{\textsf{Medium}}$	Link	Code
1514	Path with Maximum Probability	$\color{orange}{\textsf{Medium}}$	Link	Code
1518	Water Bottles	$\color{green}{\textsf{Easy}}$	Link	Code
1525	Number of Good Ways to Split a String	$\color{orange}{\textsf{Medium}}$	Link	Code
1530	Number of Good Leaf Nodes Pairs	$\color{orange}{\textsf{Medium}}$	Link	Code
1535	Find the Winner of an Array Game	$\color{orange}{\textsf{Medium}}$	Link	Code
1544	Make The String Great	$\color{green}{\textsf{Easy}}$	Link	Code
1550	Three Consecutive Odds	$\color{green}{\textsf{Easy}}$	Link	Code
1551	Minimum Operations to Make Array Equal	$\color{orange}{\textsf{Medium}}$	Link	Code
1557	Minimum Number of Vertices to Reach All Nodes	$\color{orange}{\textsf{Medium}}$	Link	Code
1561	Maximum Number of Coins You Can Get	$\color{orange}{\textsf{Medium}}$	Link	Code
1570	Dot Product of Two Sparse Vectors	$\color{orange}{\textsf{Medium}}$	Link	Code
1575	Count All Possible Routes	$\color{red}{\textsf{Hard}}$	Link	Code
1578	Minimum Time to Make Rope Colorful	$\color{orange}{\textsf{Medium}}$	Link	Code
1584	Min Cost to Connect All Points	$\color{orange}{\textsf{Medium}}$	Link	Code
1593	Split a String Into the Max Number of Unique Substrings	$\color{orange}{\textsf{Medium}}$	Link	Code
1598	Crawler Log Folder	$\color{green}{\textsf{Easy}}$	Link	Code
1608	Special Array With X Elements Greater Than or Equal X	$\color{green}{\textsf{Easy}}$	Link	Code
1609	Even Odd Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
1630	Arithmetic Subarrays	$\color{orange}{\textsf{Medium}}$	Link	Code
1636	Sort Array by Increasing Frequency	$\color{green}{\textsf{Easy}}$	Link	Code
1641	Count Sorted Vowel Strings	$\color{orange}{\textsf{Medium}}$	Link	Code
1647	Minimum Deletions to Make Character Frequencies Unique	$\color{orange}{\textsf{Medium}}$	Link	Code
1650	Lowest Common Ancestor of a Binary Tree III	$\color{orange}{\textsf{Medium}}$	Link	Code
1652	Defuse the Bomb	$\color{green}{\textsf{Easy}}$	Link	Code
1653	Minimum Deletions to Make String Balanced	$\color{orange}{\textsf{Medium}}$	Link	Code
1657	Determine if Two Strings Are Close	$\color{orange}{\textsf{Medium}}$	Link	Code
1670	Design Front Middle Back Queue	$\color{orange}{\textsf{Medium}}$	Link	Code
1706	Where Will the Ball Fall	$\color{orange}{\textsf{Medium}}$	Link	Code
1721	Swapping Nodes in a Linked List	$\color{orange}{\textsf{Medium}}$	Link	Code
1740	Find Distance in a Binary Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
1756	Design Most Recently Used Queue	$\color{orange}{\textsf{Medium}}$	Link	Code
1762	Buildings With an Ocean View	$\color{orange}{\textsf{Medium}}$	Link	Code
1769	Minimum Number of Operations to Move All Balls to Each Box	$\color{orange}{\textsf{Medium}}$	Link	Code
1770	Maximum Score from Performing Multiplication Operations	$\color{red}{\textsf{Hard}}$	Link	Code
1797	Design Authentication Manager	$\color{orange}{\textsf{Medium}}$	Link	Code
1800	Maximum Ascending Subarray Sum	$\color{green}{\textsf{Easy}}$	Link	Code
1823	Find the Winner of the Circular Game	$\color{orange}{\textsf{Medium}}$	Link	Code
1836	Remove Duplicates From an Unsorted Linked List	$\color{orange}{\textsf{Medium}}$	Link	Code
1839	Longest Substring Of All Vowels in Order	$\color{orange}{\textsf{Medium}}$	Link	Code
1852	Distinct Numbers in Each Subarray	$\color{orange}{\textsf{Medium}}$	Link	Code
1863	Sum of All Subset XOR Totals	$\color{green}{\textsf{Easy}}$	Link	Code
1877	Minimize Maximum Pair Sum in Array	$\color{orange}{\textsf{Medium}}$	Link	Code
1880	Check if Word Equals Summation of Two Words	$\color{green}{\textsf{Easy}}$	Link	Code
1894	Find the Student that Will Replace the Chalk	$\color{orange}{\textsf{Medium}}$	Link	Code
1905	Count Sub Islands	$\color{orange}{\textsf{Medium}}$	Link	Code
1910	Remove All Occurrences of a Substring	$\color{orange}{\textsf{Medium}}$	Link	Code
1935	Maximum Number of Words You Can Type	$\color{green}{\textsf{Easy}}$	Link	Code
1940	Longest Common Subsequence Between Sorted Arrays	$\color{orange}{\textsf{Medium}}$	Link	Code
1944	Number of Visible People in a Queue	$\color{red}{\textsf{Hard}}$	Link	Code
1945	Sum of Digits of String After Convert	$\color{green}{\textsf{Easy}}$	Link	Code
1947	Maximum Compatibility Score Sum	$\color{orange}{\textsf{Medium}}$	Link	Code
1957	Delete Characters to Make Fancy String	$\color{green}{\textsf{Easy}}$	Link	Code
1962	Remove Stones to Minimize the Total	$\color{orange}{\textsf{Medium}}$	Link	Code
1971	Find if Path Exists in Graph	$\color{green}{\textsf{Easy}}$	Link	Code
1973	Count Nodes Equal to Sum of Descendants	$\color{orange}{\textsf{Medium}}$	Link	Code
1980	Find Unique Binary String	$\color{orange}{\textsf{Medium}}$	Link	Code
2016	Maximum Difference Between Increasing Elements	$\color{green}{\textsf{Easy}}$	Link	Code
2024	Maximize the Confusion of an Exam	$\color{orange}{\textsf{Medium}}$	Link	Code
2028	Find Missing Observations	$\color{orange}{\textsf{Medium}}$	Link	Code
2044	Count Number of Maximum Bitwise-OR Subsets	$\color{orange}{\textsf{Medium}}$	Link	Code
2046	Sort Linked List Already Sorted Using Absolute Values	$\color{orange}{\textsf{Medium}}$	Link	Code
2050	Parallel Courses III	$\color{red}{\textsf{Hard}}$	Link	Code
2058	Find the Minimum and Maximum Number of Nodes Between Critical Points	$\color{orange}{\textsf{Medium}}$	Link	Code
2083	Substrings That Begin and End With the Same Letter	$\color{orange}{\textsf{Medium}}$	Link	Code
2090	K Radius Subarray Averages	$\color{orange}{\textsf{Medium}}$	Link	Code
2096	Step-By-Step Directions From a Binary Tree Node to Another	$\color{orange}{\textsf{Medium}}$	Link	Code
2115	Find All Possible Recipes from Given Supplies	$\color{orange}{\textsf{Medium}}$	Link	Code
2125	Number of Laser Beams in a Bank	$\color{orange}{\textsf{Medium}}$	Link	Code
2129	Capitalize the Title	$\color{green}{\textsf{Easy}}$	Link	Code
2150	Find All Lonely Numbers in the Array	$\color{orange}{\textsf{Medium}}$	Link	Code
2177	Find Three Consecutive Integers That Sum to a Given Number	$\color{orange}{\textsf{Medium}}$	Link	Code
2181	Merge Nodes in Between Zeros	$\color{orange}{\textsf{Medium}}$	Link	Code
2186	Minimum Number of Steps to Make Two Strings Anagram II	$\color{orange}{\textsf{Medium}}$	Link	Code
2192	All Ancestors of a Node in a Directed Acyclic Graph	$\color{orange}{\textsf{Medium}}$	Link	Code
2196	Create Binary Tree From Descriptions	$\color{orange}{\textsf{Medium}}$	Link	Code
2204	Distance to a Cycle in Undirected Graph	$\color{red}{\textsf{Hard}}$	Link	Code
2241	Design an ATM Machine	$\color{orange}{\textsf{Medium}}$	Link	Code
2260	Minimum Consecutive Cards to Pick Up	$\color{orange}{\textsf{Medium}}$	Link	Code
2261	K Divisible Elements Subarrays	$\color{orange}{\textsf{Medium}}$	Link	Code
2265	Count Nodes Equal to Average of Subtree	$\color{orange}{\textsf{Medium}}$	Link	Code
2273	Find Resultant Array After Removing Anagrams	$\color{green}{\textsf{Easy}}$	Link	Code
2289	Steps to Make Array Non-decreasing	$\color{orange}{\textsf{Medium}}$	Link	Code
2290	Minimum Obstacle Removal to Reach Corner	$\color{red}{\textsf{Hard}}$	Link	Code
2295	Replace Elements in an Array	$\color{orange}{\textsf{Medium}}$	Link	Code
2300	Successful Pairs of Spells and Potions	$\color{orange}{\textsf{Medium}}$	Link	Code
2302	Count Subarrays With Score Less Than K	$\color{red}{\textsf{Hard}}$	Link	Code
2304	Minimum Path Cost in a Grid	$\color{orange}{\textsf{Medium}}$	Link	Code
2316	Count Unreachable Pairs of Nodes in an Undirected Graph	$\color{orange}{\textsf{Medium}}$	Link	Code
2326	Spiral Matrix IV	$\color{orange}{\textsf{Medium}}$	Link	Code
2328	Number of Increasing Paths in a Grid	$\color{red}{\textsf{Hard}}$	Link	Code
2340	Minimum Adjacent Swaps to Make a Valid Array	$\color{orange}{\textsf{Medium}}$	Link	Code
2342	Max Sum of a Pair With Equal Sum of Digits	$\color{orange}{\textsf{Medium}}$	Link	Code
2348	Number of Zero-Filled Subarrays	$\color{orange}{\textsf{Medium}}$	Link	Code
2360	Longest Cycle in a Graph	$\color{red}{\textsf{Hard}}$	Link	Code
2361	Minimum Costs Using the Train Line	$\color{red}{\textsf{Hard}}$	Link	Code
2365	Task Scheduler II	$\color{orange}{\textsf{Medium}}$	Link	Code
2368	Reachable Nodes With Restrictions	$\color{orange}{\textsf{Medium}}$	Link	Code
2387	Median of a Row Wise Sorted Matrix	$\color{orange}{\textsf{Medium}}$	Link	Code
2393	Count Strictly Increasing Subarrays	$\color{orange}{\textsf{Medium}}$	Link	Code
2410	Maximum Matching of Players With Trainers	$\color{orange}{\textsf{Medium}}$	Link	Code
2415	Reverse Odd Levels of Binary Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
2419	Longest Subarray With Maximum Bitwise AND	$\color{orange}{\textsf{Medium}}$	Link	Code
2422	Merge Operations to Turn Array Into a Palindrome	$\color{orange}{\textsf{Medium}}$	Link	Code
2435	Paths in Matrix Whose Sum Is Divisible by K	$\color{red}{\textsf{Hard}}$	Link	Code
2462	Total Cost to Hire K Workers	$\color{orange}{\textsf{Medium}}$	Link	Code
2477	Minimum Fuel Cost to Report to the Capital	$\color{orange}{\textsf{Medium}}$	Link	Code
2486	Append Characters to String to Make Subsequence	$\color{orange}{\textsf{Medium}}$	Link	Code
2487	Remove Nodes From Linked List	$\color{orange}{\textsf{Medium}}$	Link	Code
2491	Divide Players Into Teams of Equal Skill	$\color{orange}{\textsf{Medium}}$	Link	Code
2506	Count Pairs Of Similar Strings	$\color{green}{\textsf{Easy}}$	Link	Code
2510	Check if There is a Path With Equal Number of 0's And 1's	$\color{orange}{\textsf{Medium}}$	Link	Code
2512	Reward Top K Students	$\color{orange}{\textsf{Medium}}$	Link	Code
2536	Increment Submatrices by One	$\color{orange}{\textsf{Medium}}$	Link	Code
2559	Count Vowel Strings in Ranges	$\color{orange}{\textsf{Medium}}$	Link	Code
2563	Count the Number of Fair Pairs	$\color{orange}{\textsf{Medium}}$	Link	Code
2583	Kth Largest Sum in a Binary Tree	$\color{orange}{\textsf{Medium}}$	Link	Code
2592	Maximize Greatness of an Array	$\color{orange}{\textsf{Medium}}$	Link	Code
2593	Find Score of an Array After Marking All Elements	$\color{orange}{\textsf{Medium}}$	Link	Code
2599	Make the Prefix Sum Non-negative	$\color{orange}{\textsf{Medium}}$	Link	Code
2642	Design Graph With Shortest Path Calculator	$\color{red}{\textsf{Hard}}$	Link	Code
2670	Find the Distinct Difference Array	$\color{green}{\textsf{Easy}}$	Link	Code
2671	Frequency Tracker	$\color{orange}{\textsf{Medium}}$	Link	Code
2679	Sum in a Matrix	$\color{orange}{\textsf{Medium}}$	Link	Code
2707	Extra Characters in a String	$\color{orange}{\textsf{Medium}}$	Link	Code
2710	Remove Trailing Zeros From a String	$\color{green}{\textsf{Easy}}$	Link	Code
2743	Count Substrings Without Repeating Character	$\color{orange}{\textsf{Medium}}$	Link	Code
2788	Split Strings by Separator	$\color{green}{\textsf{Easy}}$	Link	Code
2792	Count Nodes That Are Great Enough	$\color{red}{\textsf{Hard}}$	Link	Code
2807	Insert Greatest Common Divisors in Linked List	$\color{orange}{\textsf{Medium}}$	Link	Code
2838	Maximum Coins Heroes Can Collect	$\color{orange}{\textsf{Medium}}$	Link	Code
2852	Sum of Remoteness of All Cells	$\color{orange}{\textsf{Medium}}$	Link	Code
2924	Find Champion II	$\color{orange}{\textsf{Medium}}$	Link	Code
2938	Separate Black and White Balls	$\color{orange}{\textsf{Medium}}$	Link	Code
2950	Number of Divisible Substrings	$\color{orange}{\textsf{Medium}}$	Link	Code
2974	Minimum Number Game	$\color{green}{\textsf{Easy}}$	Link	Code
2992	Number of Self-Divisible Permutations	$\color{orange}{\textsf{Medium}}$	Link	Code
3004	Maximum Subtree of the Same Color	$\color{orange}{\textsf{Medium}}$	Link	Code
3016	Minimum Number of Pushes to Type Word II	$\color{orange}{\textsf{Medium}}$	Link	Code
3028	Ant on the Boundary	$\color{green}{\textsf{Easy}}$	Link	Code
3032	Count Numbers With Unique Digits II	$\color{green}{\textsf{Easy}}$	Link	Code
3037	Find Pattern in Infinite Stream II	$\color{red}{\textsf{Hard}}$	Link	Code
3043	Find the Length of the Longest Common Prefix	$\color{orange}{\textsf{Medium}}$	Link	Code
3063	Linked List Frequency	$\color{green}{\textsf{Easy}}$	Link	Code
3090	Maximum Length Substring With Two Occurrences	$\color{green}{\textsf{Easy}}$	Link	Code
3105	Longest Strictly Increasing or Strictly Decreasing Subarray	$\color{green}{\textsf{Easy}}$	Link	Code
3110	Score of a String	$\color{green}{\textsf{Easy}}$	Link	Code
3121	Count the Number of Special Characters II	$\color{orange}{\textsf{Medium}}$	Link	Code
3131	Find the Integer Added to Array I	$\color{green}{\textsf{Easy}}$	Link	Code
3163	String Compression III	$\color{orange}{\textsf{Medium}}$	Link	Code
3170	Lexicographically Minimum String After Removing Stars	$\color{orange}{\textsf{Medium}}$	Link	Code
3180	Maximum Total Reward Using Operations I	$\color{orange}{\textsf{Medium}}$	Link	Code
3205	Maximum Array Hopping Score I	$\color{orange}{\textsf{Medium}}$	Link	Code
3233	Find the Count of Numbers Which Are Not Special	$\color{orange}{\textsf{Medium}}$	Link	Code
3248	Snake in Matrix	$\color{green}{\textsf{Easy}}$	Link	Code
3249	Count the Number of Good Nodes	$\color{orange}{\textsf{Medium}}$	Link	Code
3250	Find the Count of Monotonic Pairs I	$\color{red}{\textsf{Hard}}$	Link	Code
3297	Count Substrings That Can Be Rearranged to Contain a String I	$\color{orange}{\textsf{Medium}}$	Link	Code
3298	Count Substrings That Can Be Rearranged to Contain a String II	$\color{red}{\textsf{Hard}}$	Link	Code
3329	Count Substrings With K-Frequency Characters II	$\color{red}{\textsf{Hard}}$	Link	Code
3341	Find Minimum Time to Reach Last Room I	$\color{orange}{\textsf{Medium}}$	Link	Code
3342	Find Minimum Time to Reach Last Room II	$\color{orange}{\textsf{Medium}}$	Link	Code