My journey: from junior to the iOS Tech Lead
Where it all begins: https://www.youtube.com/watch?v=MnrJzXM7a6o
- LeetCode: Remove Duplicates from Sorted Array --> Swift Solution - t=O(N), s=O(1)
- LeetCode: Best Time to Buy and Sell Stock II --> Swift Solution - t=O(N), s=O(1)
- LeetCode: Rotate Array --> Swift Solution - t=O(N), s=O(1)
- LeetCode: Contains Duplicate --> Swift Solution - t=O(N), s=O(N)
- LeetCode: Single Number --> Swift Solution - t=O(N), s=O(N)
- LeetCode: Intersection Of Two Arrays 2 --> Swift Solution - t=O(N+M), s=O(N). For sorted arrays: t=O(min(N,M)), s=O(1)
- LeetCode: Plus One --> Swift Solution - t=O(N), s=O(1)
- LeetCode: Move Zeroes --> Swift Solution - t=O(N), s=O(1)
- LeetCode: Two Sum --> Swift Solution - t=O(N), s=O(N)
- LeetCode: Valid Sudoku --> Swift Solution - t=O(N^2), s=O(N^2)
- LeetCode: Reverse String --> Swift Solution - t=O(N), s=O(1)
- Leetcode: Reverse Integer --> Swift Solution - t=O(N), s=O(1)
- LeetCode: First Unique Character in a String --> Swift Solution - t=O(N), s=O(N)
- LeetCode: Valid Anagram --> Swift Solution - t=O(N), s=O(N)
- LeetCode: Valid Palindrome --> Swift Solution - t=O(N), s=O(N)
- LeetCode: Implement strStr() --> Swift Solution - t=O(NxM), s=O(NxM)
- Leetcode: Count And Say --> Swift Solution - t=O(NxM), s=O(M)
- LeetCode: The Longest Common Prefix --> Swift Solution - t=O(MxN^2), s=O(1)
What to learn in DS&Algorithms: https://medium.com/@alimirio/before-you-start-solving-problems-on-leetcode-prep-work-9d65fc964c6f