The solutions of the following Leetcode problem is written in Swift.
Array
- Two Sum Problem
- Three Sum Problem
- Four Sum Problem
- Is Subsequence
- Validate Stack SubSequence
- Maximum Subarray
- Missing Number
- Move any element to End
- Move zeros [Similar of Move Any element to end problem]
- Product Sum
- Search in 2D Array
- Validate Stack Sequence
- Search in A Sorted Array I
- Search in A Sorted Array II
- Merge Intervals
- Set Zero to Matrix
Backtrack
- combination Sum - I
- combination Sum - II
- combination Sum - III
- Count Sorted Vowel String
- Combination
- Maximum Unique Character
LinkedList
Graph
Tree
String
Design Problems