I solved [Campus Bike II](https://leetcode.com/problems/campus-bikes-ii/).\n\nI have two implementations [Bottom UP DP](https://pastebin.com/88U42u8j) and \n[Top Down DP](https://pastebin.com/ipWeq8GQ)\n\nUsing the top down dp solution I got accepted in 3 ms and using bottom up dp it took 14ms. The time complexity of both the approach looks same to me.\n\nI want to know why there is such a difference in their execution time.

I solved Campus Bike II.\n\nI have two implementations Bottom UP DP and \nTop Down DP\n\nUsing the top down dp solution I got accepted in 3 ms and using bottom 