1. Implement a function to check if a string is palindrome or not 2. Given a cost function and a budget find the maximum quantity you can buy given those 2 parameters
Sigiloso
1. Simple enough, just put a pointer in the begining and the end of the string and iterate inside and see if there is differing element 2. Find the upper limit of things that you can buy by exponentially increase the quantity. Then just do binary search with 1, and the upper limit as the starting paraemeter