Algorithms and design patterns in pythonic way.
Day One
- https://www.geeksforgeeks.org/minimum-number-of-working-days-required-to-achieve-each-of-the-given-scores/
- https://www.geeksforgeeks.org/smallest-index-that-splits-an-array-into-two-subarrays-with-equal-product/
- https://www.geeksforgeeks.org/count-number-of-common-elements-between-a-sorted-array-and-a-reverse-sorted-array/
Day Two
- https://geeksforgeeks.org/subtract-1-from-a-number-represented-as-linked-list/
- https://www.geeksforgeeks.org/minimize-cost-of-flipping-or-swaps-to-make-a-binary-string-balanced/
- https://www.geeksforgeeks.org/count-ways-to-reach-the-nth-station/
Day Three
- Design Min-heap.
- Design Max-heap.
- Design HeapSort.
- Maximise profit as per stock buy and sell
- Adapter design pattern.
Day Four
- Group similar titles in Netflix
- Check whether a title in netflix is increasing or decreasing in popularity
- Fetch top movies from N countries and convert them into single list in ascending order. (Heapsort)