my solutions of leetcode
Sequence | Problem | Test Cases | Runtime(ms) | Beats |
---|---|---|---|---|
001 | Two Sum | 29 | 52 | 99.98% |
002 | Add Two Numbers | 1563 | 116 | 88.07% |
003 | Longest Substring Without Repeating Characters | 983 | 104 | 75.33% |
004 | Median of Two Sorted Arrays | 2080 | 209 | 10.29% |
005 | Longest Palindromic Substring | - | - | - |
006 | ZigZag Conversion | 1158 | 139 | 33.98% |
007 | Reverse Integer | 1032 | 72 | 97.39% |
008 | String to Integer | 1079 | 76 | 88.63% |
009 | Palindrome Number | 11507 | 472 | 2.76% |
010 | Regular Expression Matching | - | - | - |
011 | Container With%20Most Water | 50 | 344 | 27.99% |
012 | Integer to Roman | 3999 | 242 | 7.44% |
013 | Roman to Integer | 3999 | 286 | 4.60% |
014 | Longest Common Prefix | 117 | 92 | 9.65% |
015 | 3Sum | - | - | - |
016 | 3Sum Closest | - | - | - |
017 | Letter Combinations of a Phone Number | 25 | 98 | 4.25% |
018 | 4Sum | - | - | - |
019 | Remove Nth Node From End of List | 208 | 56 | 99.85% |
020 | Valid Parenthese | 76 | 56 | 80.12% |