-
Notifications
You must be signed in to change notification settings - Fork 34
rost0413/LeetCode
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
Solution set for Leetcode online interview problems. (60/92) http://www.leetcode.com/onlinejudge 3 Sum: medium 3 Sum Closest: medium 4 Sum: Is there a solution that the time complexity is better than O(n^2 * lgn)? Add Binary: medium Add Two Numbers: easy Anagrams: easy Climbing Stairs: medium Combination Sum: Is there a better way to construct the path? Combination Sum II: Is ther a better way to construct the path? Combinations: easy Container With Most Water: hard Count and Say: easy Decode Ways: dp Divide Two Integers: easy Edit Distance: dp First Missing Positive: easy Generate Parentheses: easy Gray Code: bit operation Implement strStr(): easy Insert Interval: easy Integer to Roman: easy Jump Game: medium Jump Game II: medium Largest Rectangle in Histogram: hard Length of Last Word: easy Letter Combinations of a Phone Number: easy Longest Common Prefix: easy ***Longest Palindromic Substring: hard Longest Substring Without Repeating Characters: easy Longest Valid Parentheses: medium Maximal Rectangle: hard Maximum Subarray: dp ***Median of Two Sorted Arrays Merge Intervals: easy Merge k Sorted Lists: medium Merge Sorted Array: medium Merge Two Sorted Lists: easy Minimum Path Sum: easy Minimum Window Substring: hard Multiply Strings: easy N-Queens: easy N-Queens II: dfs Next Permutation: hard Palindrome Number: Is there any better solution? Partition List: medium linked list Permutation Sequence: medium number theory Permutations: easy ***Permutations II: better solution than O(n! * lg(n!))? Plus One: easy Pow(x, n): medium how to write neat exponential steps Regular Expression Matching: hard, boundry and logic. Better solution? Remove Duplicates from Sorted Array: easy Remove Duplicates from Sorted Array II: easy Remove Duplicates from Sorted List: easy Remove Duplicates from Sorted List II: medium Remove Element: easy Remove Nth Node From End of List: medium Reverse Integer: easy Reverse Linked List II: medium Reverse Nodes in k-Group: medium Roman to Integer: easy Rotate Image: easy Rotate List: easy Scramble String Search a 2D Matrix Search for a Range Search in Rotated Sorted Array Search in Rotated Sorted Array II Search Insert Position Set Matrix Zeroes Simplify Path Sort Colors Spiral Matrix Spiral Matrix II Sqrt(x) String to Integer (atoi) Subsets Substring with Concatenation of All Words Sudoku Solver Swap Nodes in Pairs Text Justification Trapping Rain Water Two Sum Unique Paths Unique Paths II Valid Number Valid Parentheses Valid Sudoku Wildcard Matching Word Search ZigZag Conversion
About
Solution set for LeetCode.com.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published