Almost Increasing Subsequence Solution | Codeforces 1818C | Codeforces Round 869 (Div. 2) | English

In this video, I walk through the solution to problem C from Codeforces Round 869 (Div. 2) contest held on: Contest link: https://codeforces.com/contest/1818 Problem name: "Almost Increasing Subsequence" Editorial: https://codeforces.com/blog/entry/115586 I explain the thought process and logic behind the solution and show how to implement it in code. Don't forget to like and subscribe for more coding content! #codeforces #programming #coding #competitiveprogramming #div2, #implementation, #dp, #dynamicprogramming, #greedy, code + solution, code + explanation, today codeforces contest solutions Something else: https://twitter.com/sreejithcoast