LeetCodeSet
some LeetCode's solutions
Easy
题号 |
题目 |
C# |
JAVA |
Kotlin |
595 |
Big Countries |
√ |
x |
x |
561 |
Array Partition I |
√ |
x |
x |
67 |
Add Binary |
√ |
x |
x |
70 |
Climbing Stairs |
√ |
x |
x |
1185 |
Day of the Week |
√ |
x |
x |
1108 |
Defanging an IP Address |
√ |
x |
x |
832 |
Flipping an Image |
√ |
x |
x |
461 |
Hamming Distance |
√ |
x |
x |
1189 |
Maximum Number of Balloons |
√ |
x |
x |
617 |
Merge Two Binary Trees |
√ |
x |
x |
1200 |
Minimum Absolute Difference |
√ |
x |
x |
961 |
N-Repeated Element in Size 2N Array |
√ |
x |
x |
938 |
Range Sum Of BST |
√ |
x |
x |
1179 |
Reformat Department Table |
√ |
x |
x |
83 |
Remove Duplicates from Sorted List |
√ |
x |
x |
1021 |
Remove Outermost Parentheses |
√ |
x |
x |
657 |
Robot Return to Origin |
√ |
x |
x |
728 |
Self Dividing Numbers |
√ |
x |
x |
905 |
Sort Array By Parity |
√ |
x |
x |
1221 |
Split A String In Balanced Strings |
√ |
x |
x |
977 |
Squares of a Sorted Array |
√ |
x |
x |
627 |
Swap Salary |
√ |
x |
x |
1207 |
Unique Number of Occurrences |
√ |
x |
x |
804 |
Unique MorseCodeWords |
√ |
x |
x |
709 |
To Lower Case |
√ |
x |
x |
69 |
Sqrt(x) |
√ |
x |
x |
944 |
Delete Columns to Make Sorted |
√ |
x |
x |
933 |
Number of Recent Calls |
√ |
x |
x |
88 |
Merge Sorted Array |
√ |
x |
x |
118 |
Pascal's Triangle |
√ |
x |
√ |
119 |
Pascal's Triangle II |
x |
√ |
√ |
121 |
Best Time to Buy and Sell Stock |
x |
√ |
x |
100 |
Same Tree |
√ |
x |
x |
101 |
Symmetric Tree |
√ |
x |
x |
104 |
Maximum Depth of Binary Tree |
√ |
x |
x |
111 |
Minimum Depth of Binary Tree |
√ |
√ |
x |
112 |
Path_Sum |
√ |
x |
x |
110 |
Balanced Binary Tree |
√ |
x |
x |
257 |
Binary_Tree_Paths |
x |
√ |
x |
108 |
Convert_Sorted_Array_to_Binary_Search_Tree |
x |
√ |
x |
Medium
题号 |
题目 |
C# |
JAVA |
Kotlin |
861 |
Score After Flipping Matrix |
√ |
x |
x |
535 |
Encode and Decode TinyURL |
√ |
x |
x |
1161 |
Maximum Level Sum of a BinaryTree |
√ |
x |
x |
1038 |
Binary Search Tree to Greater Sum Tree |
√ |
x |
x |
807 |
Max Increase to Keep City Skyline |
√ |
x |
x |
701 |
Insert into a Binary Search Tree |
√ |
x |
x |
1079 |
Letter Tile Possibilities |
√ |
x |
x |
1008 |
Construct Binary Search Tree from Preorder Traversal |
√ |
x |
x |
18 |
4Sum |
√ |
x |
x |
31 |
Next Permutation |
√ |
x |
x |
33 |
Search in Rotated Sorted Array |
√ |
x |
x |
11 |
Container With Most Water |
√ |
x |
√ |
98 |
Validate Binary Search Tree |
√ |
√ |
x |
113 |
Path Sum II |
x |
√ |
x |
49 |
Group Anagrams |
x |
√ |
x |
166 |
Fraction to Recurring Decimal |
√ |
x |
x |
187 |
Repeated DNA Sequences |
√ |
x |
x |
274 |
H-Index |
√ |
x |
x |
347 |
Top_K_Frequent_Elements |
x |
√ |
x |
105 |
Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal |
x |
√ |
x |
109 |
Convert_Sorted_List_to_Binary_Search_Tree |
x |
√ |
x |
Hard
题号 |
题目 |
C# |
JAVA |
Kotlin |
124 |
Binary Tree Maximum Path Sum |
√ |
x |
x |
4 |
Median of Two Sorted Arrays |
√ |
x |
x |