Array:
1> Two Sum (Easy TC: O(nlogn) SC:1 ) : https://github.com/naashonomics/algoexpert/blob/master/two_sum.ipynb
2> Three Sum
3> Smallest Difference
4>Four Sum
5> Subarray sort
6> Largest Range
7> Min Rewards
Sorting:
1> Bubble Sort ( Easy TC O (n^2) SC:O(1)): https://github.com/naashonomics/algoexpert/blob/master/bubble_sort.ipynb
2> Insertion Sort (Easy YC O(N^2) SC : O(1)) : https://github.com/naashonomics/algoexpert/blob/master/selectionsort.ipynb
3> Selection Sort
4> Quick Sort
5> Heap Sort
6> Merge Sort
Recurssion :
1> Fibonacci ( Easy O(n) SC: O(1)) https://github.com/naashonomics/algoexpert/blob/master/fibonacci.ipynb