InterviewBit Problems   Dungeon Princess : Solved

About the Dungeon Princess : Solved category (1)
Recursion with Cache (1)
Simple Top-down Approach in C++ ( O(n*m) complexity ) (1)
Simple Recursive + memoization Solution (1)
Elegant C++ Top Down Approach :) (1)
What is wrong in my approach, Ive a tried a little different approach (2)
C++, easy and short (1)
Simple DP approach in C++(O(row*col) time complexity) (2)
Top down python solution (1)
Incase anybody needs a Python solution (1)
C++ code starting from (0,0) index. But giving error "your code might be failing for larger test-cases" (1)
Simple recursive approach with memoization (1)
Elegant Top-Down Approch (1)
A Simple CPP Solution (1)
"Your code might be failing for larger test-cases" (JAVA) (3)
Very Easy C++ Sol. Easily understandable (1)
Alert ! Spoilers Ahead(Tabulation approach) (2)
Why is top down like this wrong? (2)
Easiest C++ solution Bottom Up DP! O(n^2) (1)
Simple bottom up approach (1)
Easy cpp solution in O(m*n) using bottom up approach (1)
Why does the hint asks to proceed from bottom -right instead of top-left?Also my solution has an error i am unable to find (1)
O(m*n) code C++ (1)
Perfect solution (1)
Is it possible to Solve this using TOP-DOWN approach? (4)
Could not understand a particular case (3)
Wrong paths to take! (1)
Error in logic:Getting wrong answer in Bottom-Up(starting from top-left) approach (1)