no. | Title | lvl |
---|---|---|
E A S Y | ||
0001 | Two Sum | Easy |
0009 | Palindrome Number | Easy |
0013 | Roman to Integer (1) | Easy |
0013 | Roman to Integer (2) | Easy |
0013 | Roman to Integer (3) | Easy |
0014 | Longest Common Prefix | Easy |
0020 | Valid Parentheses (1) | Easy |
0020 | Valid Parentheses (2) | Easy |
0021 | Merge Two Sorted Lists | Easy |
0026 | Remove Duplicates from Sorted Array (1) | Easy |
0026 | Remove Duplicates from Sorted Array (2) | Easy |
0027 | Remove Element | Easy |
0028 | Find the Index of the First Occurrence in a String | Easy |
0066 | Plus One | Easy |
0069 | Sqrt(x) | Easy |
0070 | Climbing Stairs | Easy |
0088 | Merge Sorted Array (1) | Easy |
0088 | Merge Sorted Array (2) [UN-ACCEPTED] | Easy |
0094 | Binary Tree Inorder Traversal | Easy |
1331 | Rank Transform of an Array | Easy |
1684 | Count the Number of Consistent Strings | Easy |
1945 | Sum of Digits of String After Convert | Easy |
2022 | Convert 1D Array Into 2D Array | Easy |
3110 | Score of a String | Easy |
M E D I U M | ||
0002 | Add Two Numbers | Med. |
0003 | Longest Substring Without Repeating Characters | Med. |
0005 | Longest Palindromic Substring | Med. |
0006 | Zigzag Conversion | Med. |
0007 | Reverse Integer | Med. |
0008 | String to Integer (atoi) | Med. |
0011 | Container With Most Water (1) | Med. |
0011 | Container With Most Water (2) | Med. |
0011 | Container With Most Water (3) | Med. |
0015 | 3Sum (1) [TIME-LIMIT-EXCEEDED] | Med. |
0015 | 3Sum (2) [TIME-LIMIT-EXCEEDED] | Med. |
0015 | 3Sum (3) | Med. |
0017 | Letter Combinations of a Phone Number | Med. |
0018 | 4Sum | Med. |
0019 | Remove Nth Node From End of List | Med. |
0029 | Divide Two Integers (1) [TIME-LIMIT-EXCEEDED] | Med. |
0029 | Divide Two Integers (2) | Med. |
0049 | Group Anagrams | Med. |
0050 | Pow(x, n) | Med. |
0179 | Largest Number (1) | Med. |
0179 | Largest Number (2) | Med. |
0386 | Lexicographical Numbers | Med. |
0539 | Minimum Time Difference | Med. |
0567 | Permutation in String | Med. |
0725 | Split Linked List in Parts | Med. |
0729 | My Calendar I | Med. |
0731 | My Calendar II | Med. |
0874 | Walking Robot Simulation | Med. |
1310 | XOR Queries of a Subarray | Med. |
1371 | Find the Longest Substring Containing Vowels in Even Counts | Med. |
1894 | Find the Student that Will Replace the Chalk | Med. |
2028 | Find Missing Observations (1) [MEMORY-LIMIT-EXCEEDED] | Med. |
2028 | Find Missing Observations (2) [TIME-LIMIT-EXCEEDED] | Med. |
2028 | Find Missing Observations (3) | Med. |
2220 | Minimum Bit Flips to Convert Number | Med. |
2326 | Spiral Matrix IV | Med. |
2419 | Longest Subarray With Maximum Bitwise AND | Med. |
2491 | Divide Players Into Teams of Equal Skill | Med. |
2807 | Insert Greatest Common Divisors in Linked List | Med. |
3043 | Find the Length of the Longest Common Prefix | Med. |
3217 | Delete Nodes From Linked List Present in Array | Med. |
H A R D | ||
0004 | Median of Two Sorted Arrays | Hard |
0023 | Merge k Sorted Lists (1) [UN_ACCEPTED] | Hard |
0023 | Merge k Sorted Lists (2) [UN_ACCEPTED] | Hard |
0023 | Merge k Sorted Lists (3) | Hard |
0214 | Shortest Palindrome | Hard |
0432 | All O`one Data Structure | Hard |
-
Notifications
You must be signed in to change notification settings - Fork 0
RichardMalcharek/-leetcode
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
My Solutions for leetcode.com
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published