My Unique Solution Just By Using HashMap To Store the Element and corresponding Updated Index
[An Increment Problem : Unsolved]
(2)
Everyone is using the concept of LCS that is good but the interviewer wants that come to this problem own solution ... TOP down approach without LCS
[Longest Palindromic Subsequence : Solved]
(1)
BFS K USE KRK aaram se lag jayega recursion k chutiyapa main nhi padna pls
[Burn a Tree : Unsolved]
(1)
Simple C++ soltuion 8-lines of code, Top - to - Bottom Approach
[Maximum Path in Triangle : Solved]
(1)