1 |
Two Sum |
C++ |
8 ms |
3 |
Longest Substring Without Repeating Characters |
C++ |
28 ms |
19 |
Remove Nth Node From End of List |
C++ |
4 ms |
49 |
Group Anagrams |
C++ |
124 ms |
91 |
Decode Ways |
C++ |
0 ms |
96 |
Unique Binary Search Trees |
C++ |
0 ms |
101 |
Symmetric Tree |
C++ |
4 ms |
105 |
Construct Binary Tree from Preorder and Inorder Traversal |
C++ |
12 ms |
108 |
Convert Sorted Array to Binary Search Tree |
C++ |
28 ms |
112 |
Path Sum |
C++ |
8 ms |
198 |
House Robber |
C++ |
0 ms |
211 |
Design Add and Search Words Data Structure |
C++ |
68 ms |
284 |
Peeking Iterator |
C++ |
4 ms |
295 |
Find Median from Data Stream |
C++ |
100 ms |
297 |
Serialize and Deserialize Binary Tree |
C++ |
40 ms |
303 |
Range Sum Query - Immutable |
C++ |
16 ms |
318 |
Maximum Product of Word Lengths |
C++ |
232 ms |
322 |
Coin Change |
C++ |
100 ms |
337 |
House Robber III |
C++ |
24 ms |
378 |
Kth Smallest Element in a Sorted Matrix |
C++ |
36 ms |
410 |
Split Array Largest Sum |
C++ |
0 ms |
424 |
Longest Repeating Character Replacement |
C++ |
48 ms |
449 |
Serialize and Deserialize BST |
C++ |
20 ms |
467 |
Unique Substrings in Wraparound String |
C++ |
8 ms |
468 |
Validate IP Address |
C++ |
0 ms |
473 |
Matchsticks to Square |
C++ |
N/A |
481 |
Magical String |
C++ |
24 ms |
504 |
Base 7 |
C++ |
0 ms |
506 |
Relative Ranks |
C++ |
16 ms |
515 |
Find Largest Value in Each Tree Row |
C++ |
24 ms |
560 |
Subarray Sum Equals K |
C++ |
68 ms |
629 |
K Inverse Pairs Array |
C++ |
N/A |
648 |
Replace Words |
C++ |
92 ms |
657 |
Robot Return to Origin |
C++ |
8 ms |
662 |
Maximum Width of Binary Tree |
C++ |
12 ms |
669 |
Trim a Binary Search Tree |
C++ |
12 ms |
689 |
Maximum Sum of 3 Non-Overlapping Subarrays |
C++ |
28 ms |
693 |
Binary Number with Alternating Bits |
C++ |
4 ms |
705 |
Design HashSet |
C++ |
248 ms |
739 |
Daily Temperatures |
C++ |
60 ms |
778 |
Swim in Rising Water |
C++ |
232 ms |
787 |
Cheapest Flights Within K Stops |
C++ |
92 ms |
832 |
Flipping an Image |
C++ |
4 ms |
841 |
Keys and Rooms |
C++ |
8 ms |
856 |
Score of Parentheses |
C++ |
0 ms |
869 |
Reordered Power of 2 |
C++ |
16 ms |
873 |
Length of Longest Fibonacci Subsequence |
C++ |
196 ms |
902 |
Numbers At Most N Given Digit Set |
C++ |
4 ms |
910 |
Smallest Range II |
C++ |
36 ms |
950 |
Reveal Cards In Increasing Order |
C++ |
0 ms |
955 |
Delete Columns to Make Sorted II |
C++ |
8 ms |
984 |
String Without AAA or BBB |
C++ |
0 ms |
1024 |
Video Stitching |
C++ |
4 ms |
1026 |
Maximum Difference Between Node and Ancestor |
C++ |
56 ms |
1038 |
Binary Search Tree to Greater Sum Tree |
C++ |
4 ms |
1052 |
Grumpy Bookstore Owner |
C++ |
48 ms |
1090 |
Largest Values From Labels |
C++ |
64 ms |
1186 |
Maximum Subarray Sum with One Deletion |
C++ |
56 ms |
1191 |
K-Concatenation Maximum Sum |
C++ |
72 ms |
1219 |
Path with Maximum Gold |
C++ |
1800 ms |
1301 |
Number of Paths with Max Score |
C++ |
204 ms |
1305 |
All Elements in Two Binary Search Trees |
C++ |
124 ms |
1316 |
Distinct Echo Substrings |
C++ |
220 ms |
1329 |
Sort the Matrix Diagonally |
C++ |
12 ms |
1349 |
Maximum Students Taking Exam |
C++ |
8 ms |
1357 |
Apply Discount Every n Orders |
C++ |
196 ms |
1359 |
Count All Valid Pickup and Delivery Options |
C++ |
0 ms |
1388 |
Pizza With 3n Slices |
C++ |
0 ms |
1396 |
Design Underground System |
C++ |
184 ms |
1443 |
Minimum Time to Collect All Apples in a Tree |
C++ |
224 ms |
1448 |
Count Good Nodes in Binary Tree |
C++ |
124 ms |
1473 |
Paint House III |
C++ |
172 ms |
1502 |
Can Make Arithmetic Progression From Sequence |
C++ |
4 ms |
1514 |
Path with Maximum Probability |
C++ |
728 ms |
1518 |
Water Bottles |
C++ |
0 ms |
1524 |
Number of Sub-arrays With Odd Sum |
C++ |
332 ms |
1593 |
Split a String Into the Max Number of Unique Substrings |
C++ |
280 ms |
1599 |
Maximum Profit of Operating a Centennial Wheel |
C++ |
148 ms |
1655 |
Distribute Repeating Integers |
C++ |
444 ms |
1658 |
Minimum Operations to Reduce X to Zero |
C++ |
344 ms |
1671 |
Minimum Number of Removals to Make Mountain Array |
C++ |
36 ms |
1688 |
Count of Matches in Tournament |
C++ |
0 ms |
1749 |
Maximum Absolute Sum of Any Subarray |
C++ |
224 ms |