InterviewBit Problems
Coins in a Line : Solved
About the Coins in a Line : Solved category
(1)
Easy memoization technique
(1)
Its T(i,j)=max{ai-T(i+1,j),aj-T(i,j-1)} right?
(1)
Solved and code is very light and simplistic, find if i missed anything
(1)
C++ DP Memoization
(2)
My Solutions ( recursion+memoization ) best to learn dp
(1)
Bottom Up, Easy, C++, what more you need, Deepika?
(1)
C++ solution using memoization and prefix sum
(1)
Easy DP Java solution
(1)
Very easily understandable c++ code
(1)
Easy soln using cpp
(1)
Bottom-Up DP Video Tutorial
(1)
Easy CPP Coin solution using DP
(1)
Why is this O(n) showing tle for large test cases
(1)
Easy cpp solution turn by turn concept
(1)
Alert ! Spoilers ahead. This solution is definitely useful and worth looking at
(2)
Easy Recursion with memoization
(3)
Easiest solution thanks to tushar roy (NRI)
(1)
Simple recursive easy to understand solution
(1)
Simple Solution Gfg
(1)
3d dp using memoization
(1)
Elegant top-down memoization solution in C++
(1)
C++ Solution using Top down approach
(1)
Python : Pure recursive solution with dict based memoization
(1)
More elegant solution
(1)
next page →