InterviewBit Problems   N digit numbers with digit sum S : Solved

About the N digit numbers with digit sum S : Solved category (1)
C++ solution. Time Complexity O(N^2). Space Complexity O(N^2) (1)
Easy Memoization (1)
Easy C++ backtracking using Memoization (1)
Getting TLE for test case A = 75, B = 22 (1)
C++ solution using 2D dp (1)
Wierd behaviour. Runtime error on B<=8 and no error on B>8 (3)
Lang: C++, Complexity[Time,Space]: [O(N*S), O(N*S)] (1)
Is there any logical mistake in this code? (1)
Very simple bottom up solution using recursion and memoization (1)
Cpp dp solution (3)
O(S*N) Removing 10 factor (1)
Clean recursive and iterative solutions (5)
Python DP Solution (1)
Easy C++ recursive solution using memoization (1)
Giving runtime error (1)
I don't seem to understand what is wrong in this code. My submission is failing for values 75,22. PLease help (2)
Code might fail for larger test cases.What is the problem in this code? Please help (1)
What is wrong in this logic (4)
Getting TLE with this dp solution why (1)
Java Fastest solution (3)
Utility of val < 0 in the given solution (1)
Tests failed w.r.t efficiency with Python (1)
Provide strict test cases (1)