These are some algorithms that I learnt in my algorithms course in college as well as some I probably solved when I was free.
My plan is to keep this repository updated with the algorithms I might learn in future as well.
Problems solved till now:
- Two sum
- First approach is to use two for loops takes a time complexity of O(n^2) and space complexity of O(1)
- Anything with this complexity can always be brought down to O(n) time complexity and O(n) space complexity with the help of hashmaps => Optimal Solution
- Reverse Polish Notation
- Peak finding
- Valid paranthesis
- Best time to buy and sell stock - Link
- Minimum path sum - Link
- Counting Bits
- Longest common subsequence - Link
- House robber - Link
- Unique paths - Link
- Climbing stairs - Link
Thanks for coming by.