How to solve this ladder problem?

#1

Problem
https://www.hackerearth.com/practice/algorithms/dynamic-programming/introduction-to-dynamic-programming-1/practice-problems/algorithm/ladder-ride-1/

What will be the value of a[ ] and c [] ?

And how to solve ?

#2

@anuj_it,
No need of matrix exponentiation. Constraints are not that large. Simply do it by bottom up DP for each test case.

1 Like
#3

@abhijeet.srivastava6499 Actually, I haven’t reached till DP lectures, so I dont know how to use them. Hence plz let me know using matrix exponentiation (Recurrence relation).

#4

@anuj_it,
Matrix exponentiation would just overshoot the problem, and as a beginner would only confuse you more. Mark this problem, and do it when you have done DP.

1 Like
#5

Okay got it. Thanks !!!
Would you let me know which topics are beginner friendly ? Because, many questions feel too hard.

#6

@anuj_it,
Difficulty is not a very comprehensive thing, specially in CP. Harder topics would require easier topics as pre-requisites, so without learning the easier topics first, you wouldn’t understand harder ones, and almost everywhere you would learn Algos or DS from, pre-requisites would be specified. And problems are just about problem solving, and little about knowledge, so if you feel a problem is too hard, just read it’s editorial after thinking for some time. Either you will learn a new topic, or a new problem solving strategy. It’s good as far as you learnt something new.

1 Like
#7

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.