InterviewBit Problems   Rod Cutting : Unsolved

About the Rod Cutting : Unsolved category (1)
O(N3) giving TLE (2)
Explain why dp[i][i+1] need to be INT_MAX (2)
Build the final vector solution in O(n) time (1)
Failing for larger test cases solved (2)
FAILING for large cases ...plzz help (1)
Dofficulty in understanding the problem (3)
Failing for larger testcases - Please Help (1)
Getting Memory Limit Exceeded - Please help (1)
Finding min sum is easy, printing cuts is difficult (2)
Wrong Test Case or my algo is wrong (2)
Amiguity in expected output (2)
See Expected output button on click is giving wrong answer (1)
Partially Correct Answer--------**can you plz tell test case which fails** (3)
Can someone help me, I didnt understand anything from the editorial (1)
How the complexity of solution approach is O(N^3)?Should not it be pseudo exponential? (2)
Question isn't designed carefully (1)
I am getting partially correct answer but segmentation fault. Any ideas what it can be ? I have implemented a bottom up approach (1)
Ambigous problem (3)
Partially Correct (3)
Getting seg fault on submission (1)
Expected output is incorrect (2)
The same test fails when "Submit" and passes when "Test with custom input" (2)
"See expected otput" fails (1)
In my code I am using recursion. If i used "long long ret=dp[l][r];" It gave TLE (2)