herohunfer / leetcode Goto Github PK

program                   small       large
3sum                      512msecs    1188msecs
3SumClosest               513msecs    560msecs
4sum
Add Binary                484msecs    696msecs
AddTwoNumber              552msecs    832msecs
anagram                   608msecs    1064msecs
Balanced Binary Tree      568msecs    644msecs
Best Time to Stock        544msecs    584msecs
Best Time Stock 2         508msecs    1092msecs
Best Time Stock 3         532msecs
Binary Tree Inorder       604msecs    640msecs
Binary Tree Level         552msecs    720msecs
Binary Tree Level 2       584msecs    724msecs
Binary Tree Max Sum       564msecs    792msecs
Binary Tree Zigzag        580msecs    572msecs
Climbing Stairs           492msecs    516msecs
Combination Sum           552msecs    768msecs
Combination Sum 2         560msecs    776msecs
Combinations              540msecs    628msecs
Inorder Postorder         580msecs    952msecs
Preorder Inorder          512msecs    996msecs
*ContainerWithMostWater   540msecs    548msecs
ValidPalindrome           492msecs    588msecs
Triangle                  484msecs    576msecs
*Pascal's Triangle 2      524msecs    512msecs
Pascal's Triangle         492msecs    568msecs
Populating next pointer   540msecs    652msecs
Populating next pointer 2 576msecs    732msecs
Distinct Subsequences     564msecs 
Flatten Binary Tree       540msecs    704msecs
Path Sum 2                596msecs    804msecs
Path Sum                  548msecs    740msecs
Two Sum                   556msecs    584msecs
Median of Two Arrays      928msecs    1016msecs
*LongestSubstringNoRepeat 528msecs    704msecs
LongestPalindromicString  472msecs    540msecs           
ZigZag Conversion         552msecs    1376msecs
Reverse Integer           524msecs    768msecs
String to Integer         500msecs    768msecs
Palindrome Number         532msecs    1380msecs
Integer to Roman          548msecs    936msecs
Roman To Integer          524msecs    848msecs
LongestCommonPrefix       572msecs    708msecs
LetterCombinationPhone    488msecs    544msecs
RemoveNthNodeFromEnd      524msecs    600msecs
** Using Sentinel
Valid Parentheses         500msecs    508msecs
Generate Parenthesis      544msecs    592msecs
Merge K Sorted Lists      476msecs    664msecs
Swap Nodes In Pairs       580msecs    524msecs
** Classic. How about swap using n space (stack) or can modify value?
Reverse Nodes In K Groups 508msecs    624msecs
Remove Element            492msecs    568msecs
Implement StrStr()        600msecs    664msecs
Substring Concatenation   608msecs    1772msecs
SearchInRotatedArray      516ms       604ms
SearchForARange           536ms       560ms
SearchInsert              516ms       528ms
isValidSudoku             attempted
countAndSay               532ms       800ms
FirstMissingPositive      520ms       584ms
TrappingRainWater         520ms       564ms
multiply                  508ms       688ms
Wildcard Matching         660ms       failed
JumpGame2                 500ms       580ms
Rotate Image              552ms       536ms
pow(x, n)                 620ms       916ms
nQueen                    632ms       800ms
nQueen2                   under construction
WordLadder                580ms       1784ms
Maximum Subarray          492ms       536ms
Spiral Matrix             516ms       556ms
Jump Game                 512ms       584ms
Merge Intervals           560ms       668ms
Insert Interval           576ms       740ms
Length of Last word       476ms       484ms
Spiral Matrix II          532ms       492ms
Rotate List               588ms       728ms
Permutation Sequence      496ms       560ms
Unique Paths              520ms       536ms
Unique Paths II           512ms       612ms
Minimum Path Sum          472ms       552ms
Merge Two Sorted Lists    572ms       712ms
Add Binary                556ms       676ms
Valid Number              504ms       704ms
Plus One                  556ms       584ms
Text Justification        624ms       692ms
Sqrt(x)                   692ms       1004ms
Simplify Path             572ms       716ms
Set Matrix Zeroes         524ms       644ms
Search a 2D matrix        480ms       576ms
Sort Colors               492ms       588ms
Minimum Window SubString  PASS
Subsets                   500ms       588ms
Word Search               668ms       1680ms
Remove Duplicates arrayII 512ms       692ms
Remove Duplicate list     552ms       684ms
Remove Duplicate List II  556ms       692ms
SearchInRotatedArray II   584ms       568ms
LargestRectangleHistogram 512ms       Too many levels
Maximal Rectangle         PASS
Patition List             520ms       708ms
Scramble String           564ms       720ms
Merge Sorted Array        504ms       584ms
Gray Code                 496ms       672ms
Decode Ways               512ms       540ms
Reverse Linked List 2     528ms       616ms
Restore IP addresses      608ms       624ms
Unique BST                512ms       500ms
Unique BST 2              588ms       672ms
Interleaving String       572ms       608ms
Validate BST              536ms       672ms
Recover BST               584ms       1176ms
Same Tree                 560ms       600ms
Symmetric Tree            576ms       736ms
Maximum Depth of BTree    464ms       596ms
Convert Sort Array to BST 496ms       636ms
Convert Sort List to BST  544ms       748ms
Minimum Depth of BTree    484ms       600ms
Binary Tree Maximum Path Sum    check "crack the code interview"
Populating Next Right     588ms       624ms
Populating Next Right 2   540ms       756ms
Word Ladder               544ms       1972ms
Word Ladder 2             592ms       fail at large  
Longest Consecutive       500ms       692ms
Sum Root to Leaf Numbers  552ms       608ms
Surrounded Regions        572ms       768ms
Palindrome Partitioning   536ms       804ms
Palindrome Partitioning 2 508ms       1340ms