mikanek / leetcode-solutions-in-swift Goto Github PK

###LeetCode Solutions in Swift

• For iOS job interviews.
• Written in Swift 1.2.
• Test cases included (XCTest).
• Run with the latest Xcode (6.4 Beta 2 Build 6E14).
• Best time / space complexity guaranteed.

1. Two Sum - Medium - Solution - Test Cases
2. Add Two Numbers - Medium - Solution - Test Cases
3. Longest Substring Without Repeating Characters - Medium - Solution - Test Cases
4. Median of Two Sorted Arrays - Hard - Solution - Test Cases
5. Longest Palindromic Substring - Medium - Solution - Test Cases
6. ZigZag Conversion - Easy - Solution - Test Cases
7. Reverse Integer - Easy - Solution - Test Cases
8. String to Integer (atoi) - Easy - Solution - Test Cases
9. Palindrome Number - Easy - Solution - Test Cases
10. Regular Expression Matching - Hard - Solution - Test Cases
11. Container With Most Water - Medium - Solution - Test Cases
12. Integer To Roman - Medium - Solution - Test Cases
13. Roman To Integer - Easy - Solution - Test Cases
14. Longest Common Prefix - Easy - Solution - Test Cases
15. 3Sum - Medium - Solution - Test Cases
16. 3Sum Closest - Medium - Solution - Test Cases
17. Letter Combinations of A Phone Number - Medium - Solution - Test Cases
18. 4Sum - Medium - Solution - Test Cases
19. Remove Nth Node From End of List - Easy - Solution - Test Cases
20. Valid Parentheses - Easy - Solution - Test Cases
21. Merge Two Sorted Lists - Easy - Solution - Test Cases
22. Generate Parentheses - Medium - Solution - Test Cases
23. Merge K Sorted Lists - Hard - Solution - Test Cases
24. Swap Nodes in Pairs - Medium - Solution - Test Cases
25. Reverse Nodes in k-Group - Hard - Solution - Test Cases
26. Remove Duplicates from Sorted Array - Easy - Solution - Test Cases
27. Remove Element- Easy - Solution - Test Cases
28. Implement strStr() - Easy - Solution - Test Cases - KMP: t=O(M+N), s=O(N). Brute-force: t=O(MxN), s=O(1).
29. Divide Two Integers - Medium - Solution - Test Cases - t=O((logN)^2), s=O(1)
30. Substring with Concatenation of All Words - Hard - Solution - Test Cases - t=O(NxW), s=O(LxW), where N is the length of the string, W is the length of a word, L is the length of the words list.

###[email protected] ###LinkedIn