| 1 |
Two Sum |
Easy |
1.cpp |
[LeetCode] 1. Two Sum |
| 2 |
Add Two Numbers |
Medium |
2.cpp |
[LeetCode] 2. Add Two Numbers |
| 7 |
Reverse Integer |
Easy |
7.cpp |
[LeetCode] 7. Reverse Integer |
| 8 |
String to Integer (atoi) |
Medium |
8.cpp |
|
| 20 |
Valid Parentheses |
Easy |
20.cpp |
[LeetCode] 20. Valid Parentheses |
| 21 |
Merge Two Sorted Lists |
Easy |
21.cpp |
[LeetCode] 21. Merge Two Sorted Lists |
| 27 |
Remove Element |
Easy |
27.cpp |
[LeetCode] 27. Remove Element |
| 62 |
Unique Paths |
Medium |
62.cpp |
[LeetCode] 62. Unique Paths |
| 64 |
Minimum Path Sum |
Medium |
64.cpp |
[LeetCode] 64. Minimum Path Sum |
| 66 |
Plus One |
Easy |
66.cpp |
[LeetCode] 66. Plus One |
| 104 |
Maximum Depth of Binary Tree |
Easy |
104.cpp |
[LeetCode] 104. Maximum Depth of Binary Tree |
| 136 |
Single Number |
Easy |
136.cpp |
[LeetCode] 136. Single Number |
| 139 |
Word Break |
Medium |
139.cpp |
|
| 155 |
Min Stack |
Easy |
155.cpp |
[LeetCode] 155. Min Stack |
| 167 |
Two Sum II - Input array is sorted |
Easy |
167.cpp |
[LeetCode] 167. Two Sum II - Input array is sorted |
| 169 |
Majority Element |
Easy |
169.cpp |
[LeetCode] 169. Majority Element |
| 175 |
Combine Two Tables |
Easy |
175.cpp |
|
| 176 |
Second Highest Salary |
Easy |
176.cpp |
|
| 181 |
Employees Earning More Than Their Managers |
Easy |
181.cpp |
|
| 182 |
Duplicate Emails |
Easy |
182.cpp |
|
| 183 |
Customers Who Never Order |
Easy |
183.cpp |
|
| 206 |
Reverse Linked List |
Easy |
206.cpp |
|
| 237 |
Delete Node in a Linked List |
Easy |
237.cpp |
[LeetCode] 237. Delete Node in a Linked List |
| 292 |
Nim Game |
Easy |
292.cpp |
|
| 338 |
Counting Bits |
Medium |
338.cpp |
|
| 344 |
Reverse String |
Easy |
344.cpp |
|
| 383 |
Ransom Note |
Easy |
383.cpp |
[LeetCode] 383. Ransom Note |
| 412 |
Fizz Buzz |
Easy |
412.cpp |
[LeetCode] 412. Fizz Buzz |
| 461 |
Hamming Distance |
Easy |
461.cpp |
[LeetCode] 461. Hamming Distance |
| 470 |
Implement Rand10() Using Rand7() |
Medium |
470.cpp |
[LeetCode] 470. Implement Rand10() Using Rand7() |
| 476 |
Number Complement |
Easy |
476.cpp |
[LeetCode] 476. Number Complement |
| 482 |
License Key Formatting |
Easy |
482.cpp |
[LeetCode] 482. License Key Formatting |
| 500 |
Keyboard Row |
Easy |
500.cpp |
[LeetCode] 500. Keyboard Row |
| 509 |
Fibonacci Number |
Easy |
509.cpp |
[LeetCode] 509. Fibonacci Number |
| 520 |
Detect Capital |
Easy |
520.cpp |
[LeetCode] 520. Detect Capital |
| 537 |
Complex Number Multiplication |
Medium |
537.cpp |
[LeetCode] 537. Complex Number Multiplication |
| 557 |
Reverse Words in a String III |
Easy |
557.cpp |
|
| 561 |
Array Partition I |
Easy |
561.cpp |
[LeetCode] 561. Array Partition I |
| 566 |
Reshape the Matrix |
Easy |
566.cpp |
[LeetCode] 566. Reshape the Matrix |
| 595 |
Big Countries |
Easy |
595.cpp |
|
| 617 |
Merge Two Binary Trees |
Easy |
617.cpp |
[LeetCode] 617. Merge Two Binary Trees |
| 620 |
Not Boring Movies |
Easy |
620.cpp |
|
| 627 |
Swap Salary |
Easy |
627.cpp |
|
| 654 |
Maximum Binary Tree |
Medium |
654.cpp |
|
| 657 |
Robot Return to Origin |
Easy |
657.cpp |
|
| 665 |
Non-decreasing Array |
Easy |
665.cpp |
[LeetCode] 665. Non-decreasing Array |
| 700 |
Search in a Binary Search Tree |
Easy |
700.cpp |
|
| 701 |
Insert into a Binary Search Tree |
Medium |
701.cpp |
[LeetCode] 701. Insert into a Binary Search Tree |
| 704 |
Binary Search |
Easy |
704.cpp |
[LeetCode] 704. Binary Search |
| 709 |
To Lower Case |
Easy |
709.cpp |
[LeetCode] 709. To Lower Case |
| 724 |
Find Pivot Index |
Easy |
724.cpp |
[LeetCode] 724. Find Pivot Index |
| 728 |
Self Dividing Numbers |
Easy |
728.cpp |
[LeetCode] 728. Self Dividing Numbers |
| 771 |
Jewels and Stones |
Easy |
771.cpp |
|
| 791 |
Custom Sort String |
Medium |
791.cpp |
[LeetCode] 791. Custom Sort String |
| 804 |
Unique Morse Code Words |
Easy |
804.cpp |
[LeetCode] 804. Unique Morse Code Words |
| 806 |
Number of Lines To Write String |
Easy |
806.cpp |
[LeetCode] 806. Number of Lines To Write String |
| 807 |
Max Increase to Keep City Skyline |
Medium |
807.cpp |
[LeetCode] 807. Max Increase to Keep City Skyline |
| 811 |
Subdomain Visit Count |
Easy |
811.cpp |
[LeetCode] 811. Subdomain Visit Count |
| 822 |
Card Flipping Game |
Medium |
822.cpp |
[LeetCode] 822. Card Flipping Game |
| 824 |
Goat Latin |
Easy |
824.cpp |
[LeetCode] 824. Goat Latin |
| 832 |
Flipping an Image |
Easy |
832.cpp |
[LeetCode] 832. Flipping an Image |
| 852 |
Peak Index in a Mountain Array |
Easy |
852.cpp |
[LeetCode] 852. Peak Index in a Mountain Array |
| 856 |
Score of Parentheses |
Medium |
856.cpp |
|
| 867 |
Transpose Matrix |
Easy |
867.cpp |
[LeetCode] 867. Transpose Matrix |
| 868 |
Binary Gap |
Easy |
868.cpp |
[LeetCode] 868. Binary Gap |
| 876 |
Middle of the Linked List |
Easy |
876.cpp |
[LeetCode] 876. Middle of the Linked List |
| 897 |
Increasing Order Search Tree |
Easy |
897.cpp |
[LeetCode] 897. Increasing Order Search Tree |
| 905 |
Sort Array By Parity |
Easy |
905.cpp |
[LeetCode] 905. Sort Array By Parity |
| 921 |
Minimum Add to Make Parentheses Valid |
Medium |
921.cpp |
[LeetCode] 921. Minimum Add to Make Parentheses Valid |
| 922 |
Sort Array By Parity II |
Easy |
922.cpp |
[LeetCode] 922. Sort Array By Parity II |
| 929 |
Unique Email Addresses |
Easy |
929.cpp |
[LeetCode] 929. Unique Email Addresses |
| 938 |
Range Sum of BST |
Easy |
938.cpp |
[LeetCode] 938. Range Sum of BST |
| 961 |
N-Repeated Element in Size 2N Array |
Easy |
961.cpp |
[LeetCode] 961. N-Repeated Element in Size 2N Array |
| 965 |
Univalued Binary Tree |
Easy |
965.cpp |
[LeetCode] 965. Univalued Binary Tree |
| 977 |
Squares of a Sorted Array |
Easy |
977.cpp |
[LeetCode] 977. Squares of a Sorted Array |
| 1021 |
Remove Outermost Parentheses |
Easy |
1021.cpp |
[LeetCode] 1021. Remove Outermost Parentheses |
| 1025 |
Divisor Game |
Easy |
1025.cpp |
[LeetCode] 1025. Divisor Game |
| 1108 |
Defanging an IP Address |
Easy |
1108.cpp |
[LeetCode] 1108. Defanging an IP Address |
| 1137 |
N-th Tribonacci Number |
Easy |
1137.cpp |
[LeetCode] 1137. N-th Tribonacci Number |